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. ALogarithms are always rounded to integers
  2. BLogarithms with different bases differ only by a constant factor
  3. CThe base only matters for small n
  4. DAll logarithms in computer science have base 10, so it is implied
2.Algorithms & complexityHard

To show that a new problem X is NP-hard, what must you do?

  1. AShow that X can be verified in polynomial time
  2. BReduce X to a known NP-hard problem in polynomial time
  3. CShow that X has no polynomial algorithm for small inputs
  4. DReduce a known NP-hard problem to X in polynomial time
3.Data structuresMedium

The keys 50, 30, 70, 20, 40 are inserted in this order into an empty binary search tree. What is the left child of 30?

  1. A50
  2. B70
  3. C20
  4. D40
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 max-heap of size k, replacing its root when a smaller value arrives
  2. BA sorted array of all n values
  3. CA FIFO queue of the last k values
  4. DA min-heap holding all n values, from which the k smallest are popped at the end
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 C to B? A walk may repeat vertices and edges. Call the number N.

M = adjacency matrixL = 2
N =

3Solutions

1.Algorithms & complexity

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

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

Answer: D · Reduce a known NP-hard problem to X in polynomial time

Why this is the answer

If a known hard problem can be transformed into X efficiently, a fast algorithm for X would solve the known problem too.

Answer

D · Reduce a known NP-hard problem to X in polynomial time
3.Data structures

Answer: C · 20

Why this is the answer

20 is smaller than 50 and smaller than 30, so it becomes the left child of 30; 40 becomes its right child.

Answer

C · 20
4.Data structures

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

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

Answer: Euler 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) = 4, deg(C) = 2, deg(D) = 2, deg(E) = 2

Odd vertices

0
Euler circuit

Answer

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

Common neighbours

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

Answer

N = 1

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