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 time complexity of: for i = 1 to n: for j = 1 to i: do O(1) work?

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

Which statement about selecting the k-th smallest element of an unsorted array is correct?

  1. ASelection is only possible in O(n²)
  2. BQuickselect runs in expected O(n), and median-of-medians guarantees O(n) worst case
  3. CQuickselect runs in O(log n) worst case, because it recurses on only one side of the pivot
  4. DSelection always needs Ω(n log n) because it requires sorting
3.Data structuresMedium

An adjacency matrix for a graph with V vertices uses how much memory?

  1. AO(V²)
  2. BO(E)
  3. CO(log V)
  4. DO(V + E)
4.Data structuresHard

Which pair of traversals always determines a unique binary tree with distinct keys?

  1. ALevel-order alone
  2. BPreorder alone
  3. CPreorder and inorder
  4. DPreorder and postorder
5.Graph theoryMedium

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

4 × deg 34 × deg 42 × deg 52 × deg 2
L =
6.Graph theoryHard
18971281013172011ABCDEFG

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

|V| = 7|E| = 10
W =

3Solutions

1.Algorithms & complexity

Answer: C · O(n²)

Why this is the answer

The inner body runs n(n + 1) / 2 times in total, which is still quadratic.

Answer

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

Answer: B · Quickselect runs in expected O(n), and median-of-medians guarantees O(n) worst case

Why this is the answer

Quickselect's expected work is n + n/2 + n/4 + ... = O(n) with random pivots; choosing the pivot as a median of medians makes the worst case linear.

Answer

B · Quickselect runs in expected O(n), and median-of-medians guarantees O(n) worst case
3.Data structures

Answer: A · O(V²)

Why this is the answer

An adjacency matrix stores V × V entries, efficient for dense graphs; adjacency lists use O(V + E), better for sparse graphs.

Answer

A · O(V²)
4.Data structures

Answer: C · Preorder and inorder

Why this is the answer

Preorder gives the root, and its position in the inorder sequence splits the left and right subtrees; preorder with postorder is ambiguous when a node has one child.

Answer

C · Preorder and inorder
5.Graph theory

Answer: L = 20

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 + 42 = 2(L + 12) − 2
L = 20

Answer

L = 20

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

6.Graph theory

Answer: W = 58

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

BC (7): take
CE (8): take
AC (9): take
DE (10): take
GE (11): take
BD (12): skip, closes a cycle
DF (13): take

Total weight

W = 7 + 8 + 9 + 10 + 11 + 13 = 58

Answer

W = 58

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