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

What does it mean that a problem has optimal substructure?

  1. AEvery subproblem has the same size
  2. BThe problem has exactly one optimal solution, which every subproblem shares
  3. CThe problem can be solved in constant time
  4. DAn optimal solution can be built from optimal solutions of its subproblems
2.Algorithms & complexityHard

Karatsuba multiplication satisfies T(n) = 3T(n/2) + O(n). What does this solve to?

  1. AΘ(n²)
  2. BΘ(n log n)
  3. CΘ(nlog₂ 3), about n1.585
  4. DΘ(n3)
3.Data structuresMedium

A hash table of size 7 uses h(k) = k mod 7 and linear probing. After inserting 10, where is 17 stored?

  1. AIndex 4
  2. BIndex 0
  3. CIndex 6
  4. DIndex 3
4.Data structuresHard

Which data structure supports an LRU (least recently used) cache with O(1) get and put?

  1. AA hash map combined with a doubly linked list
  2. BA binary search tree only
  3. CA single sorted array
  4. DA stack only
5.Graph theoryMedium

A connected graph has 6 vertices and 16 edges. How many edges k must be removed to leave a spanning tree?

|V| = 6|E| = 16
k =
6.Graph theoryHard
ABCDEF

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

M = adjacency matrixL = 3
N =

3Solutions

1.Algorithms & complexity

Answer: D · An optimal solution can be built from optimal solutions of its subproblems

Why this is the answer

Optimal substructure is required for both greedy algorithms and dynamic programming to produce correct answers.

Answer

D · An optimal solution can be built from optimal solutions of its subproblems
2.Algorithms & complexity

Answer: C · Θ(nlog₂ 3), about n1.585

Why this is the answer

Since log₂ 3 ≈ 1.585 > 1, the leaves dominate by the master theorem, beating the O(n²) schoolbook method.

Answer

C · Θ(nlog₂ 3), about n1.585
3.Data structures

Answer: A · Index 4

Why this is the answer

10 mod 7 = 3 and 17 mod 7 = 3; index 3 is taken, so linear probing tries the next slot, index 4.

Answer

A · Index 4
4.Data structures

Answer: A · A hash map combined with a doubly linked list

Why this is the answer

The hash map finds nodes in O(1) and the doubly linked list moves accessed items to the front and evicts from the back in O(1).

Answer

A · A hash map combined with a doubly linked list
5.Graph theory

Answer: k = 11

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.

Edges of a spanning tree

6 − 1 = 5

Edges to remove

k = 16 − 5 = 11

Answer

k = 11
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

One more step

(M³)EA = 1·0 + 1·1 + 1·1 + 2·0 + 3·0 + 1·0 = 2

Answer

N = 2

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