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. ALogarithmic
  2. BConstant
  3. CExponential
  4. DLinear
2.Algorithms & complexityHard

Which algorithm finds a minimum spanning tree by repeatedly adding the cheapest edge that does not form a cycle?

  1. APrim's algorithm starting from one node
  2. BDijkstra's algorithm
  3. CKruskal's algorithm
  4. DFloyd–Warshall
3.Data structuresMedium

What is the value of the postfix expression 3 4 + 2 * ?

  1. A14
  2. B10
  3. C24
  4. D11
4.Data structuresHard

The union-find (disjoint set) structure with union by rank and path compression has an amortised cost per operation of:

  1. AO(n)
  2. BO(α(n)), the inverse Ackermann function, which is practically constant
  3. CO(n²)
  4. DO(log n) exactly
5.Graph theoryMedium

How many different Hamilton circuits H does the complete graph K8 have? Circuits that differ only in the starting vertex or the direction count as the same.

K8
H =
6.Graph theoryHard
5105151092410ABCDEFG

Dijkstra’s algorithm runs from A. Click the vertex that is settled (made permanent) in round 6; A itself is round 1.

start: Around 6
  1. 1A
  2. 2B
  3. 3C
  4. 4D
  5. 5E
  6. 6F
  7. 7G

3Solutions

1.Algorithms & complexity

Answer: C · Exponential

Why this is the answer

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

Answer

C · Exponential
2.Algorithms & complexity

Answer: C · Kruskal's algorithm

Why this is the answer

Kruskal sorts edges by weight and adds them if they connect different components; Prim grows one tree from a start vertex.

Answer

C · Kruskal's algorithm
3.Data structures

Answer: A · 14

Why this is the answer

Push 3 and 4, + gives 7; push 2, * gives 7 × 2 = 14.

Answer

A · 14
4.Data structures

Answer: B · O(α(n)), the inverse Ackermann function, which is practically constant

Why this is the answer

With both optimisations, operations take O(α(n)) amortised time; α(n) ≤ 4 for any realistic n.

Answer

B · O(α(n)), the inverse Ackermann function, which is practically constant
5.Graph theory

Answer: H = 2520

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.

Count

H = (8 − 1)!/2 = 5040/2 = 2520

Answer

H = 2520
6.Graph theory

Answer: D

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

1. A (0): B: 5, C: 10
2. B (5)
3. C (10): E: 15, G: 12
4. G (12): D: 16
5. E (15): F: 24
6. D (16)
7. F (24)

round 6

D

Answer

D

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