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 computing the n-th Fibonacci number with a bottom-up table?

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

Which statement about P and NP is correct?

  1. ANP means "not polynomial"
  2. BIt has been proven that P ≠ NP
  3. CNP problems cannot be verified quickly
  4. DEvery problem in P is also in NP
3.Data structuresMedium

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

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

How long does it take to search for an arbitrary key in a binary min-heap of n elements?

  1. AO(log n)
  2. BO(1)
  3. CO(log log n)
  4. DO(n)
5.Graph theoryMedium

A connected graph has 9 vertices and 19 edges. How many edges k must be removed to leave a spanning tree?

|V| = 9|E| = 19
k =
6.Graph theoryHard
ABCDE

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

M = adjacency matrixL = 2
N =

3Solutions

1.Algorithms & complexity

Answer: A · O(n)

Why this is the answer

Filling the table from 0 to n takes one addition per entry, so the work is linear instead of exponential.

Answer

A · O(n)
2.Algorithms & complexity

Answer: D · Every problem in P is also in NP

Why this is the answer

P ⊆ NP: if you can solve a problem quickly you can verify a solution quickly. Whether P = NP is still open.

Answer

D · Every problem in P is also in NP
3.Data structures

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

C · O(V²)
4.Data structures

Answer: D · O(n)

Why this is the answer

A heap gives no rule for which subtree contains a key, so in the worst case all nodes must be checked; only the minimum is fast to find.

Answer

D · O(n)
5.Graph theory

Answer: k = 11

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.

Edges of a spanning tree

9 − 1 = 8

Edges to remove

k = 19 − 8 = 11

Answer

k = 11
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 0
C: 1 1 0 0 1
D: 0 1 0 0 1
E: 0 0 1 1 0

Common neighbours

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

Answer

N = 1

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