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 does amortised analysis measure?

  1. AThe cost of the single most expensive operation anywhere in the sequence
  2. BThe expected cost over random inputs
  3. CThe average cost per operation over a worst-case sequence of operations
  4. DThe cost of an algorithm on the best input
2.Algorithms & complexityHard

The halting problem shows that:

  1. ASome programs run faster on faster computers, so halting depends on hardware
  2. BNo algorithm can decide for every program and input whether it halts
  3. CLoops should be avoided
  4. DEvery program eventually halts
3.Data structuresMedium

How do you find the minimum key in a binary search tree?

  1. ALook at the root only
  2. BVisit every leaf and compare them
  3. CFollow right children from the root until there is no right child
  4. DFollow left children from the root until there is no left child
4.Data structuresHard

Which property must a red-black tree satisfy?

  1. AEvery node must be red
  2. BEvery red node must have red children, so red nodes always form unbroken chains to the leaves
  3. CThe root must be red
  4. DEvery path from a node to its descendant leaves has the same number of black nodes
5.Graph theoryMedium

A tree has 3 vertices of degree 3, 2 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 32 × deg 44 × deg 52 × deg 2
L =
6.Graph theoryHard
1512531376191718ABCDEFG

Kruskal’s algorithm builds a minimum spanning tree. Click the edge it adds as edge number 2; skipped edges do not count.

k = 2
  1. 1edge AB
  2. 2edge AC
  3. 3edge BC
  4. 4edge BD
  5. 5edge CE
  6. 6edge DE
  7. 7edge EF
  8. 8edge GB
  9. 9edge GC
  10. 10edge GD

3Solutions

1.Algorithms & complexity

Answer: C · The average cost per operation over a worst-case sequence of operations

Why this is the answer

Amortised analysis spreads the cost of rare expensive operations over many cheap ones, giving a guaranteed average for any sequence.

Answer

C · The average cost per operation over a worst-case sequence of operations
2.Algorithms & complexity

Answer: B · No algorithm can decide for every program and input whether it halts

Why this is the answer

Turing showed the halting problem is undecidable: assuming a decider exists leads to a contradiction with a program that does the opposite.

Answer

B · No algorithm can decide for every program and input whether it halts
3.Data structures

Answer: D · Follow left children from the root until there is no left child

Why this is the answer

The leftmost node has no smaller key in the tree, so it is the minimum; the cost is proportional to the height.

Answer

D · Follow left children from the root until there is no left child
4.Data structures

Answer: D · Every path from a node to its descendant leaves has the same number of black nodes

Why this is the answer

Red-black rules: nodes are red or black, root is black, red nodes have black children, and all paths have equal black-height, keeping height ≤ 2 log₂(n + 1).

Answer

D · Every path from a node to its descendant leaves has the same number of black nodes
5.Graph theory

Answer: L = 21

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 + 41 = 2(L + 11) − 2
L = 21

Answer

L = 21

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

6.Graph theory

Answer: edge BC

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.

Kruskal’s algorithm

1. BD (3)
2. BC (5)
3. EF (6)
4. DE (7)
5. AC (12)
6. GC (17)

edge number 2

BC

Answer

edge BC

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