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 time complexity of: for i = 1 to n: (j = 1; while j < n: j = j × 2)?

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

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

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

How do you find the minimum key in a binary search tree?

  1. AFollow right children from the root until there is no right child
  2. BFollow left children from the root until there is no left child
  3. CVisit every leaf and compare them
  4. DLook at the root only
4.Data structuresHard

An object is stored as a key in a hash map, and then a field used by its hash function is changed. What is the likely result?

  1. ANothing changes, because a key's hash is computed only once when the program starts
  2. BThe map throws an error at the moment the field changes
  3. CLooking up the object may fail because it sits in the bucket for its old hash
  4. DThe map automatically moves the key to its new bucket
5.Graph theoryMedium

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

|V| = 16|E| = 18
k =
6.Graph theoryHard
841210151113136ABCDEFG

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: A · O(n log n)

Why this is the answer

The inner loop runs about log₂ n times for each of the n outer iterations, giving O(n log n).

Answer

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

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

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

Answer: B · Follow left children from the root until there is no left child

Why this is the answer

The leftmost node has no smaller key in the tree, so it is the minimum; the cost is proportional to the height.

Answer

B · Follow left children from the root until there is no left child
4.Data structures

Answer: C · Looking up the object may fail because it sits in the bucket for its old hash

Why this is the answer

The key's location was chosen from its old hash; with a new hash, lookups search the wrong bucket, so keys should be immutable.

Answer

C · Looking up the object may fail because it sits in the bucket for its old hash
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

16 − 1 = 15

Edges to remove

k = 18 − 15 = 3

Answer

k = 3
6.Graph theory

Answer: d(F) = 34

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: 8, C: 4
C (4): G: 17
B (8)
G (17): D: 30, E: 23
E (23): F: 34
D (30)
F (34)

Shortest path

A → C → G → E → F
d(F) = 34

Answer

d(F) = 34

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