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 n³ is smaller than n² for large n
  2. BYes, because Big O is an upper bound and n² grows no faster than n³
  3. CYes, but only if n is smaller than 100
  4. DNo, because Big O must always state the exact growth rate of the function
2.Algorithms & complexityHard

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

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

A node in a binary search tree has a right subtree. Where is its in-order successor?

  1. AThe leftmost node of its right subtree
  2. BIts right child, always
  3. CThe rightmost node of its left subtree
  4. DIts parent, always
4.Data structuresHard

In Kruskal's minimum spanning tree algorithm, what is the union-find structure used for?

  1. AStoring each vertex's current distance from the source during the search
  2. BSorting the edges by weight
  3. CChoosing the starting vertex
  4. DChecking whether an edge's two endpoints are already connected
5.Graph theoryMedium

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

|V| = 14|E| = 18
k =
6.Graph theoryHard
111510151110214ABCDEF

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

start: Aend: D
d(D) =

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: 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 · The leftmost node of its right subtree

Why this is the answer

All larger keys close to the node are in its right subtree, and the smallest of those is the leftmost node there.

Answer

A · The leftmost node of its right subtree
4.Data structures

Answer: D · Checking whether an edge's two endpoints are already connected

Why this is the answer

Find tells whether both endpoints are in the same component; if not, the edge is added and union merges the components.

Answer

D · Checking whether an edge's two endpoints are already connected
5.Graph theory

Answer: k = 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.

Edges of a spanning tree

14 − 1 = 13

Edges to remove

k = 18 − 13 = 5

Answer

k = 5
6.Graph theory

Answer: d(D) = 36

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): B: 11, C: 15
B (11): E: 25
C (15)
E (25): D: 36, F: 27
F (27)
D (36)

Shortest path

A → B → E → D
d(D) = 36

Answer

d(D) = 36

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