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

What is the amortised time complexity of appending to a dynamic array that doubles its capacity when full?

  1. AO(n)
  2. BO(n²)
  3. CO(1)
  4. DO(log n)
2.Algorithms & complexityHard

Using the master theorem, T(n) = 8T(n/2) + O(n²) solves to:

  1. AΘ(n² log n)
  2. BΘ(n²)
  3. CΘ(n log n)
  4. DΘ(n³)
3.Data structuresMedium

How does extract-min work in a binary min-heap?

  1. ARemove the root and shift all elements one place left
  2. BRemove the last element of the array
  3. CMove the last element to the root and sift it down
  4. DSearch all leaves for the new minimum
4.Data structuresHard

Which statement about heapsort is correct?

  1. AIt is stable and needs O(n) extra memory
  2. BIt runs in O(n) time on any input
  3. CIt needs a binary search tree as extra storage, so it uses O(n) extra memory
  4. DIt sorts in place in O(n log n) worst-case time but is not stable
5.Graph theoryMedium

A connected graph has 6 vertices and 10 edges. How many edges k must be removed to leave a spanning tree?

|V| = 6|E| = 10
k =
6.Graph theoryHard
207101411121354ABCDEFG

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

k = 4
  1. 1edge AC
  2. 2edge BC
  3. 3edge BD
  4. 4edge CE
  5. 5edge DE
  6. 6edge EF
  7. 7edge GC
  8. 8edge GD
  9. 9edge GE

3Solutions

1.Algorithms & complexity

Answer: C · O(1)

Why this is the answer

Copying all elements happens only at powers of two; spread over all appends, the average cost per append is constant.

Answer

C · O(1)
2.Algorithms & complexity

Answer: D · Θ(n³)

Why this is the answer

log₂ 8 = 3, and n² grows slower than n³, so the leaves dominate: Θ(n³).

Answer

D · Θ(n³)
3.Data structures

Answer: C · Move the last element to the root and sift it down

Why this is the answer

The last element fills the hole at the root and is swapped with its smaller child until the heap property holds, taking O(log n).

Answer

C · Move the last element to the root and sift it down
4.Data structures

Answer: D · It sorts in place in O(n log n) worst-case time but is not stable

Why this is the answer

Heapsort builds a max-heap and extracts the maximum n times within the same array; swaps over long distances can reorder equal keys.

Answer

D · It sorts in place in O(n log n) worst-case time but is not stable
5.Graph theory

Answer: k = 5

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.

Edges of a spanning tree

6 − 1 = 5

Edges to remove

k = 10 − 5 = 5

Answer

k = 5
6.Graph theory

Answer: edge BD

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. GE (4)
2. GD (5)
3. BC (7)
4. BD (10)
5. EF (12)
6. AC (20)

edge number 4

BD

Answer

edge BD

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