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

Why does dynamic programming give no real speed-up for merge sort?

  1. AMerge sort has no recursive structure
  2. BMerge sort is already O(n)
  3. CIts subproblems do not overlap, so there is nothing to reuse
  4. DDynamic programming only works on graph problems, not on arrays
2.Algorithms & complexityHard

Strassen's algorithm multiplies matrices using 7 instead of 8 recursive multiplications of half-size blocks. What is its running time?

  1. AΘ(n² log n)
  2. BΘ(n³)
  3. CΘ(n2)
  4. DΘ(nlog₂ 7), about n2.81
3.Data structuresMedium

A binary tree has root 1 with left child 2 and right child 3; node 2 has children 4 (left) and 5 (right). What is the preorder traversal?

  1. A1 2 4 5 3
  2. B4 2 5 1 3
  3. C1 2 3 4 5
  4. D4 5 2 3 1
4.Data structuresHard

Which problem of linear probing does double hashing mainly reduce?

  1. APrimary clustering, where long runs of occupied slots form
  2. BThe need to store keys in the table
  3. CThe O(n) cost of reading a key's value
  4. DThe need for a hash function
5.Graph theoryMedium

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

3 × deg 44 × deg 2
L =
6.Graph theoryHard
5412483109ABCDEF

Use Dijkstra’s algorithm to find the length d(F) of the shortest path from A to F in the weighted graph.

start: Aend: F
d(F) =

3Solutions

1.Algorithms & complexity

Answer: C · Its subproblems do not overlap, so there is nothing to reuse

Why this is the answer

Merge sort's halves are disjoint and each is solved once; DP helps only when subproblems recur, as in Fibonacci.

Answer

C · Its subproblems do not overlap, so there is nothing to reuse
2.Algorithms & complexity

Answer: D · Θ(nlog₂ 7), about n2.81

Why this is the answer

With a = 7 and b = 2, nlog₂ 7 dominates the O(n²) addition work, giving about n2.81.

Answer

D · Θ(nlog₂ 7), about n2.81
3.Data structures

Answer: A · 1 2 4 5 3

Why this is the answer

Preorder visits 1, then its left subtree (2, 4, 5), then 3; the other options are inorder, postorder and level-order.

Answer

A · 1 2 4 5 3
4.Data structures

Answer: A · Primary clustering, where long runs of occupied slots form

Why this is the answer

Linear probing steps by 1, so occupied runs grow and merge; double hashing uses a second hash for the step size so different keys probe different sequences.

Answer

A · Primary clustering, where long runs of occupied slots form
5.Graph theory

Answer: L = 8

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 + 20 = 2(L + 7) − 2
L = 8

Answer

L = 8

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

6.Graph theory

Answer: d(F) = 19

Shortest paths and spanning trees: Dijkstra’s algorithm settles one vertex per round: the unsettled vertex with the smallest tentative distance. Its distance is then final, and every neighbour v gets d(v) = min(d(v), d(u) + w(u, v)). Kruskal’s algorithm builds a minimum spanning tree by taking the edges from light to heavy and skipping any edge that would close a cycle; Prim’s algorithm grows one tree from a start vertex by always adding the lightest edge that leaves it. A spanning tree of n vertices has n − 1 edges.

Dijkstra round by round

Each line: the vertex settled, its final distance, and the neighbours whose distance improves.

A (0): C: 5
C (5): B: 9, E: 9
B (9): D: 21
E (9): D: 17, F: 19
D (17)
F (19)

Shortest path

A → C → E → F
d(F) = 19

Answer

d(F) = 19

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