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

Why do many library sorting routines switch to insertion sort for very small subarrays?

  1. AInsertion sort uses less memory than any other sorting algorithm on large inputs
  2. BInsertion sort has little overhead and is fast on small or nearly sorted inputs
  3. CInsertion sort is O(n log n) in the worst case
  4. DRecursive algorithms cannot handle arrays below 10 elements
2.Algorithms & complexityHard

Strassen's algorithm multiplies matrices using 7 instead of 8 recursive multiplications of half-size blocks. What is its running time?

  1. AΘ(n2)
  2. BΘ(n² log n)
  3. CΘ(nlog₂ 7), about n2.81
  4. DΘ(n³)
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. BRemove the last element of the array
  3. CMove the last element to the root and sift it down
  4. DSearch all leaves for the new minimum
4.Data structuresHard

Which property keeps every B-tree perfectly balanced?

  1. AThe keys are stored only in the root
  2. BAll leaves are at the same depth
  3. CEvery node has exactly two children
  4. DEach node stores one key
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
121656314192ABCDEF

Find the total weight W of a minimum spanning tree of the weighted graph.

|V| = 6|E| = 8
W =

3Solutions

1.Algorithms & complexity

Answer: B · Insertion sort has little overhead and is fast on small or nearly sorted inputs

Why this is the answer

For small n the simple loop of insertion sort beats the recursion overhead of quicksort or merge sort, even though it is O(n²).

Answer

B · Insertion sort has little overhead and is fast on small or nearly sorted inputs
2.Algorithms & complexity

Answer: C · Θ(nlog₂ 7), about n2.81

Why this is the answer

With a = 7 and b = 2, nlog₂ 7 dominates the O(n²) addition work, giving about n2.81.

Answer

C · Θ(nlog₂ 7), about n2.81
3.Data structures

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

C · Move the last element to the root and sift it down
4.Data structures

Answer: B · All leaves are at the same depth

Why this is the answer

Nodes split upwards when full and the tree only gets taller when the root splits, so all leaves always stay on the same level.

Answer

B · All leaves are at the same depth
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: W = 37

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.

Kruskal’s algorithm

BE (2): take
DE (3): take
BD (5): skip, closes a cycle
CE (6): take
AB (12): take
DF (14): take

Total weight

W = 2 + 3 + 6 + 12 + 14 = 37

Answer

W = 37

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