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 is the amortised time complexity of appending to a dynamic array that doubles its capacity when full?

  1. AO(n²)
  2. BO(1)
  3. CO(log n)
  4. DO(n)
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. BDijkstra's algorithm
  3. CPrim's algorithm starting from one node
  4. DFloyd–Warshall
3.Data structuresMedium

What is the value of the postfix expression 3 4 + 2 * ?

  1. A10
  2. B14
  3. C24
  4. D11
4.Data structuresHard

How does a radix tree (compressed trie) improve on a plain trie?

  1. AIt keeps only the first letter of each word
  2. BIt stores each word in a hash table at the root instead of in separate nodes
  3. CIt sorts the children of each node by frequency
  4. DIt merges chains of single-child nodes into one edge labelled with a string
5.Graph theoryMedium

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

|V| = 13|E| = 20
k =
6.Graph theoryHard
571562328ABCDEF

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: B · O(1)

Why this is the answer

Copying all elements happens only at powers of two; spread over all appends, the average cost per append is constant.

Answer

B · O(1)
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: B · 14

Why this is the answer

Push 3 and 4, + gives 7; push 2, * gives 7 × 2 = 14.

Answer

B · 14
4.Data structures

Answer: D · It merges chains of single-child nodes into one edge labelled with a string

Why this is the answer

Collapsing paths with no branching reduces the number of nodes and the memory used while keeping prefix search.

Answer

D · It merges chains of single-child nodes into one edge labelled with a string
5.Graph theory

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

Edges of a spanning tree

13 − 1 = 12

Edges to remove

k = 20 − 12 = 8

Answer

k = 8
6.Graph theory

Answer: d(F) = 13

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: 5, C: 7
B (5): D: 11, E: 13
C (7): E: 9
E (9)
D (11): F: 13
F (13)

Shortest path

A → B → D → F
d(F) = 13

Answer

d(F) = 13

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