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

Dynamic programming is useful when a problem has:

  1. ANo subproblems at all, so it can be solved in one step
  2. BOverlapping subproblems and optimal substructure
  3. CA single loop
  4. DOnly random inputs
2.Algorithms & complexityHard

What does the recurrence T(n) = 2T(n/2) + n log n solve to?

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

Which data structure is used to check whether the brackets in "{[()]}" are balanced?

  1. AA queue
  2. BA hash table
  3. CA binary search tree
  4. DA stack
4.Data structuresHard

What guarantee do the red-black tree rules give about the height of a tree with n keys?

  1. AThe height is at most n / 2
  2. BThe height is at most 2 log2(n + 1)
  3. CThe height is exactly log2 n
  4. DThe height is at most log2 n + 1
5.Graph theoryMedium

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

|V| = 8|E| = 15
k =
6.Graph theoryHard
1413814145129ABCDEF

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: B · Overlapping subproblems and optimal substructure

Why this is the answer

Storing results of overlapping subproblems (memoisation or tabulation) avoids repeated work, turning exponential algorithms into polynomial ones.

Answer

B · Overlapping subproblems and optimal substructure
2.Algorithms & complexity

Answer: B · Θ(n log² n)

Why this is the answer

Level k does about n log(n / 2ᵏ) work, and summing over log n levels gives Θ(n log² n), the extended second case of the master theorem.

Answer

B · Θ(n log² n)
3.Data structures

Answer: D · A stack

Why this is the answer

Push each opening bracket and pop when a closing bracket appears; it must match the popped bracket and the stack must be empty at the end.

Answer

D · A stack
4.Data structures

Answer: B · The height is at most 2 log2(n + 1)

Why this is the answer

Every path has the same number of black nodes and red nodes cannot be adjacent, so the longest path is at most twice the shortest, giving height O(log n).

Answer

B · The height is at most 2 log2(n + 1)
5.Graph theory

Answer: k = 8

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

8 − 1 = 7

Edges to remove

k = 15 − 7 = 8

Answer

k = 8
6.Graph theory

Answer: d(F) = 35

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: 13
C (13): E: 27
B (14): E: 23
E (23): D: 37, F: 35
F (35)
D (37)

Shortest path

A → B → E → F
d(F) = 35

Answer

d(F) = 35

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