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 the standard dynamic programming algorithm for the longest common subsequence of strings of lengths m and n?

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

Using the master theorem, T(n) = 8T(n/2) + O(n²) solves to:

  1. AΘ(n log n)
  2. BΘ(n³)
  3. CΘ(n² log n)
  4. DΘ(n²)
3.Data structuresMedium

In a circular queue stored in an array of capacity n, how is the next position after index i computed?

  1. A(i + 1) mod n
  2. Bi + 1
  3. C2i + 1
  4. D(i − 1) mod n
4.Data structuresHard

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

  1. AO(n) time and O(n) extra space
  2. BO(1) time and O(1) extra space
  3. CO(n) time and O(1) extra space
  4. DO(n log n) time and O(1) extra space
5.Graph theoryMedium
ABCDEEuler circuitEuler path, no circuitneither

Does the connected graph have an Euler circuit, an Euler path that is not a circuit, or neither? Click your answer.

|V| = 5|E| = 6
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
ABCDEF

How many walks of length 2 go from B to C? A walk may repeat vertices and edges. Call the number N.

M = adjacency matrixL = 2
N =

3Solutions

1.Algorithms & complexity

Answer: C · O(mn)

Why this is the answer

The table has (m + 1)(n + 1) cells and each is computed in O(1) from its neighbours.

Answer

C · O(mn)
2.Algorithms & complexity

Answer: B · Θ(n³)

Why this is the answer

log₂ 8 = 3, and n² grows slower than n³, so the leaves dominate: Θ(n³).

Answer

B · Θ(n³)
3.Data structures

Answer: A · (i + 1) mod n

Why this is the answer

The modulo operation wraps index n − 1 back to 0, so the array is reused without shifting elements.

Answer

A · (i + 1) mod n
4.Data structures

Answer: C · 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

C · O(n) time and O(1) extra space
5.Graph theory

Answer: Euler path, no circuit

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.

Degrees

deg(A) = 2, deg(B) = 3, deg(C) = 3, deg(D) = 2, deg(E) = 2

Odd vertices

B, C → 2
Euler path, no circuit

Answer

Euler path, no circuit

The Euler path starts at one odd vertex and ends at the other.

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 0
B: 1 0 1 1 1 0
C: 1 1 0 0 0 0
D: 0 1 0 0 1 0
E: 0 1 0 1 0 1
F: 0 0 0 0 1 0

Common neighbours

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

Answer

N = 1

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