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 time complexity of computing the n-th Fibonacci number with a bottom-up table?

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

Which statement about selecting the k-th smallest element of an unsorted array is correct?

  1. AQuickselect runs in expected O(n), and median-of-medians guarantees O(n) worst case
  2. BQuickselect runs in O(log n) worst case, because it recurses on only one side of the pivot
  3. CSelection always needs Ω(n log n) because it requires sorting
  4. DSelection is only possible in O(n²)
3.Data structuresMedium

A queue is implemented with two stacks: push onto an "in" stack, and pop from an "out" stack, refilling it from "in" when empty. What is the amortised cost per operation?

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

In a hash table using open addressing, why is deletion often done with a "tombstone" marker?

  1. AEmptying the slot could break the probe sequence for other keys
  2. BTombstones speed up hashing
  3. CIt makes the table sorted
  4. DDeleted keys must be kept forever for security, so slots can never be reused
5.Graph theoryMedium
ABCDEFGEuler 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| = 7|E| = 8
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
102071954211713153ABCDEFG

Find the total weight W of a minimum spanning tree of the weighted graph.

|V| = 7|E| = 12
W =

3Solutions

1.Algorithms & complexity

Answer: B · O(n)

Why this is the answer

Filling the table from 0 to n takes one addition per entry, so the work is linear instead of exponential.

Answer

B · O(n)
2.Algorithms & complexity

Answer: A · Quickselect runs in expected O(n), and median-of-medians guarantees O(n) worst case

Why this is the answer

Quickselect's expected work is n + n/2 + n/4 + ... = O(n) with random pivots; choosing the pivot as a median of medians makes the worst case linear.

Answer

A · Quickselect runs in expected O(n), and median-of-medians guarantees O(n) worst case
3.Data structures

Answer: C · O(1)

Why this is the answer

Each element is pushed and popped at most twice in total, so although one refill can take O(n), the average over a sequence is O(1).

Answer

C · O(1)
4.Data structures

Answer: A · Emptying the slot could break the probe sequence for other keys

Why this is the answer

If a deleted slot became empty, later searches might stop early and miss keys that were placed further along the probe chain.

Answer

A · Emptying the slot could break the probe sequence for other keys
5.Graph theory

Answer: neither

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) = 1, deg(B) = 3, deg(C) = 3, deg(D) = 2, deg(E) = 3, deg(F) = 2, deg(G) = 2

Odd vertices

A, B, C, E → 4
neither

Answer

neither
6.Graph theory

Answer: W = 28

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

EF (1): take
DF (2): take
GE (3): take
DE (4): skip, closes a cycle
CE (5): take
BC (7): take
AB (10): take

Total weight

W = 1 + 2 + 3 + 5 + 7 + 10 = 28

Answer

W = 28

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