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

A greedy algorithm:

  1. AMakes the locally best choice at each step
  2. BUses only recursion
  3. CAlways gives the optimal solution
  4. DTries every possible solution
2.Algorithms & complexityHard

What is the amortised cost of incrementing a binary counter, given that one increment may flip many bits?

  1. AO(n) per increment
  2. BO(1) per increment
  3. CO(log n) per increment
  4. DO(n log n) per increment
3.Data structuresMedium

How long does a search for a word of length L take in a trie with a fixed alphabet?

  1. AO(L × n)
  2. BO(L), independent of how many words are stored
  3. CO(n), where n is the number of words
  4. DO(log n), where n is the number of words
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 log2 n + 1
  2. BThe height is at most n / 2
  3. CThe height is at most 2 log2(n + 1)
  4. DThe height is exactly log2 n
5.Graph theoryMedium
ABCDEEuler 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| = 5|E| = 5
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
ABCDEF

How many walks of length 3 go from E to C? A walk may repeat vertices and edges. Call the number N.

M = adjacency matrixL = 3
N =

3Solutions

1.Algorithms & complexity

Answer: A · Makes the locally best choice at each step

Why this is the answer

Greedy algorithms are fast and optimal for some problems (e.g. Dijkstra, Huffman coding) but not in general (e.g. coin change with some coin systems).

Answer

A · Makes the locally best choice at each step
2.Algorithms & complexity

Answer: B · O(1) per increment

Why this is the answer

Over n increments, bit i flips about n / 2ⁱ times, so the total is less than 2n flips, an average of O(1) each.

Answer

B · O(1) per increment
3.Data structures

Answer: B · O(L), independent of how many words are stored

Why this is the answer

Each character selects one child, so a lookup takes L steps no matter how many words the trie contains.

Answer

B · O(L), independent of how many words are stored
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: Euler path, no circuit

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

Odd vertices

A, E → 2
Euler path, no circuit

Answer

Euler path, no circuit

The Euler path starts at one odd vertex and ends at the other.

6.Graph theory

Answer: N = 1

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 0 1 0 0 0
B: 0 0 1 1 1 0
C: 1 1 0 0 0 0
D: 0 1 0 0 1 1
E: 0 1 0 1 0 1
F: 0 0 0 1 1 0

One more step

(M³)EC = 0·1 + 1·1 + 1·0 + 2·0 + 3·0 + 1·0 = 1

Answer

N = 1

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