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 does amortised analysis measure?

  1. AThe average cost per operation over a worst-case sequence of operations
  2. BThe expected cost over random inputs
  3. CThe cost of an algorithm on the best input
  4. DThe cost of the single most expensive operation anywhere in the sequence
2.Algorithms & complexityHard

Which of these satisfiability problems is known to be solvable in polynomial time?

  1. A2-SAT, where each clause has at most two literals
  2. BCircuit satisfiability
  3. C3-SAT, where each clause has exactly three literals
  4. DGeneral SAT on formulas in conjunctive normal form
3.Data structuresMedium

AVL trees and red-black trees guarantee:

  1. AConstant-time search in every case
  2. BThat no node has two children
  3. CO(log n) height through rebalancing
  4. DThat keys are stored in insertion order
4.Data structuresHard

An AVL node is unbalanced because its left child's right subtree became too tall (left-right case). Which fix is applied?

  1. AA right rotation at the left child, then a left rotation at the node
  2. BA single left rotation at the node
  3. CA single right rotation at the node
  4. DA left rotation at the left child, then a right rotation at the node
5.Graph theoryMedium
ABCDEEuler circuitEuler path, no circuitneither

Does the connected graph have an Euler circuit, an Euler path that is not a circuit, or neither? Click your answer.

|V| = 5|E| = 5
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
12315515681712ABCDEFG

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: A · The average cost per operation over a worst-case sequence of operations

Why this is the answer

Amortised analysis spreads the cost of rare expensive operations over many cheap ones, giving a guaranteed average for any sequence.

Answer

A · The average cost per operation over a worst-case sequence of operations
2.Algorithms & complexity

Answer: A · 2-SAT, where each clause has at most two literals

Why this is the answer

2-SAT is in P (linear time via strongly connected components), while 3-SAT is NP-complete.

Answer

A · 2-SAT, where each clause has at most two literals
3.Data structures

Answer: C · O(log n) height through rebalancing

Why this is the answer

Self-balancing trees keep height logarithmic, so search, insert and delete are O(log n) in the worst case.

Answer

C · O(log n) height through rebalancing
4.Data structures

Answer: D · A left rotation at the left child, then a right rotation at the node

Why this is the answer

The first rotation converts the left-right case into a left-left case, which a right rotation at the unbalanced node then fixes.

Answer

D · A left rotation at the left child, then a right rotation at the node
5.Graph theory

Answer: Euler path, no circuit

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.

Degrees

deg(A) = 1, deg(B) = 4, deg(C) = 2, deg(D) = 1, deg(E) = 2

Odd vertices

A, D → 2
Euler path, no circuit

Answer

Euler path, no circuit

The Euler path starts at one odd vertex and ends at the other.

6.Graph theory

Answer: d(E) = 18

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: 12, C: 3
C (3): E: 18
B (12): D: 17, G: 19
D (17): F: 25
E (18): F: 19
F (19)
G (19)

Shortest path

A → C → E
d(E) = 18

Answer

d(E) = 18

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