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 returns 0 automatically
  2. BIt runs in O(1) time
  3. CIt keeps calling itself until the call stack overflows
  4. DThe compiler always turns it into a loop that ends safely
2.Algorithms & complexityHard

What did the Cook–Levin theorem establish?

  1. AEvery NP problem can be solved in exponential time
  2. BP is not equal to NP
  3. CThe Boolean satisfiability problem (SAT) is NP-complete
  4. DThe halting problem is undecidable
3.Data structuresMedium

In a hash table using open addressing, what is the maximum possible load factor?

  1. A1
  2. B2
  3. CThere is no maximum
  4. D0.5
4.Data structuresHard

Which pair of traversals always determines a unique binary tree with distinct keys?

  1. APreorder alone
  2. BLevel-order alone
  3. CPreorder and postorder
  4. DPreorder and inorder
5.Graph theoryMedium

A tree has 2 vertices of degree 3, 3 vertices of degree 4, 3 vertices of degree 5, 3 vertices of degree 2, and all its other vertices are leaves (degree 1). How many leaves L does it have?

2 × deg 33 × deg 43 × deg 53 × deg 2
L =
6.Graph theoryHard
141010483108ABCDEF

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

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

Answer: C · The Boolean satisfiability problem (SAT) is NP-complete

Why this is the answer

Cook and Levin showed independently that every problem in NP reduces to SAT in polynomial time, so SAT was the first known NP-complete problem.

Answer

C · The Boolean satisfiability problem (SAT) is NP-complete
3.Data structures

Answer: A · 1

Why this is the answer

With open addressing all keys are stored in the table itself, so n cannot exceed m; separate chaining can have a load factor above 1.

Answer

A · 1
4.Data structures

Answer: D · Preorder and inorder

Why this is the answer

Preorder gives the root, and its position in the inorder sequence splits the left and right subtrees; preorder with postorder is ambiguous when a node has one child.

Answer

D · Preorder and inorder
5.Graph theory

Answer: L = 19

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.

Handshake lemma for a tree

L + 39 = 2(L + 11) − 2
L = 19

Answer

L = 19

Shortcut: L = 2 + Σ (d − 2) over the vertices with degree d ≥ 3.

6.Graph theory

Answer: d(F) = 24

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: 14, C: 10
C (10): E: 14
B (14): D: 24
E (14): D: 22, F: 24
D (22)
F (24)

Shortest path

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

Answer

d(F) = 24

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