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

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

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

An application needs fast lookups and also needs to list keys in sorted order and answer range queries. Which structure fits best?

  1. AAn unsorted linked list
  2. BA stack
  3. CA hash table
  4. DA balanced binary search tree
4.Data structuresHard

Which property must a red-black tree satisfy?

  1. AThe root must be red
  2. BEvery node must be red
  3. CEvery path from a node to its descendant leaves has the same number of black nodes
  4. DEvery red node must have red children, so red nodes always form unbroken chains to the leaves
5.Graph theoryMedium
ABCDEFEuler 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| = 6|E| = 6
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
57141158639ABCDEFG

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

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

3Solutions

1.Algorithms & complexity

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

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

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

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

Answer: D · A balanced binary search tree

Why this is the answer

A balanced BST gives O(log n) lookups and keeps keys ordered, so in-order traversal and range queries are easy; a hash table scatters keys.

Answer

D · A balanced binary search tree
4.Data structures

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

C · Every path from a node to its descendant leaves has the same number of black nodes
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) = 4, deg(C) = 1, deg(D) = 2, deg(E) = 2, deg(F) = 2

Odd vertices

A, C → 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: 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: 7
2. B (5): D: 6, G: 8
3. D (6): F: 14
4. C (7): E: 22
5. G (8)
6. F (14): E: 20
7. E (20)

round 3

D

Answer

D

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