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. ANo subproblems at all, so it can be solved in one step
  2. BOverlapping subproblems and optimal substructure
  3. COnly random inputs
  4. DA single loop
2.Algorithms & complexityHard

Insertion sort runs in O(n) on sorted input. Does this contradict the Ω(n log n) lower bound for comparison sorting?

  1. AYes, the lower bound is therefore wrong
  2. BNo, the lower bound applies to the worst case over all inputs, not to every input
  3. CNo, because insertion sort is not a comparison sort
  4. DYes, but only for arrays shorter than 100
3.Data structuresMedium

In a binary min-heap stored in an array (index starting at 0), the children of the node at index i are at:

  1. Ai + 1 and i + 2
  2. Bi/2 and i/2 + 1
  3. C2i and 2i + 1
  4. D2i + 1 and 2i + 2
4.Data structuresHard

What is the running time of breadth-first search on a graph with V vertices stored as an adjacency matrix?

  1. AO(E log V)
  2. BO(V + E)
  3. CO(V)
  4. DO(V²)
5.Graph theoryMedium

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

K5
H =
6.Graph theoryHard
1310541361513ABCDEF

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

start: Aend: E
d(E) =

3Solutions

1.Algorithms & complexity

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

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

Answer: B · No, the lower bound applies to the worst case over all inputs, not to every input

Why this is the answer

The bound says every comparison sort needs about n log n comparisons on some input of size n; special inputs can be much faster.

Answer

B · No, the lower bound applies to the worst case over all inputs, not to every input
3.Data structures

Answer: D · 2i + 1 and 2i + 2

Why this is the answer

For 0-based arrays, the left child is at 2i + 1, the right child at 2i + 2, and the parent at ⌊(i − 1)/2⌋.

Answer

D · 2i + 1 and 2i + 2
4.Data structures

Answer: D · O(V²)

Why this is the answer

Each of the V vertices scans a row of V entries, giving O(V²); with adjacency lists BFS is O(V + E).

Answer

D · O(V²)
5.Graph theory

Answer: H = 12

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 = (5 − 1)!/2 = 24/2 = 12

Answer

H = 12
6.Graph theory

Answer: d(E) = 23

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: 10
C (10): E: 23
B (13): D: 17
D (17): F: 32
E (23)
F (32)

Shortest path

A → C → E
d(E) = 23

Answer

d(E) = 23

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