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

Quicksort always uses the first element as pivot. On which input does it show its worst-case behaviour?

  1. AAn array in random order
  2. BAn array that is already sorted
  3. CAn array whose elements are all different
  4. DAn array of length 2
2.Algorithms & complexityHard

Which algorithm finds a minimum spanning tree by repeatedly adding the cheapest edge that does not form a cycle?

  1. APrim's algorithm starting from one node
  2. BDijkstra's algorithm
  3. CFloyd–Warshall
  4. DKruskal's algorithm
3.Data structuresMedium

What happens when a hash table rehashes after its load factor exceeds a threshold?

  1. AOnly the colliding keys are moved to a new overflow list at the end of the table
  2. BThe existing keys are sorted in place
  3. CA larger table is allocated and every key is inserted again
  4. DThe oldest keys are deleted to make room
4.Data structuresHard

Under simple uniform hashing, what is the expected time of a search in a hash table with chaining, n keys and m buckets?

  1. AO(m)
  2. BO(log n)
  3. CO(n)
  4. DO(1 + α), where α = n / m
5.Graph theoryMedium

A tree has 4 vertices of degree 4, and all its other vertices are leaves (degree 1). How many leaves L does it have?

4 × deg 4
L =
6.Graph theoryHard
19121326148ABCDEF

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 · An array that is already sorted

Why this is the answer

On sorted input the pivot is always the minimum, so one side is empty and the other has n − 1 elements, giving O(n²).

Answer

B · An array that is already sorted
2.Algorithms & complexity

Answer: D · Kruskal's algorithm

Why this is the answer

Kruskal sorts edges by weight and adds them if they connect different components; Prim grows one tree from a start vertex.

Answer

D · Kruskal's algorithm
3.Data structures

Answer: C · A larger table is allocated and every key is inserted again

Why this is the answer

Since the index is computed modulo the table size, all keys must be rehashed into the new, larger table; with doubling this stays O(1) amortised.

Answer

C · A larger table is allocated and every key is inserted again
4.Data structures

Answer: D · O(1 + α), where α = n / m

Why this is the answer

Computing the hash costs O(1) and the expected chain length is α, so keeping α bounded by resizing gives O(1) expected time.

Answer

D · O(1 + α), where α = n / m
5.Graph theory

Answer: L = 10

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.

Handshake lemma for a tree

L + 16 = 2(L + 4) − 2
L = 10

Answer

L = 10

Shortcut: L = 2 + Σ (d − 2) over the vertices with degree d ≥ 3.

6.Graph theory

Answer: W = 24

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

BD (1): take
DE (2): take
CE (3): take
DF (6): take
BE (8): skip, closes a cycle
AC (12): take

Total weight

W = 1 + 2 + 3 + 6 + 12 = 24

Answer

W = 24

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