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

The time complexity of naive recursive Fibonacci (fib(n) = fib(n−1) + fib(n−2)) is:

  1. AExponential
  2. BConstant
  3. CLogarithmic
  4. DLinear
2.Algorithms & complexityHard

Insertion sort runs in O(n) on sorted input. Does this contradict the Ω(n log n) lower bound for comparison sorting?

  1. ANo, because insertion sort is not a comparison sort
  2. BYes, but only for arrays shorter than 100
  3. CYes, the lower bound is therefore wrong
  4. DNo, the lower bound applies to the worst case over all inputs, not to every input
3.Data structuresMedium

What happens when a hash table rehashes after its load factor exceeds a threshold?

  1. AThe existing keys are sorted in place
  2. BA larger table is allocated and every key is inserted again
  3. CThe oldest keys are deleted to make room
  4. DOnly the colliding keys are moved to a new overflow list at the end of the table
4.Data structuresHard

In a circular buffer, front == rear can mean either empty or full. What is a common way to tell them apart?

  1. AMake the buffer size a power of two
  2. BStore the front and rear in the same variable
  3. CKeep a separate element count, or always leave one slot unused
  4. DAlways clear the buffer whenever front equals rear, so the state is empty
5.Graph theoryMedium

How many different Hamilton circuits H does the complete graph K6 have? Circuits that differ only in the starting vertex or the direction count as the same.

K6
H =
6.Graph theoryHard
8271812101339111920ABCDEFG

Prim’s algorithm builds a minimum spanning tree starting from vertex B. Click the edge it adds as edge number 4.

start: Bk = 4
  1. 1edge AB
  2. 2edge AC
  3. 3edge BC
  4. 4edge BD
  5. 5edge CE
  6. 6edge DE
  7. 7edge DF
  8. 8edge EF
  9. 9edge GB
  10. 10edge GC
  11. 11edge GD
  12. 12edge GE

3Solutions

1.Algorithms & complexity

Answer: A · Exponential

Why this is the answer

The call tree grows roughly like φⁿ (about 1.618ⁿ). Memoisation reduces it to O(n).

Answer

A · Exponential
2.Algorithms & complexity

Answer: D · No, the lower bound applies to the worst case over all inputs, not to every input

Why this is the answer

The bound says every comparison sort needs about n log n comparisons on some input of size n; special inputs can be much faster.

Answer

D · No, the lower bound applies to the worst case over all inputs, not to every input
3.Data structures

Answer: B · A larger table is allocated and every key is inserted again

Why this is the answer

Since the index is computed modulo the table size, all keys must be rehashed into the new, larger table; with doubling this stays O(1) amortised.

Answer

B · A larger table is allocated and every key is inserted again
4.Data structures

Answer: C · Keep a separate element count, or always leave one slot unused

Why this is the answer

With a count, empty means count = 0 and full means count = capacity; with one empty slot, full is defined as (rear + 1) mod n == front.

Answer

C · Keep a separate element count, or always leave one slot unused
5.Graph theory

Answer: H = 60

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.

Count

H = (6 − 1)!/2 = 120/2 = 60

Answer

H = 60
6.Graph theory

Answer: edge CE

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.

Prim’s algorithm

1. BC (7)
2. AC (2)
3. GB (9)
4. CE (12)
5. EF (3)
6. DE (10)

edge number 4

CE

Answer

edge CE

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