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

To show that a new problem X is NP-hard, what must you do?

  1. AReduce X to a known NP-hard problem in polynomial time
  2. BShow that X can be verified in polynomial time
  3. CReduce a known NP-hard problem to X in polynomial time
  4. DShow that X has no polynomial algorithm for small inputs
3.Data structuresMedium

In a circular queue stored in an array of capacity n, how is the next position after index i computed?

  1. A2i + 1
  2. B(i − 1) mod n
  3. C(i + 1) mod n
  4. Di + 1
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 exactly log2 n
  3. CThe height is at most 2 log2(n + 1)
  4. DThe height is at most log2 n + 1
5.Graph theoryMedium

A tree has 3 vertices of degree 4, 4 vertices of degree 5, 2 vertices of degree 2, and all its other vertices are leaves (degree 1). How many leaves L does it have?

3 × deg 44 × deg 52 × deg 2
L =
6.Graph theoryHard
ABCDEF

How many closed walks of length 2 start and end at B? A walk may repeat vertices and edges. Call the number N.

M = adjacency matrixL = 2
N =

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: C · Reduce a known NP-hard problem to X in polynomial time

Why this is the answer

If a known hard problem can be transformed into X efficiently, a fast algorithm for X would solve the known problem too.

Answer

C · Reduce a known NP-hard problem to X in polynomial time
3.Data structures

Answer: C · (i + 1) mod n

Why this is the answer

The modulo operation wraps index n − 1 back to 0, so the array is reused without shifting elements.

Answer

C · (i + 1) mod n
4.Data structures

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

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

Answer: L = 20

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.

Handshake lemma for a tree

L + 36 = 2(L + 9) − 2
L = 20

Answer

L = 20

Shortcut: L = 2 + Σ (d − 2) over the vertices with degree d ≥ 3.

6.Graph theory

Answer: N = 3

Degrees: the degree of a vertex is the number of edges that meet it. Every edge has two ends, so the degrees add up to twice the number of edges: Σ deg(v) = 2|E| (the handshake lemma). The number of vertices with odd degree is therefore even. Kn has n(n − 1)/2 edges, a k-regular graph on n vertices has nk/2, and a tree on n vertices has n − 1 edges.

Adjacency matrix

A: 0 1 1 0 0 0
B: 1 0 0 1 1 0
C: 1 0 0 0 1 0
D: 0 1 0 0 1 0
E: 0 1 1 1 0 1
F: 0 0 0 0 1 0

Common neighbours

(M²)BB = 1·1 + 0·0 + 0·0 + 1·1 + 1·1 + 0·0 = 3

Answer

N = 3

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