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

Why does dynamic programming give no real speed-up for merge sort?

  1. ADynamic programming only works on graph problems, not on arrays
  2. BMerge sort has no recursive structure
  3. CIts subproblems do not overlap, so there is nothing to reuse
  4. DMerge sort is already O(n)
2.Algorithms & complexityHard

Which statement about little-o notation is correct?

  1. A2n = o(n), because 2n grows slowly
  2. Bn = o(n), since every function is little-o of itself
  3. Cn² = o(n)
  4. Dn = o(n²), but n is not o(n)
3.Data structuresMedium

In a binary heap stored in an array starting at index 0, where is the parent of the node at index i?

  1. AAt index ⌊i / 2⌋ + 1
  2. BAt index ⌊(i − 1) / 2⌋
  3. CAt index 2i + 1
  4. DAt index i − 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(n)
  3. CO(1)
  4. DO(log n)
5.Graph theoryMedium

How many different Hamilton circuits H does the complete graph K5 have? Circuits that differ only in the starting vertex or the direction count as the same.

K5
H =
6.Graph theoryHard
5114841191551ABCDEFG

Use Dijkstra’s algorithm to find the length d(G) of the shortest path from A to G in the weighted graph.

start: Aend: G
d(G) =

3Solutions

1.Algorithms & complexity

Answer: C · Its subproblems do not overlap, so there is nothing to reuse

Why this is the answer

Merge sort's halves are disjoint and each is solved once; DP helps only when subproblems recur, as in Fibonacci.

Answer

C · Its subproblems do not overlap, so there is nothing to reuse
2.Algorithms & complexity

Answer: D · n = o(n²), but n is not o(n)

Why this is the answer

f = o(g) means f(n) / g(n) tends to 0; n / n² tends to 0, but n / n = 1 does not.

Answer

D · n = o(n²), but n is not o(n)
3.Data structures

Answer: B · At index ⌊(i − 1) / 2⌋

Why this is the answer

Children of i are at 2i + 1 and 2i + 2, so the parent of i is ⌊(i − 1) / 2⌋; with 1-based indexing it is ⌊i / 2⌋.

Answer

B · At index ⌊(i − 1) / 2⌋
4.Data structures

Answer: B · 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

B · O(n)
5.Graph theory

Answer: H = 12

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.

Count

H = (5 − 1)!/2 = 24/2 = 12

Answer

H = 12
6.Graph theory

Answer: d(G) = 14

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

Each line: the vertex settled, its final distance, and the neighbours whose distance improves.

A (0): C: 5
C (5): B: 6, E: 13, G: 20
B (6): D: 20, G: 15
E (13): D: 17, F: 24, G: 14
G (14)
D (17)
F (24)

Shortest path

A → C → E → G
d(G) = 14

Answer

d(G) = 14

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