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

A greedy algorithm:

  1. AAlways gives the optimal solution
  2. BTries every possible solution
  3. CUses only recursion
  4. DMakes the locally best choice at each step
2.Algorithms & complexityHard

Which algorithm finds a minimum spanning tree by repeatedly adding the cheapest edge that does not form a cycle?

  1. AKruskal's algorithm
  2. BFloyd–Warshall
  3. CDijkstra's algorithm
  4. DPrim's algorithm starting from one node
3.Data structuresMedium

Why is traversing an array often much faster in practice than traversing a linked list of the same length?

  1. AArray traversal is O(1) in total, while linked list traversal is O(n)
  2. BLinked lists always store elements on disk
  3. CArray elements are contiguous, so they make good use of the CPU cache
  4. DArrays use fewer instructions to compare values
4.Data structuresHard

In the BST with root 50, left subtree 30 (children 20, 40) and right subtree 70 (children 60, 80), the root is deleted using the in-order successor. Which key becomes the new root?

  1. A40
  2. B70
  3. C80
  4. D60
5.Graph theoryMedium

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

|V| = 12|E| = 21
k =
6.Graph theoryHard
ABCDE

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

M = adjacency matrixL = 2
N =

3Solutions

1.Algorithms & complexity

Answer: D · Makes the locally best choice at each step

Why this is the answer

Greedy algorithms are fast and optimal for some problems (e.g. Dijkstra, Huffman coding) but not in general (e.g. coin change with some coin systems).

Answer

D · Makes the locally best choice at each step
2.Algorithms & complexity

Answer: A · Kruskal's algorithm

Why this is the answer

Kruskal sorts edges by weight and adds them if they connect different components; Prim grows one tree from a start vertex.

Answer

A · Kruskal's algorithm
3.Data structures

Answer: C · Array elements are contiguous, so they make good use of the CPU cache

Why this is the answer

Contiguous memory gives good locality of reference, while linked nodes may be scattered and cause many cache misses.

Answer

C · Array elements are contiguous, so they make good use of the CPU cache
4.Data structures

Answer: D · 60

Why this is the answer

The leftmost node of the right subtree is 60, so 60 replaces 50 and its old position is removed; using the predecessor would give 40.

Answer

D · 60
5.Graph theory

Answer: k = 10

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

12 − 1 = 11

Edges to remove

k = 21 − 11 = 10

Answer

k = 10
6.Graph theory

Answer: N = 1

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 0 0 0
B: 1 0 1 1 1
C: 0 1 0 0 1
D: 0 1 0 0 1
E: 0 1 1 1 0

Common neighbours

(M²)DA = 0·0 + 1·1 + 0·0 + 0·0 + 1·0 = 1

Answer

N = 1

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