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(n²)
  4. DO(log n)
2.Algorithms & complexityHard

What does the recurrence T(n) = 2T(n/2) + n log n solve to?

  1. AΘ(n log n)
  2. BΘ(n²)
  3. CΘ(n)
  4. DΘ(n log² n)
3.Data structuresMedium

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

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

Why can elements not simply be deleted from a standard Bloom filter by clearing their bits?

  1. ABloom filters store the full elements, and these cannot be located again once hashed
  2. BDeleting would increase the false positive rate to 100%
  3. CBits in a Bloom filter cannot be changed after creation
  4. DThose bits may also belong to other elements, which would cause false negatives
5.Graph theoryMedium

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

K6
H =
6.Graph theoryHard
5713201611215106ABCDEFG

Prim’s algorithm builds a minimum spanning tree starting from vertex A. Click the edge it adds as edge number 2.

start: Ak = 2
  1. 1edge AB
  2. 2edge AC
  3. 3edge BC
  4. 4edge DE
  5. 5edge DF
  6. 6edge EF
  7. 7edge GB
  8. 8edge GC
  9. 9edge GD
  10. 10edge GE

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 · Θ(n log² n)

Why this is the answer

Level k does about n log(n / 2ᵏ) work, and summing over log n levels gives Θ(n log² n), the extended second case of the master theorem.

Answer

D · Θ(n log² n)
3.Data structures

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

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

Answer: D · Those bits may also belong to other elements, which would cause false negatives

Why this is the answer

Clearing a shared bit would make another element look absent; counting Bloom filters keep counters instead of bits to allow deletion.

Answer

D · Those bits may also belong to other elements, which would cause false negatives
5.Graph theory

Answer: H = 60

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 = (6 − 1)!/2 = 120/2 = 60

Answer

H = 60
6.Graph theory

Answer: edge GB

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.

Prim’s algorithm

1. AB (5)
2. GB (2)
3. GE (6)
4. AC (7)
5. GD (10)
6. EF (11)

edge number 2

GB

Answer

edge GB

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