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

Why is the base of a logarithm usually left out in Big O, as in O(log n)?

  1. AAll logarithms in computer science have base 10, so it is implied
  2. BThe base only matters for small n
  3. CLogarithms are always rounded to integers
  4. DLogarithms with different bases differ only by a constant factor
2.Algorithms & complexityHard

Why does binary search not give O(log n) time on a singly linked list?

  1. AComparisons on linked list nodes are slower
  2. BLinked lists cannot be sorted
  3. CReaching the middle element takes O(n) steps, since there is no direct index access
  4. DBinary search needs at least twice the memory
3.Data structuresMedium

What is true of the adjacency matrix of an undirected graph?

  1. AEach row has exactly one 1
  2. BIt is symmetric about the main diagonal
  3. CIts main diagonal always contains ones
  4. DIt is always upper triangular
4.Data structuresHard

You must keep the k smallest values from a stream of n numbers using O(k) memory. Which approach works in O(n log k) time?

  1. AA min-heap holding all n values, from which the k smallest are popped at the end
  2. BA max-heap of size k, replacing its root when a smaller value arrives
  3. CA FIFO queue of the last k values
  4. DA sorted array of all n values
5.Graph theoryMedium
ABCDEFEuler 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| = 6|E| = 6
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
ABCDE

How many closed walks of length 2 start and end at B? A walk may repeat vertices and edges. Call the number N.

M = adjacency matrixL = 2
N =

3Solutions

1.Algorithms & complexity

Answer: D · Logarithms with different bases differ only by a constant factor

Why this is the answer

Changing the base multiplies the logarithm by a constant, and Big O ignores constant factors.

Answer

D · Logarithms with different bases differ only by a constant factor
2.Algorithms & complexity

Answer: C · Reaching the middle element takes O(n) steps, since there is no direct index access

Why this is the answer

Binary search needs O(1) access to the middle; on a linked list walking there costs linear time, so the total is O(n).

Answer

C · Reaching the middle element takes O(n) steps, since there is no direct index access
3.Data structures

Answer: B · It is symmetric about the main diagonal

Why this is the answer

In an undirected graph edge {u, v} means both M[u][v] and M[v][u] are set, so the matrix equals its transpose.

Answer

B · It is symmetric about the main diagonal
4.Data structures

Answer: B · A max-heap of size k, replacing its root when a smaller value arrives

Why this is the answer

The max-heap's root is the largest kept value; any smaller new value replaces it in O(log k), so the heap always holds the k smallest so far.

Answer

B · A max-heap of size k, replacing its root when a smaller value arrives
5.Graph theory

Answer: neither

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) = 1, deg(B) = 3, deg(C) = 2, deg(D) = 2, deg(E) = 3, deg(F) = 1

Odd vertices

A, B, E, F → 4
neither

Answer

neither
6.Graph theory

Answer: N = 4

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

Common neighbours

(M²)BB = 1·1 + 0·0 + 1·1 + 1·1 + 1·1 = 4

Answer

N = 4

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