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

Is it correct to say that an O(n²) algorithm is also O(n³)?

  1. AYes, because Big O is an upper bound and n² grows no faster than n³
  2. BNo, because Big O must always state the exact growth rate of the function
  3. CNo, because n³ is smaller than n² for large n
  4. DYes, but only if n is smaller than 100
2.Algorithms & complexityHard

How does the Bellman–Ford algorithm detect a negative-weight cycle reachable from the source?

  1. AIt counts the cycles with depth-first search
  2. BIt runs Dijkstra's algorithm twice and compares the two distance results
  3. CAfter V − 1 rounds, it checks whether any edge can still be relaxed
  4. DIt checks whether any edge has a negative weight
3.Data structuresMedium

How much memory does an adjacency list use for a graph with V vertices and E edges?

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

In a circular buffer, front == rear can mean either empty or full. What is a common way to tell them apart?

  1. AStore the front and rear in the same variable
  2. BMake the buffer size a power of two
  3. CAlways clear the buffer whenever front equals rear, so the state is empty
  4. DKeep a separate element count, or always leave one slot unused
5.Graph theoryMedium

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

K7
H =
6.Graph theoryHard
ABCDEF

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

M = adjacency matrixL = 2
N =

3Solutions

1.Algorithms & complexity

Answer: A · Yes, because Big O is an upper bound and n² grows no faster than n³

Why this is the answer

Big O is an upper bound, so the statement is true but not tight; Θ(n²) states the exact growth rate.

Answer

A · Yes, because Big O is an upper bound and n² grows no faster than n³
2.Algorithms & complexity

Answer: C · After V − 1 rounds, it checks whether any edge can still be relaxed

Why this is the answer

All true shortest distances are found within V − 1 rounds; if an edge can still be improved, a negative cycle must exist.

Answer

C · After V − 1 rounds, it checks whether any edge can still be relaxed
3.Data structures

Answer: D · O(V + E)

Why this is the answer

Each vertex has a list and each edge appears once (directed) or twice (undirected), giving O(V + E).

Answer

D · O(V + E)
4.Data structures

Answer: D · Keep a separate element count, or always leave one slot unused

Why this is the answer

With a count, empty means count = 0 and full means count = capacity; with one empty slot, full is defined as (rear + 1) mod n == front.

Answer

D · Keep a separate element count, or always leave one slot unused
5.Graph theory

Answer: H = 360

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 = (7 − 1)!/2 = 720/2 = 360

Answer

H = 360
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 1 0
D: 0 1 0 0 0 1
E: 0 1 1 0 0 0
F: 0 0 0 1 0 0

Common neighbours

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

Answer

N = 1

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