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(1)
  2. BO(n²)
  3. CO(log n)
  4. DO(n)
2.Algorithms & complexityHard

Why does any comparison-based search in a sorted array need Ω(log n) comparisons in the worst case?

  1. AEvery element must be compared at least once
  2. BA decision tree with n possible outcomes must have depth at least log₂ n
  3. CBinary search is the only possible algorithm, and it needs log₂ n comparisons
  4. DComparisons take logarithmic time each
3.Data structuresMedium

What is the time complexity of searching for a key in a balanced binary search tree?

  1. AO(n)
  2. BO(1)
  3. CO(log n)
  4. DO(n log n)
4.Data structuresHard

Which statement about heapsort is correct?

  1. AIt sorts in place in O(n log n) worst-case time but is not stable
  2. BIt is stable and needs O(n) extra memory
  3. CIt needs a binary search tree as extra storage, so it uses O(n) extra memory
  4. DIt runs in O(n) time on any input
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
14114717212ABCDEF

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

start: Aend: F
d(F) =

3Solutions

1.Algorithms & complexity

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

A · O(1)
2.Algorithms & complexity

Answer: B · A decision tree with n possible outcomes must have depth at least log₂ n

Why this is the answer

Each comparison at most halves the set of remaining possibilities, so distinguishing n positions needs at least log₂ n comparisons.

Answer

B · A decision tree with n possible outcomes must have depth at least log₂ n
3.Data structures

Answer: C · O(log n)

Why this is the answer

A balanced tree has height about log₂ n, so a search follows one path from root to leaf.

Answer

C · O(log n)
4.Data structures

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

A · It sorts in place in O(n log n) worst-case time but is not stable
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: d(F) = 24

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): B: 14, C: 11
C (11)
B (14): D: 21, E: 26
D (21): E: 22, F: 28
E (22): F: 24
F (24)

Shortest path

A → B → D → E → F
d(F) = 24

Answer

d(F) = 24

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