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 does the recurrence T(n) = T(n − 1) + O(1) solve to?

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

Insertion sort runs in O(n) on sorted input. Does this contradict the Ω(n log n) lower bound for comparison sorting?

  1. AYes, the lower bound is therefore wrong
  2. BYes, but only for arrays shorter than 100
  3. CNo, the lower bound applies to the worst case over all inputs, not to every input
  4. DNo, because insertion sort is not a comparison sort
3.Data structuresMedium

In a hash table using open addressing, what is the maximum possible load factor?

  1. A2
  2. B0.5
  3. C1
  4. DThere is no maximum
4.Data structuresHard

What is the main advantage of a skip list over a sorted linked list?

  1. AIt uses no extra memory
  2. BGuaranteed O(1) search because every node stores a pointer to every other node
  3. CExpected O(log n) search by using several levels of forward pointers
  4. DIt stores keys without order
5.Graph theoryMedium

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

|V| = 7|E| = 12
k =
6.Graph theoryHard
ABCDEF

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

M = adjacency matrixL = 3
N =

3Solutions

1.Algorithms & complexity

Answer: D · O(n)

Why this is the answer

There are n levels with constant work each, as in a recursive sum of an array.

Answer

D · O(n)
2.Algorithms & complexity

Answer: C · No, the lower bound applies to the worst case over all inputs, not to every input

Why this is the answer

The bound says every comparison sort needs about n log n comparisons on some input of size n; special inputs can be much faster.

Answer

C · No, the lower bound applies to the worst case over all inputs, not to every input
3.Data structures

Answer: C · 1

Why this is the answer

With open addressing all keys are stored in the table itself, so n cannot exceed m; separate chaining can have a load factor above 1.

Answer

C · 1
4.Data structures

Answer: C · Expected O(log n) search by using several levels of forward pointers

Why this is the answer

Randomised levels allow searches to skip many nodes, giving expected O(log n) search, insert and delete.

Answer

C · Expected O(log n) search by using several levels of forward pointers
5.Graph theory

Answer: k = 6

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

7 − 1 = 6

Edges to remove

k = 12 − 6 = 6

Answer

k = 6
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 1 0 0 0
B: 1 0 1 1 1 0
C: 1 1 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

One more step

(M³)CC = 1·1 + 2·1 + 3·0 + 2·0 + 1·1 + 1·0 = 4

Answer

N = 4

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