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

Why does binary search not give O(log n) time on a singly linked list?

  1. AReaching the middle element takes O(n) steps, since there is no direct index access
  2. BComparisons on linked list nodes are slower
  3. CBinary search needs at least twice the memory
  4. DLinked lists cannot be sorted
3.Data structuresMedium

A trie (prefix tree) is especially efficient for:

  1. AFinding shortest paths
  2. BPrefix searches such as autocomplete
  3. CStoring matrices
  4. DSorting numbers
4.Data structuresHard

For each element of an array you want the next greater element to its right, in O(n) total time. Which structure helps?

  1. AA hash table of all elements
  2. BA binary search tree rebuilt for each element
  3. CA stack that keeps elements waiting for their answer
  4. DA queue that holds every pair of elements
5.Graph theoryMedium

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

K5
H =
6.Graph theoryHard
ABCDEF

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

M = adjacency matrixL = 2
N =

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: A · Reaching the middle element takes O(n) steps, since there is no direct index access

Why this is the answer

Binary search needs O(1) access to the middle; on a linked list walking there costs linear time, so the total is O(n).

Answer

A · Reaching the middle element takes O(n) steps, since there is no direct index access
3.Data structures

Answer: B · Prefix searches such as autocomplete

Why this is the answer

Tries store strings by characters along paths, so lookups and prefix queries take time proportional to the key length.

Answer

B · Prefix searches such as autocomplete
4.Data structures

Answer: C · A stack that keeps elements waiting for their answer

Why this is the answer

Scanning left to right, pop every stacked element smaller than the current one (the current element is their answer), then push it; each element moves at most twice.

Answer

C · A stack that keeps elements waiting for their answer
5.Graph theory

Answer: H = 12

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 = (5 − 1)!/2 = 24/2 = 12

Answer

H = 12
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 0
B: 1 0 1 1 1 0
C: 1 1 0 0 0 0
D: 0 1 0 0 1 1
E: 0 1 0 1 0 1
F: 0 0 0 1 1 0

Common neighbours

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

Answer

N = 2

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