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 is the time complexity of computing the n-th Fibonacci number with a bottom-up table?

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

Which statement about little-o notation is correct?

  1. An² = o(n)
  2. Bn = o(n²), but n is not o(n)
  3. C2n = o(n), because 2n grows slowly
  4. Dn = o(n), since every function is little-o of itself
3.Data structuresMedium

A road network has 100,000 junctions, each connected to about 4 others. Which representation is most suitable?

  1. AAdjacency matrix
  2. BAdjacency list
  3. CA single sorted array of vertices
  4. DA binary heap of edges
4.Data structuresHard

A Bloom filter can answer "is this element in the set?" with:

  1. APossible false positives but no false negatives
  2. BPossible false negatives but no false positives
  3. CAnswers only for numbers
  4. DExact answers always
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
1713816561ABCDE

Find the total weight W of a minimum spanning tree of the weighted graph.

|V| = 5|E| = 7
W =

3Solutions

1.Algorithms & complexity

Answer: A · O(n)

Why this is the answer

Filling the table from 0 to n takes one addition per entry, so the work is linear instead of exponential.

Answer

A · O(n)
2.Algorithms & complexity

Answer: B · n = o(n²), but n is not o(n)

Why this is the answer

f = o(g) means f(n) / g(n) tends to 0; n / n² tends to 0, but n / n = 1 does not.

Answer

B · n = o(n²), but n is not o(n)
3.Data structures

Answer: B · Adjacency list

Why this is the answer

A matrix would need 1010 cells, almost all empty; an adjacency list only stores the roughly 400,000 edge entries.

Answer

B · Adjacency list
4.Data structures

Answer: A · Possible false positives but no false negatives

Why this is the answer

If any bit for an item is 0, it is definitely absent; if all are 1 it is probably present. Bloom filters trade accuracy for very little memory.

Answer

A · Possible false positives but no false negatives
5.Graph theory

Answer: neither

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) = 3, deg(C) = 3, deg(D) = 1, deg(E) = 1

Odd vertices

B, C, D, E → 4
neither

Answer

neither
6.Graph theory

Answer: W = 25

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.

Kruskal’s algorithm

BE (1): take
CE (5): take
DE (6): take
BC (8): skip, closes a cycle
AC (13): take

Total weight

W = 1 + 5 + 6 + 13 = 25

Answer

W = 25

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