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. BDijkstra's algorithm
  3. CBellman–Ford is required in all cases
  4. DKruskal's algorithm
2.Algorithms & complexityHard

Which statement about little-o notation is correct?

  1. An = o(n²), but n is not o(n)
  2. Bn = o(n), since every function is little-o of itself
  3. Cn² = o(n)
  4. D2n = o(n), because 2n grows slowly
3.Data structuresMedium

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

  1. AAdjacency matrix
  2. BA single sorted array of vertices
  3. CA binary heap of edges
  4. DAdjacency list
4.Data structuresHard

In Kruskal's minimum spanning tree algorithm, what is the union-find structure used for?

  1. AChecking whether an edge's two endpoints are already connected
  2. BSorting the edges by weight
  3. CStoring each vertex's current distance from the source during the search
  4. DChoosing the starting vertex
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
13241325596ABCDEF

Use Dijkstra’s algorithm to find the length d(D) of the shortest path from A to D in the weighted graph.

start: Aend: D
d(D) =

3Solutions

1.Algorithms & complexity

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

B · Dijkstra's algorithm
2.Algorithms & complexity

Answer: A · n = o(n²), but n is not o(n)

Why this is the answer

f = o(g) means f(n) / g(n) tends to 0; n / n² tends to 0, but n / n = 1 does not.

Answer

A · n = o(n²), but n is not o(n)
3.Data structures

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

D · Adjacency list
4.Data structures

Answer: A · Checking whether an edge's two endpoints are already connected

Why this is the answer

Find tells whether both endpoints are in the same component; if not, the edge is added and union merges the components.

Answer

A · Checking whether an edge's two endpoints are already connected
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(D) = 9

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: 13, C: 2
C (2): B: 6, E: 4
E (4): D: 9, F: 13
B (6)
D (9)
F (13)

Shortest path

A → C → E → D
d(D) = 9

Answer

d(D) = 9

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