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 worst-case time complexity of quicksort?

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

Why can Dijkstra's algorithm give wrong results when some edge weights are negative?

  1. AIt only works on undirected graphs
  2. BIt goes into an infinite loop on every negative edge
  3. CNegative numbers cannot be stored in a priority queue
  4. DA vertex is finalised when extracted, but a later negative edge could still give it a shorter path
3.Data structuresMedium

You have a reference to a node in the middle of a list. In which list can you remove it in O(1)?

  1. AA dynamic array
  2. BA sorted array
  3. CA singly linked list
  4. DA doubly linked list
4.Data structuresHard

The union-find (disjoint set) structure with union by rank and path compression has an amortised cost per operation of:

  1. AO(n)
  2. BO(α(n)), the inverse Ackermann function, which is practically constant
  3. CO(n²)
  4. DO(log n) exactly
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
ABCDE

How many closed walks of length 2 start and end at D? A walk may repeat vertices and edges. Call the number N.

M = adjacency matrixL = 2
N =

3Solutions

1.Algorithms & complexity

Answer: C · O(n²)

Why this is the answer

With consistently bad pivots (e.g. already sorted input and first-element pivot) partitions are unbalanced, giving O(n²). The average case is O(n log n).

Answer

C · O(n²)
2.Algorithms & complexity

Answer: D · A vertex is finalised when extracted, but a later negative edge could still give it a shorter path

Why this is the answer

The greedy step relies on non-negative weights so that extracted distances are final; Bellman–Ford is used when weights may be negative.

Answer

D · A vertex is finalised when extracted, but a later negative edge could still give it a shorter path
3.Data structures

Answer: D · A doubly linked list

Why this is the answer

A doubly linked node knows its predecessor, so you can relink prev and next directly; a singly linked list must search for the predecessor.

Answer

D · A doubly linked list
4.Data structures

Answer: B · O(α(n)), the inverse Ackermann function, which is practically constant

Why this is the answer

With both optimisations, operations take O(α(n)) amortised time; α(n) ≤ 4 for any realistic n.

Answer

B · O(α(n)), the inverse Ackermann function, which is practically constant
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
B: 1 0 1 1 1
C: 1 1 0 0 1
D: 0 1 0 0 0
E: 0 1 1 0 0

Common neighbours

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

Answer

N = 1

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