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 statement about a recursive function without a reachable base case is correct?

  1. AIt runs in O(1) time
  2. BThe compiler always turns it into a loop that ends safely
  3. CIt returns 0 automatically
  4. DIt keeps calling itself until the call stack overflows
2.Algorithms & complexityHard

To show that a new problem X is NP-hard, what must you do?

  1. AReduce a known NP-hard problem to X in polynomial time
  2. BReduce X to a known NP-hard problem in polynomial time
  3. CShow that X has no polynomial algorithm for small inputs
  4. DShow that X can be verified in polynomial time
3.Data structuresMedium

Which collision resolution method stores colliding keys in a list at the same bucket?

  1. AQuadratic probing
  2. BLinear probing
  3. CDouble hashing
  4. DSeparate chaining
4.Data structuresHard

Inserting a key into an AVL tree makes a node's left subtree too tall, and the new key went into the left subtree of its left child (left-left case). Which fix is applied?

  1. AA single left rotation at the unbalanced node
  2. BRecolouring the node and its child
  3. CA left rotation at the child, then a right rotation at the node
  4. DA single right rotation at the unbalanced node
5.Graph theoryMedium
ABCDEFEuler 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| = 6|E| = 7
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
134105211731431ABCDEFG

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 · It keeps calling itself until the call stack overflows

Why this is the answer

Without a base case the recursion never stops; in practice memory for stack frames runs out and the program crashes.

Answer

D · It keeps calling itself until the call stack overflows
2.Algorithms & complexity

Answer: A · Reduce a known NP-hard problem to X in polynomial time

Why this is the answer

If a known hard problem can be transformed into X efficiently, a fast algorithm for X would solve the known problem too.

Answer

A · Reduce a known NP-hard problem to X in polynomial time
3.Data structures

Answer: D · Separate chaining

Why this is the answer

Chaining keeps a linked list (or other structure) per bucket; open addressing looks for another free slot in the table itself.

Answer

D · Separate chaining
4.Data structures

Answer: D · A single right rotation at the unbalanced node

Why this is the answer

In the left-left case one right rotation lifts the left child up and restores balance; zig-zag cases need a double rotation.

Answer

D · A single right rotation at the unbalanced node
5.Graph theory

Answer: Euler 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) = 2, deg(B) = 2, deg(C) = 2, deg(D) = 2, deg(E) = 4, deg(F) = 2

Odd vertices

0
Euler circuit

Answer

Euler circuit
6.Graph theory

Answer: d(F) = 16

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: 4
C (4): E: 9, G: 18
E (9): D: 11, F: 16, G: 10
G (10)
D (11)
B (13)
F (16)

Shortest path

A → C → E → F
d(F) = 16

Answer

d(F) = 16

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