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 the standard dynamic programming algorithm for the longest common subsequence of strings of lengths m and n?

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

What is the amortised cost of incrementing a binary counter, given that one increment may flip many bits?

  1. AO(n log n) per increment
  2. BO(n) per increment
  3. CO(log n) per increment
  4. DO(1) per increment
3.Data structuresMedium

How do you find the minimum key in a binary search tree?

  1. AFollow left children from the root until there is no left child
  2. BFollow right children from the root until there is no right child
  3. CLook at the root only
  4. DVisit every leaf and compare them
4.Data structuresHard

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

  1. AAn adjacency matrix recording which vertices have already been removed
  2. BA max-heap ordered by out-degree
  3. CA queue (or any collection) of vertices whose in-degree is 0
  4. DA stack of all visited edges
5.Graph theoryMedium

How many different Hamilton circuits H does the complete graph K7 have? Circuits that differ only in the starting vertex or the direction count as the same.

K7
H =
6.Graph theoryHard
ABCDEF

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

M = adjacency matrixL = 2
N =

3Solutions

1.Algorithms & complexity

Answer: B · O(mn)

Why this is the answer

The table has (m + 1)(n + 1) cells and each is computed in O(1) from its neighbours.

Answer

B · O(mn)
2.Algorithms & complexity

Answer: D · O(1) per increment

Why this is the answer

Over n increments, bit i flips about n / 2ⁱ times, so the total is less than 2n flips, an average of O(1) each.

Answer

D · O(1) per increment
3.Data structures

Answer: A · Follow left children from the root until there is no left child

Why this is the answer

The leftmost node has no smaller key in the tree, so it is the minimum; the cost is proportional to the height.

Answer

A · Follow left children from the root until there is no left child
4.Data structures

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

C · A queue (or any collection) of vertices whose in-degree is 0
5.Graph theory

Answer: H = 360

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.

Count

H = (7 − 1)!/2 = 720/2 = 360

Answer

H = 360
6.Graph theory

Answer: N = 1

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 0
B: 1 0 1 0 1 0
C: 1 1 0 0 1 0
D: 0 0 0 0 1 1
E: 0 1 1 1 0 1
F: 0 0 0 1 1 0

Common neighbours

(M²)DB = 0·1 + 0·0 + 0·1 + 0·0 + 1·1 + 1·0 = 1

Answer

N = 1

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