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

Which statement about a recursive function without a reachable base case is correct?

  1. AThe compiler always turns it into a loop that ends safely
  2. BIt returns 0 automatically
  3. CIt runs in O(1) time
  4. DIt keeps calling itself until the call stack overflows
2.Algorithms & complexityHard

Which statement about little-o notation is correct?

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

What is the worst-case height of a binary search tree with n nodes if keys are inserted in sorted order?

  1. An (it becomes a linked list)
  2. Blog₂ n
  3. C1
  4. D√n
4.Data structuresHard

In Kruskal's minimum spanning tree algorithm, what is the union-find structure used for?

  1. ASorting the edges by weight
  2. BChecking whether an edge's two endpoints are already connected
  3. CStoring each vertex's current distance from the source during the search
  4. DChoosing the starting vertex
5.Graph theoryMedium
ABCDEEuler circuitEuler path, no circuitneither

Does the connected graph have an Euler circuit, an Euler path that is not a circuit, or neither? Click your answer.

|V| = 5|E| = 6
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
1916201312103ABCDE

Kruskal’s algorithm builds a minimum spanning tree. Click the edge it adds as edge number 2; skipped edges do not count.

k = 2
  1. 1edge AB
  2. 2edge AC
  3. 3edge BC
  4. 4edge BD
  5. 5edge CE
  6. 6edge DE
  7. 7edge BE

3Solutions

1.Algorithms & complexity

Answer: D · It keeps calling itself until the call stack overflows

Why this is the answer

Without a base case the recursion never stops; in practice memory for stack frames runs out and the program crashes.

Answer

D · It keeps calling itself until the call stack overflows
2.Algorithms & complexity

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

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

Answer: A · n (it becomes a linked list)

Why this is the answer

Sorted insertions create a degenerate tree with height n, making searches O(n). Balanced trees prevent this.

Answer

A · n (it becomes a linked list)
4.Data structures

Answer: B · Checking whether an edge's two endpoints are already connected

Why this is the answer

Find tells whether both endpoints are in the same component; if not, the edge is added and union merges the components.

Answer

B · Checking whether an edge's two endpoints are already connected
5.Graph theory

Answer: Euler circuit

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.

Degrees

deg(A) = 2, deg(B) = 4, deg(C) = 2, deg(D) = 2, deg(E) = 2

Odd vertices

0
Euler circuit

Answer

Euler circuit
6.Graph theory

Answer: edge DE

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.

Kruskal’s algorithm

1. BE (3)
2. DE (10)
3. CE (12)
4. AC (16)

edge number 2

DE

Answer

edge DE

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