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 problems Back 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(K_n)| = n(n − 1)/2, |E(K_m,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 K_n: (n − 1)!/2
Dijkstra update: d(v) = min(d(v), d(u) + w(u, v))
Walks of length L: (Mᴸ)_ij

Method

Write down the degree of every vertex; the degrees add up to twice the number of edges.
For Euler questions, check that the graph is connected and count the vertices with odd degree.
For trees, use n − 1 edges and the handshake lemma.
For Dijkstra, keep a table of tentative distances and settle the smallest unsettled vertex each round.
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/2) + O(1) solve to?

AO(1)
BO(log n)
CO(n)
DO(n log n)

2.Algorithms & complexityHard

What is the time complexity of: for i = 1 to n: for (j = i; j ≤ n; j = j + i) do O(1) work?

AO(n)
BO(n log n)
CO(n²)
DO(n √n)

3.Data structuresMedium

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

ARemove the root and shift all elements one place left
BMove the last element to the root and sift it down
CRemove the last element of the array
DSearch all leaves for the new minimum

4.Data structuresHard

What are the time and extra space costs of reversing a singly linked list in place?

AO(n) time and O(n) extra space
BO(1) time and O(1) extra space
CO(n log n) time and O(1) extra space
DO(n) time and O(1) extra space

5.Graph theoryMedium

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

4 × deg 33 × deg 4

L =

6.Graph theoryHard

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

Why this is the answer

The problem halves at each step with constant work per step, so there are about log₂ n steps.

Answer

B · O(log n)

2.Algorithms & complexity

Answer: B · O(n log n)

Why this is the answer

The total is n / 1 + n / 2 + ... + n / n = n × H_n, and the harmonic number H_n is Θ(log n).

Answer

B · O(n log n)

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 · O(n) time and O(1) extra space

Why this is the answer

Keeping three pointers (previous, current, next) lets you reverse each link in one pass without allocating new nodes.

Answer

D · O(n) time and O(1) extra space

5.Graph theory

Answer: L = 12

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; K_n 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 + 24 = 2(L + 7) − 2

L = 12

Answer

L = 12

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

6.Graph theory

Answer: W = 57

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

DF (7): take

EF (9): take

BD (10): take

CE (13): take

BC (14): skip, closes a cycle

BE (17): skip, closes a cycle

AB (18): take

Total weight

W = 7 + 9 + 10 + 13 + 18 = 57

Answer

W = 57

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