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

A recurrence T(n) = 2T(n/2) + O(n) solves to:

  1. AO(n log n)
  2. BO(log n)
  3. CO(n)
  4. DO(n²)
2.Algorithms & complexityHard

What is the time complexity of building a binary heap from n unsorted elements with the bottom-up method?

  1. AO(n log n)
  2. BO(log n)
  3. CO(n²)
  4. DO(n)
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. A2i + 1 and 2i + 2
  2. B2i and 2i + 1
  3. Ci/2 and i/2 + 1
  4. Di + 1 and i + 2
4.Data structuresHard

How does a radix tree (compressed trie) improve on a plain trie?

  1. AIt stores each word in a hash table at the root instead of in separate nodes
  2. BIt keeps only the first letter of each word
  3. CIt sorts the children of each node by frequency
  4. DIt merges chains of single-child nodes into one edge labelled with a string
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| = 6
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
634154437131192ABCDEFG

Dijkstra’s algorithm runs from A. Click the vertex that is settled (made permanent) in round 6; A itself is round 1.

start: Around 6
  1. 1A
  2. 2B
  3. 3C
  4. 4D
  5. 5E
  6. 6F
  7. 7G

3Solutions

1.Algorithms & complexity

Answer: A · O(n log n)

Why this is the answer

By the master theorem (a = 2, b = 2, f(n) = n), T(n) = Θ(n log n).

Answer

A · O(n log n)
2.Algorithms & complexity

Answer: D · O(n)

Why this is the answer

Summing sift-down costs over the levels gives a convergent series, so heapify runs in linear time.

Answer

D · O(n)
3.Data structures

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

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

Answer: D · It merges chains of single-child nodes into one edge labelled with a string

Why this is the answer

Collapsing paths with no branching reduces the number of nodes and the memory used while keeping prefix search.

Answer

D · It merges chains of single-child nodes into one edge labelled with a string
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) = 4, deg(C) = 2, deg(D) = 2, deg(E) = 2

Odd vertices

0
Euler circuit

Answer

Euler circuit
6.Graph theory

Answer: D

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

1. A (0): B: 6, C: 3
2. C (3): E: 7, G: 14
3. B (6): D: 21
4. E (7): D: 11, F: 14, G: 9
5. G (9)
6. D (11)
7. F (14)

round 6

D

Answer

D

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