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

Which algorithm finds the shortest paths from one source in a graph with non-negative edge weights?

  1. ADepth-first search
  2. BBellman–Ford is required in all cases
  3. CKruskal's algorithm
  4. DDijkstra's algorithm
2.Algorithms & complexityHard

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

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

What happens when a hash table rehashes after its load factor exceeds a threshold?

  1. AThe existing keys are sorted in place
  2. BA larger table is allocated and every key is inserted again
  3. CThe oldest keys are deleted to make room
  4. DOnly the colliding keys are moved to a new overflow list at the end of the table
4.Data structuresHard

Deleting a node with two children from a binary search tree is usually done by:

  1. ARemoving the whole subtree
  2. BSwapping it with the root
  3. CRebuilding the subtree below it from scratch and reinserting every key it contained
  4. DReplacing it with its in-order successor (or predecessor) and deleting that node
5.Graph theoryMedium

How many different Hamilton circuits H does the complete graph K6 have? Circuits that differ only in the starting vertex or the direction count as the same.

K6
H =
6.Graph theoryHard
59241927ABCDEF

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: D · Dijkstra's algorithm

Why this is the answer

Dijkstra's algorithm works with non-negative weights; Bellman–Ford handles negative weights; Kruskal builds minimum spanning trees.

Answer

D · Dijkstra's algorithm
2.Algorithms & complexity

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

C · Kruskal's algorithm
3.Data structures

Answer: B · A larger table is allocated and every key is inserted again

Why this is the answer

Since the index is computed modulo the table size, all keys must be rehashed into the new, larger table; with doubling this stays O(1) amortised.

Answer

B · A larger table is allocated and every key is inserted again
4.Data structures

Answer: D · Replacing it with its in-order successor (or predecessor) and deleting that node

Why this is the answer

The in-order successor has at most one child, so it can be removed easily after copying its key into the node being deleted.

Answer

D · Replacing it with its in-order successor (or predecessor) and deleting that node
5.Graph theory

Answer: H = 60

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.

Count

H = (6 − 1)!/2 = 120/2 = 60

Answer

H = 60
6.Graph theory

Answer: d(F) = 10

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: 9
B (5): C: 7, D: 9, E: 12
C (7): E: 8
E (8): F: 10
D (9)
F (10)

Shortest path

A → B → C → E → F
d(F) = 10

Answer

d(F) = 10

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