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 − 1) + O(1) solve to?

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

What are the time and space costs of computing the n-th Fibonacci number with a loop that keeps only the last two values?

  1. AO(n) time and O(n) space
  2. BO(2ⁿ) time and O(1) space
  3. CO(log n) time and O(n) space
  4. DO(n) time and O(1) space
3.Data structuresMedium

A trie (prefix tree) is especially efficient for:

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

Kahn's algorithm for topological sorting repeatedly removes vertices with in-degree 0. Which structure holds those vertices?

  1. AA queue (or any collection) of vertices whose in-degree is 0
  2. BA max-heap ordered by out-degree
  3. CA stack of all visited edges
  4. DAn adjacency matrix recording which vertices have already been removed
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
ABCDEF

How many closed walks of length 3 start and end at C? A walk may repeat vertices and edges. Call the number N.

M = adjacency matrixL = 3
N =

3Solutions

1.Algorithms & complexity

Answer: A · O(n)

Why this is the answer

There are n levels with constant work each, as in a recursive sum of an array.

Answer

A · O(n)
2.Algorithms & complexity

Answer: D · O(n) time and O(1) space

Why this is the answer

Each step needs only the two previous values, so the table of the bottom-up method can be replaced by two variables.

Answer

D · O(n) time and O(1) space
3.Data structures

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

C · Prefix searches such as autocomplete
4.Data structures

Answer: A · A queue (or any collection) of vertices whose in-degree is 0

Why this is the answer

Ready vertices are kept in a queue; removing one lowers its neighbours' in-degrees, and any that reach 0 are added, giving O(V + E) time.

Answer

A · A queue (or any collection) of vertices whose in-degree is 0
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: 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 0 0 0 0
B: 1 0 1 1 1 0
C: 0 1 0 0 1 0
D: 0 1 0 0 0 1
E: 0 1 1 0 0 1
F: 0 0 0 1 1 0

One more step

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

Answer

N = 2

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