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

Is it correct to say that an O(n²) algorithm is also O(n³)?

  1. ANo, because Big O must always state the exact growth rate of the function
  2. BYes, because Big O is an upper bound and n² grows no faster than n³
  3. CNo, because n³ is smaller than n² for large n
  4. DYes, but only if n is smaller than 100
2.Algorithms & complexityHard

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

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

An in-order traversal of a binary search tree visits the keys in:

  1. ADescending order always
  2. BAscending sorted order
  3. CLevel order
  4. DInsertion order
4.Data structuresHard

How does a radix tree (compressed trie) improve on a plain trie?

  1. AIt stores each word in a hash table at the root instead of in separate nodes
  2. BIt sorts the children of each node by frequency
  3. CIt merges chains of single-child nodes into one edge labelled with a string
  4. DIt keeps only the first letter of each word
5.Graph theoryMedium
ABCDEFGEuler 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| = 7|E| = 9
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
ABCDE

How many closed walks of length 3 start and end at A? A walk may repeat vertices and edges. Call the number N.

M = adjacency matrixL = 3
N =

3Solutions

1.Algorithms & complexity

Answer: B · Yes, because Big O is an upper bound and n² grows no faster than n³

Why this is the answer

Big O is an upper bound, so the statement is true but not tight; Θ(n²) states the exact growth rate.

Answer

B · Yes, because Big O is an upper bound and n² grows no faster than n³
2.Algorithms & complexity

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

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

Answer: B · Ascending sorted order

Why this is the answer

Visiting the left subtree, then the node, then the right subtree outputs BST keys in sorted order.

Answer

B · Ascending sorted order
4.Data structures

Answer: C · It merges chains of single-child nodes into one edge labelled with a string

Why this is the answer

Collapsing paths with no branching reduces the number of nodes and the memory used while keeping prefix search.

Answer

C · It merges chains of single-child nodes into one edge labelled with a string
5.Graph theory

Answer: neither

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) = 3, deg(C) = 3, deg(D) = 4, deg(E) = 2, deg(F) = 1, deg(G) = 3

Odd vertices

B, C, F, G → 4
neither

Answer

neither
6.Graph theory

Answer: N = 2

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

One more step

(M³)AA = 2·0 + 1·1 + 1·1 + 1·0 + 1·0 = 2

Answer

N = 2

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