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

A function runs one loop of n iterations and then, separately, another loop of n iterations. What is its time complexity?

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

Which technique gives an expected O(n log n) running time for quicksort on any input?

  1. AUsing recursion only on the left side
  2. BSorting the input before running quicksort
  3. CChoosing the pivot uniformly at random
  4. DAlways choosing the first element
3.Data structuresMedium

How does extract-min work in a binary min-heap?

  1. ARemove the root and shift all elements one place left
  2. BMove the last element to the root and sift it down
  3. CRemove the last element of the array
  4. DSearch all leaves for the new minimum
4.Data structuresHard

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

  1. ABits in a Bloom filter cannot be changed after creation
  2. BBloom filters store the full elements, and these cannot be located again once hashed
  3. CDeleting would increase the false positive rate to 100%
  4. DThose bits may also belong to other elements, which would cause false negatives
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
678111110415ABCDEF

Use Dijkstra’s algorithm to find the length d(F) of the shortest path from A to F in the weighted graph.

start: Aend: F
d(F) =

3Solutions

1.Algorithms & complexity

Answer: D · O(n)

Why this is the answer

n + n = 2n, and constant factors are dropped, so the function is O(n).

Answer

D · O(n)
2.Algorithms & complexity

Answer: C · Choosing the pivot uniformly at random

Why this is the answer

With a random pivot, the expected running time is O(n log n) for every input; bad cases still exist but are very unlikely.

Answer

C · Choosing the pivot uniformly at random
3.Data structures

Answer: B · Move the last element to the root and sift it down

Why this is the answer

The last element fills the hole at the root and is swapped with its smaller child until the heap property holds, taking O(log n).

Answer

B · Move the last element to the root and sift it down
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: 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: d(F) = 21

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.

Dijkstra round by round

Each line: the vertex settled, its final distance, and the neighbours whose distance improves.

A (0): C: 6
C (6): B: 13, E: 17
B (13): D: 21
E (17): F: 21
D (21)
F (21)

Shortest path

A → C → E → F
d(F) = 21

Answer

d(F) = 21

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