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

In the activity selection problem, which greedy rule always gives a maximum number of non-overlapping activities?

  1. APick the activity that starts earliest
  2. BPick the activity that finishes earliest, then repeat with the compatible ones
  3. CPick the activity with the fewest overlaps first, then repeat with the compatible ones
  4. DPick the shortest activity first
2.Algorithms & complexityHard

Is 22n in O(2ⁿ)?

  1. AYes, because both are exponential
  2. BNo, because 22n = 4ⁿ and 4ⁿ / 2ⁿ = 2ⁿ grows without bound
  3. CNo, because 22n grows more slowly than 2ⁿ
  4. DYes, because constant factors in the exponent are always ignored in Big O
3.Data structuresMedium

How long does a search for a word of length L take in a trie with a fixed alphabet?

  1. AO(log n), where n is the number of words
  2. BO(n), where n is the number of words
  3. CO(L × n)
  4. DO(L), independent of how many words are stored
4.Data structuresHard

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

  1. AO(n)
  2. BO(log log n)
  3. CO(log n)
  4. DO(1)
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| = 8
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
ABCDE

How many walks of length 3 go from A to E? A walk may repeat vertices and edges. Call the number N.

M = adjacency matrixL = 3
N =

3Solutions

1.Algorithms & complexity

Answer: B · Pick the activity that finishes earliest, then repeat with the compatible ones

Why this is the answer

Choosing the earliest finishing time can be proven optimal by an exchange argument; the other rules have counterexamples.

Answer

B · Pick the activity that finishes earliest, then repeat with the compatible ones
2.Algorithms & complexity

Answer: B · No, because 22n = 4ⁿ and 4ⁿ / 2ⁿ = 2ⁿ grows without bound

Why this is the answer

A constant added to the exponent gives a constant factor, but a constant multiplying the exponent changes the base and the growth rate.

Answer

B · No, because 22n = 4ⁿ and 4ⁿ / 2ⁿ = 2ⁿ grows without bound
3.Data structures

Answer: D · O(L), independent of how many words are stored

Why this is the answer

Each character selects one child, so a lookup takes L steps no matter how many words the trie contains.

Answer

D · O(L), independent of how many words are stored
4.Data structures

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

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

Odd vertices

C, D, E, F → 4
neither

Answer

neither
6.Graph theory

Answer: N = 2

Degrees: the degree of a vertex is the number of edges that meet it. Every edge has two ends, so the degrees add up to twice the number of edges: Σ deg(v) = 2|E| (the handshake lemma). The number of vertices with odd degree is therefore even. Kn has n(n − 1)/2 edges, a k-regular graph on n vertices has nk/2, and a tree on n vertices has n − 1 edges.

Adjacency matrix

A: 0 1 1 0 0
B: 1 0 1 1 0
C: 1 1 0 0 1
D: 0 1 0 0 1
E: 0 0 1 1 0

One more step

(M³)AE = 2·0 + 1·0 + 1·1 + 1·1 + 1·0 = 2

Answer

N = 2

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