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 activity that starts earliest
  2. BPick the shortest activity first
  3. CPick the activity with the fewest overlaps first, then repeat with the compatible ones
  4. DPick the activity that finishes earliest, then repeat with the compatible ones
2.Algorithms & complexityHard

Which statement about selecting the k-th smallest element of an unsorted array is correct?

  1. AQuickselect runs in O(log n) worst case, because it recurses on only one side of the pivot
  2. BSelection always needs Ω(n log n) because it requires sorting
  3. CQuickselect runs in expected O(n), and median-of-medians guarantees O(n) worst case
  4. DSelection is only possible in O(n²)
3.Data structuresMedium

A queue is implemented with two stacks: push onto an "in" stack, and pop from an "out" stack, refilling it from "in" when empty. What is the amortised cost per operation?

  1. AO(n)
  2. BO(log n)
  3. CO(1)
  4. DO(n²)
4.Data structuresHard

Why might a server choose its hash function at random from a universal family?

  1. ATo remove the need to resize the table
  2. BTo make the hash table sorted
  3. CTo make it very unlikely that an attacker can pick many keys that all collide
  4. DTo guarantee that no two keys can ever collide, whatever keys an attacker sends
5.Graph theoryMedium

A tree has 3 vertices of degree 3, and all its other vertices are leaves (degree 1). How many leaves L does it have?

3 × deg 3
L =
6.Graph theoryHard
ABCDE

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

M = adjacency matrixL = 3
N =

3Solutions

1.Algorithms & complexity

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

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

Answer: C · Quickselect runs in expected O(n), and median-of-medians guarantees O(n) worst case

Why this is the answer

Quickselect's expected work is n + n/2 + n/4 + ... = O(n) with random pivots; choosing the pivot as a median of medians makes the worst case linear.

Answer

C · Quickselect runs in expected O(n), and median-of-medians guarantees O(n) worst case
3.Data structures

Answer: C · O(1)

Why this is the answer

Each element is pushed and popped at most twice in total, so although one refill can take O(n), the average over a sequence is O(1).

Answer

C · O(1)
4.Data structures

Answer: C · To make it very unlikely that an attacker can pick many keys that all collide

Why this is the answer

With universal hashing the expected number of collisions is small for any set of keys, since the attacker does not know which function was chosen.

Answer

C · To make it very unlikely that an attacker can pick many keys that all collide
5.Graph theory

Answer: L = 5

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 + 9 = 2(L + 3) − 2
L = 5

Answer

L = 5

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

6.Graph theory

Answer: N = 6

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

One more step

(M³)BD = 1·0 + 4·1 + 2·0 + 1·0 + 2·1 = 6

Answer

N = 6

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