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 the recurrence T(n) = T(n/2) + O(1) solve to?

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

Which definition of the class P is correct?

  1. ADecision problems solvable by a deterministic algorithm in polynomial time
  2. BProblems that can be solved in parallel
  3. CProblems whose solutions can be checked but never found in polynomial time
  4. DProblems that need exponential time on every computer
3.Data structuresMedium

A trie (prefix tree) is especially efficient for:

  1. AFinding shortest paths
  2. BPrefix searches such as autocomplete
  3. CStoring matrices
  4. DSorting numbers
4.Data structuresHard

How long does it take to search for an arbitrary key in a binary min-heap of n elements?

  1. AO(1)
  2. BO(n)
  3. CO(log n)
  4. DO(log log n)
5.Graph theoryMedium
ABCDEFGEuler 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| = 7|E| = 10
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
16911820191017ABCDEF

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

|V| = 6|E| = 8
W =

3Solutions

1.Algorithms & complexity

Answer: D · O(log n)

Why this is the answer

The problem halves at each step with constant work per step, so there are about log₂ n steps.

Answer

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

Answer: A · Decision problems solvable by a deterministic algorithm in polynomial time

Why this is the answer

P contains decision problems with a deterministic polynomial-time algorithm, such as checking whether a graph is connected.

Answer

A · Decision problems solvable by a deterministic algorithm in polynomial time
3.Data structures

Answer: B · Prefix searches such as autocomplete

Why this is the answer

Tries store strings by characters along paths, so lookups and prefix queries take time proportional to the key length.

Answer

B · Prefix searches such as autocomplete
4.Data structures

Answer: B · O(n)

Why this is the answer

A heap gives no rule for which subtree contains a key, so in the worst case all nodes must be checked; only the minimum is fast to find.

Answer

B · O(n)
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) = 4, deg(D) = 3, deg(E) = 3, deg(F) = 2, deg(G) = 3

Odd vertices

B, D, E, G → 4
neither

Answer

neither
6.Graph theory

Answer: W = 55

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

BC (1): take
AC (9): take
EF (10): take
AB (16): skip, closes a cycle
BE (17): take
BD (18): take

Total weight

W = 1 + 9 + 10 + 17 + 18 = 55

Answer

W = 55

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