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

The time complexity of naive recursive Fibonacci (fib(n) = fib(n−1) + fib(n−2)) is:

  1. ALinear
  2. BExponential
  3. CConstant
  4. DLogarithmic
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Θ(nlog₂ 7), about n2.81
  2. BΘ(n² log n)
  3. CΘ(n³)
  4. DΘ(n2)
3.Data structuresMedium

What is the purpose of a sentinel (dummy) node in a linked list?

  1. ATo make the list sorted
  2. BTo store the number of elements
  3. CTo prevent the list from growing beyond a fixed maximum number of nodes
  4. DTo simplify code by removing special cases at the head or tail
4.Data structuresHard

What does a splay tree do after each access?

  1. ARebuilds the whole tree in balanced form
  2. BMoves the accessed node to a leaf
  3. CRotates the accessed node up to the root
  4. DRecolours the nodes on the search path
5.Graph theoryMedium

How many different Hamilton circuits H does the complete graph K6 have? Circuits that differ only in the starting vertex or the direction count as the same.

K6
H =
6.Graph theoryHard
82379141515111ABCDEFG

Use Dijkstra’s algorithm to find the length d(F) of the shortest path from A to F in the weighted graph.

start: Aend: F
d(F) =

3Solutions

1.Algorithms & complexity

Answer: B · Exponential

Why this is the answer

The call tree grows roughly like φⁿ (about 1.618ⁿ). Memoisation reduces it to O(n).

Answer

B · Exponential
2.Algorithms & complexity

Answer: A · Θ(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

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

Answer: D · To simplify code by removing special cases at the head or tail

Why this is the answer

With a sentinel, every real node has a predecessor, so inserting or deleting at the head needs no special handling.

Answer

D · To simplify code by removing special cases at the head or tail
4.Data structures

Answer: C · Rotates the accessed node up to the root

Why this is the answer

Splaying moves the accessed node to the root through rotations; a single operation can cost O(n), but the amortised cost is O(log n).

Answer

C · Rotates the accessed node up to the root
5.Graph theory

Answer: H = 60

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 = (6 − 1)!/2 = 120/2 = 60

Answer

H = 60
6.Graph theory

Answer: d(F) = 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.

Dijkstra round by round

Each line: the vertex settled, its final distance, and the neighbours whose distance improves.

A (0): B: 8, C: 2
C (2): E: 9, G: 3
G (3): D: 14
B (8): D: 11
E (9): F: 24
D (11)
F (24)

Shortest path

A → C → E → F
d(F) = 24

Answer

d(F) = 24

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