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(1)
  2. BO(n²)
  3. CO(n)
  4. DO(log n)
2.Algorithms & complexityHard

How does the Bellman–Ford algorithm detect a negative-weight cycle reachable from the source?

  1. AIt checks whether any edge has a negative weight
  2. BAfter V − 1 rounds, it checks whether any edge can still be relaxed
  3. CIt runs Dijkstra's algorithm twice and compares the two distance results
  4. DIt counts the cycles with depth-first search
3.Data structuresMedium

What balance condition does an AVL tree maintain at every node?

  1. ABoth subtrees of every node contain exactly the same number of nodes
  2. BThe heights of the left and right subtrees differ by at most 1
  3. CEvery node is coloured red or black
  4. DAll leaves are at exactly the same depth
4.Data structuresHard

For each element of an array you want the next greater element to its right, in O(n) total time. Which structure helps?

  1. AA queue that holds every pair of elements
  2. BA stack that keeps elements waiting for their answer
  3. CA binary search tree rebuilt for each element
  4. DA hash table of all elements
5.Graph theoryMedium

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

|V| = 6|E| = 8
k =
6.Graph theoryHard
16418151713136ABCDEF

Prim’s algorithm builds a minimum spanning tree starting from vertex E. Click the edge it adds as edge number 3.

start: Ek = 3
  1. 1edge AB
  2. 2edge AC
  3. 3edge BC
  4. 4edge BD
  5. 5edge CE
  6. 6edge DE
  7. 7edge DF
  8. 8edge EF
  9. 9edge BE

3Solutions

1.Algorithms & complexity

Answer: A · 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

A · O(1)
2.Algorithms & complexity

Answer: B · After V − 1 rounds, it checks whether any edge can still be relaxed

Why this is the answer

All true shortest distances are found within V − 1 rounds; if an edge can still be improved, a negative cycle must exist.

Answer

B · After V − 1 rounds, it checks whether any edge can still be relaxed
3.Data structures

Answer: B · The heights of the left and right subtrees differ by at most 1

Why this is the answer

The balance factor (height left − height right) must be −1, 0 or 1; rotations restore it after inserts and deletes.

Answer

B · The heights of the left and right subtrees differ by at most 1
4.Data structures

Answer: B · A stack that keeps elements waiting for their answer

Why this is the answer

Scanning left to right, pop every stacked element smaller than the current one (the current element is their answer), then push it; each element moves at most twice.

Answer

B · A stack that keeps elements waiting for their answer
5.Graph theory

Answer: k = 3

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

6 − 1 = 5

Edges to remove

k = 8 − 5 = 3

Answer

k = 3
6.Graph theory

Answer: edge BE

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.

Prim’s algorithm

1. DE (1)
2. DF (3)
3. BE (6)
4. AB (16)
5. AC (4)

edge number 3

BE

Answer

edge BE

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