Data Structures and Algorithms: cram pack

Formula sheets, the key method steps for every topic and 6 practice problems, with full solutions at the back.

New problemsBack to the course

In the print window, choose “Save as PDF” to keep a copy on your device.

1Formulas and methods

Graph theory

Handshake lemma
Σ deg(v) = 2|E|
Complete graphs
|E(Kn)| = n(n − 1)/2, |E(Km,n)| = m·n
Regular graph
|E| = n·k/2
Tree and forest
|E| = n − 1, |E| = n − c
Leaves of a tree
L = 2 + Σ (deg(v) − 2) over deg(v) ≥ 3
Euler
circuit: all degrees even; path: exactly 2 odd degrees
Hamilton circuits in Kn
(n − 1)!/2
Dijkstra update
d(v) = min(d(v), d(u) + w(u, v))
Walks of length L
(Mᴸ)ij

Method

  1. Write down the degree of every vertex; the degrees add up to twice the number of edges.
  2. For Euler questions, check that the graph is connected and count the vertices with odd degree.
  3. For trees, use n − 1 edges and the handshake lemma.
  4. For Dijkstra, keep a table of tentative distances and settle the smallest unsettled vertex each round.
  5. For a minimum spanning tree, sort the edges by weight and skip every edge that closes a cycle (Kruskal), or grow one tree from a start vertex (Prim).

2Practice problems

1.Algorithms & complexityMedium

Quicksort always uses the first element as pivot. On which input does it show its worst-case behaviour?

  1. AAn array of length 2
  2. BAn array whose elements are all different
  3. CAn array in random order
  4. DAn array that is already sorted
2.Algorithms & complexityHard

Insertion sort runs in O(n) on sorted input. Does this contradict the Ω(n log n) lower bound for comparison sorting?

  1. ANo, because insertion sort is not a comparison sort
  2. BYes, the lower bound is therefore wrong
  3. CYes, but only for arrays shorter than 100
  4. DNo, the lower bound applies to the worst case over all inputs, not to every input
3.Data structuresMedium

What is true of the adjacency matrix of an undirected graph?

  1. AIt is always upper triangular
  2. BIt is symmetric about the main diagonal
  3. CIts main diagonal always contains ones
  4. DEach row has exactly one 1
4.Data structuresHard

Without union by rank or path compression, what is the worst-case cost of a single find in a union-find structure with n elements?

  1. AO(n)
  2. BO(log n)
  3. CO(1)
  4. DO(α(n))
5.Graph theoryMedium

A tree has 2 vertices of degree 3, 3 vertices of degree 4, and all its other vertices are leaves (degree 1). How many leaves L does it have?

2 × deg 33 × deg 4
L =
6.Graph theoryHard
314157975104ABCDEF

Dijkstra’s algorithm runs from A. Click the vertex that is settled (made permanent) in round 5; A itself is round 1.

start: Around 5
  1. 1A
  2. 2B
  3. 3C
  4. 4D
  5. 5E
  6. 6F

3Solutions

1.Algorithms & complexity

Answer: D · An array that is already sorted

Why this is the answer

On sorted input the pivot is always the minimum, so one side is empty and the other has n − 1 elements, giving O(n²).

Answer

D · An array that is already sorted
2.Algorithms & complexity

Answer: D · No, the lower bound applies to the worst case over all inputs, not to every input

Why this is the answer

The bound says every comparison sort needs about n log n comparisons on some input of size n; special inputs can be much faster.

Answer

D · No, the lower bound applies to the worst case over all inputs, not to every input
3.Data structures

Answer: B · It is symmetric about the main diagonal

Why this is the answer

In an undirected graph edge {u, v} means both M[u][v] and M[v][u] are set, so the matrix equals its transpose.

Answer

B · It is symmetric about the main diagonal
4.Data structures

Answer: A · O(n)

Why this is the answer

Naive unions can link trees into a long chain, so find may follow n − 1 parent pointers; the two heuristics bring it close to constant.

Answer

A · O(n)
5.Graph theory

Answer: L = 10

Euler, Hamilton and trees: a connected graph has an Euler circuit (every edge once, back to the start) when every vertex has even degree, and an Euler path that is not a circuit when exactly two vertices have odd degree; the path then runs from one odd vertex to the other. A Hamilton circuit visits every vertex once; Kn has (n − 1)!/2 of them. A tree on n vertices has n − 1 edges, and a connected graph with m edges keeps a spanning tree after removing m − n + 1 edges.

Handshake lemma for a tree

L + 18 = 2(L + 5) − 2
L = 10

Answer

L = 10

Shortcut: L = 2 + Σ (d − 2) over the vertices with degree d ≥ 3.

6.Graph theory

Answer: C

Shortest paths and spanning trees: Dijkstra’s algorithm settles one vertex per round: the unsettled vertex with the smallest tentative distance. Its distance is then final, and every neighbour v gets d(v) = min(d(v), d(u) + w(u, v)). Kruskal’s algorithm builds a minimum spanning tree by taking the edges from light to heavy and skipping any edge that would close a cycle; Prim’s algorithm grows one tree from a start vertex by always adding the lightest edge that leaves it. A spanning tree of n vertices has n − 1 edges.

Dijkstra round by round

1. A (0): B: 3, C: 14
2. B (3): D: 10, E: 7
3. E (7): F: 17
4. D (10): F: 15
5. C (14)
6. F (15)

round 5

C

Answer

C

ExamProblems · examproblems.com/courses/data-structures-and-algorithms