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 the recurrence T(n) = T(n/2) + O(1) solve to?

  1. AO(n log n)
  2. BO(log n)
  3. CO(n)
  4. DO(1)
2.Algorithms & complexityHard

What are the time and space costs of computing the n-th Fibonacci number with a loop that keeps only the last two values?

  1. AO(n) time and O(n) space
  2. BO(2ⁿ) time and O(1) space
  3. CO(log n) time and O(n) space
  4. DO(n) time and O(1) space
3.Data structuresMedium

A circular buffer (ring buffer) is commonly used to implement:

  1. AA binary search tree
  2. BA hash function
  3. CA fixed-size queue
  4. DA graph traversal
4.Data structuresHard

Why are B-trees used in databases and file systems?

  1. AThey use less memory than any array, so the entire index always fits in main memory
  2. BThey need no rebalancing
  3. CThey store data unsorted
  4. DTheir high branching factor keeps the tree shallow, reducing slow disk reads
5.Graph theoryMedium
ABCDEEuler 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| = 5|E| = 6
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
1516101363759ABCDEFG

Find the total weight W of a minimum spanning tree of the weighted graph.

|V| = 7|E| = 9
W =

3Solutions

1.Algorithms & complexity

Answer: B · O(log n)

Why this is the answer

The problem halves at each step with constant work per step, so there are about log₂ n steps.

Answer

B · O(log n)
2.Algorithms & complexity

Answer: D · O(n) time and O(1) space

Why this is the answer

Each step needs only the two previous values, so the table of the bottom-up method can be replaced by two variables.

Answer

D · O(n) time and O(1) space
3.Data structures

Answer: C · A fixed-size queue

Why this is the answer

A ring buffer uses head and tail indices that wrap around, giving O(1) enqueue and dequeue in fixed memory.

Answer

C · A fixed-size queue
4.Data structures

Answer: D · Their high branching factor keeps the tree shallow, reducing slow disk reads

Why this is the answer

B-trees store many keys per node, so height is small and few block reads are needed per lookup; B+ trees also link leaves for range scans.

Answer

D · Their high branching factor keeps the tree shallow, reducing slow disk reads
5.Graph theory

Answer: Euler path, no circuit

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) = 2, deg(E) = 2

Odd vertices

B, C → 2
Euler path, no circuit

Answer

Euler path, no circuit

The Euler path starts at one odd vertex and ends at the other.

6.Graph theory

Answer: W = 45

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.

Kruskal’s algorithm

EF (3): take
GC (5): take
DF (6): take
GB (7): take
GD (9): take
BD (10): skip, closes a cycle
DE (13): skip, closes a cycle
AB (15): take

Total weight

W = 3 + 5 + 6 + 7 + 9 + 15 = 45

Answer

W = 45

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