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

The time complexity of naive recursive Fibonacci (fib(n) = fib(n−1) + fib(n−2)) is:

  1. AExponential
  2. BConstant
  3. CLinear
  4. DLogarithmic
2.Algorithms & complexityHard

The 0/1 knapsack problem solved with dynamic programming takes O(nW) time. Why is this called pseudo-polynomial?

  1. ABecause the algorithm is randomised and its running time varies with each input
  2. BW is a number, so the time is exponential in the number of bits used to write W
  3. CBecause it only works for W = 0
  4. DBecause n is always small
3.Data structuresMedium

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

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

For a hash table to work correctly, which rule must hash and equality follow?

  1. AEqual hash values imply equal keys
  2. BDifferent keys must have different hash values
  3. CEqual keys must have equal hash values
  4. DHash values must be prime numbers
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| = 9
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
22386139157414ABCDEFG

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 · Exponential

Why this is the answer

The call tree grows roughly like φⁿ (about 1.618ⁿ). Memoisation reduces it to O(n).

Answer

A · Exponential
2.Algorithms & complexity

Answer: B · W is a number, so the time is exponential in the number of bits used to write W

Why this is the answer

The running time is polynomial in the value of W but exponential in its length (log W bits); 0/1 knapsack is NP-complete.

Answer

B · W is a number, so the time is exponential in the number of bits used to write W
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: C · Equal keys must have equal hash values

Why this is the answer

If two equal keys hashed differently they would be stored in different buckets and lookups would fail; unequal keys may still share a hash.

Answer

C · Equal keys must have equal hash values
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) = 4, deg(C) = 3, deg(D) = 2, deg(E) = 3, deg(F) = 1, deg(G) = 4

Odd vertices

A, C, E, F → 4
neither

Answer

neither
6.Graph theory

Answer: d(F) = 18

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: 2
B (2): C: 4, D: 5, G: 17
C (4): E: 12, G: 11
D (5): E: 11, F: 18, G: 9
G (9)
E (11)
F (18)

Shortest path

A → B → D → F
d(F) = 18

Answer

d(F) = 18

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