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

Dynamic programming is useful when a problem has:

  1. AA single loop
  2. BOnly random inputs
  3. CNo subproblems at all, so it can be solved in one step
  4. DOverlapping subproblems and optimal substructure
2.Algorithms & complexityHard

The 0/1 knapsack problem solved with dynamic programming takes O(nW) time. Why is this called pseudo-polynomial?

  1. ABecause it only works for W = 0
  2. BW is a number, so the time is exponential in the number of bits used to write W
  3. CBecause n is always small
  4. DBecause the algorithm is randomised and its running time varies with each input
3.Data structuresMedium

A road network has 100,000 junctions, each connected to about 4 others. Which representation is most suitable?

  1. AAdjacency list
  2. BA single sorted array of vertices
  3. CAdjacency matrix
  4. DA binary heap of edges
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 stack that keeps elements waiting for their answer
  2. BA queue that holds every pair of elements
  3. CA binary search tree rebuilt for each element
  4. DA hash table of all elements
5.Graph theoryMedium

A tree has 4 vertices of degree 3, and all its other vertices are leaves (degree 1). How many leaves L does it have?

4 × deg 3
L =
6.Graph theoryHard
31611841912ABCDE

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

start: Bk = 4
  1. 1edge AB
  2. 2edge AC
  3. 3edge BC
  4. 4edge BD
  5. 5edge CE
  6. 6edge DE
  7. 7edge BE

3Solutions

1.Algorithms & complexity

Answer: D · Overlapping subproblems and optimal substructure

Why this is the answer

Storing results of overlapping subproblems (memoisation or tabulation) avoids repeated work, turning exponential algorithms into polynomial ones.

Answer

D · Overlapping subproblems and optimal substructure
2.Algorithms & complexity

Answer: B · W is a number, so the time is exponential in the number of bits used to write W

Why this is the answer

The running time is polynomial in the value of W but exponential in its length (log W bits); 0/1 knapsack is NP-complete.

Answer

B · W is a number, so the time is exponential in the number of bits used to write W
3.Data structures

Answer: A · Adjacency list

Why this is the answer

A matrix would need 1010 cells, almost all empty; an adjacency list only stores the roughly 400,000 edge entries.

Answer

A · Adjacency list
4.Data structures

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

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

Answer: L = 6

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.

Handshake lemma for a tree

L + 12 = 2(L + 4) − 2
L = 6

Answer

L = 6

Shortcut: L = 2 + Σ (d − 2) over the vertices with degree d ≥ 3.

6.Graph theory

Answer: edge CE

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. AB (3)
2. BD (8)
3. BC (11)
4. CE (4)

edge number 4

CE

Answer

edge CE

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