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

In the activity selection problem, which greedy rule always gives a maximum number of non-overlapping activities?

  1. APick the shortest activity first
  2. BPick the activity with the fewest overlaps first, then repeat with the compatible ones
  3. CPick the activity that finishes earliest, then repeat with the compatible ones
  4. DPick the activity that starts earliest
2.Algorithms & complexityHard

What is the running time of Dijkstra's algorithm with a binary heap on a graph with V vertices and E edges?

  1. AO(V × E)
  2. BO(V³)
  3. CO((V + E) log V)
  4. DO(V + E)
3.Data structuresMedium

How does extract-min work in a binary min-heap?

  1. AMove the last element to the root and sift it down
  2. BRemove the root and shift all elements one place left
  3. CRemove the last element of the array
  4. DSearch all leaves for the new minimum
4.Data structuresHard

What is the main advantage of a skip list over a sorted linked list?

  1. AIt stores keys without order
  2. BIt uses no extra memory
  3. CGuaranteed O(1) search because every node stores a pointer to every other node
  4. DExpected O(log n) search by using several levels of forward pointers
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| = 7
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
ABCDE

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

M = adjacency matrixL = 2
N =

3Solutions

1.Algorithms & complexity

Answer: C · Pick the activity that finishes earliest, then repeat with the compatible ones

Why this is the answer

Choosing the earliest finishing time can be proven optimal by an exchange argument; the other rules have counterexamples.

Answer

C · Pick the activity that finishes earliest, then repeat with the compatible ones
2.Algorithms & complexity

Answer: C · O((V + E) log V)

Why this is the answer

There are V extract-min and up to E decrease-key operations, each O(log V); a Fibonacci heap improves this to O(E + V log V).

Answer

C · O((V + E) log V)
3.Data structures

Answer: A · Move the last element to the root and sift it down

Why this is the answer

The last element fills the hole at the root and is swapped with its smaller child until the heap property holds, taking O(log n).

Answer

A · Move the last element to the root and sift it down
4.Data structures

Answer: D · Expected O(log n) search by using several levels of forward pointers

Why this is the answer

Randomised levels allow searches to skip many nodes, giving expected O(log n) search, insert and delete.

Answer

D · Expected O(log n) search by using several levels of forward pointers
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) = 2, deg(B) = 4, deg(C) = 3, deg(D) = 2, deg(E) = 3

Odd vertices

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

Common neighbours

(M²)AC = 0·1 + 1·1 + 1·0 + 0·0 + 0·0 = 1

Answer

N = 1

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