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 amortised analysis measure?

  1. AThe expected cost over random inputs
  2. BThe cost of the single most expensive operation anywhere in the sequence
  3. CThe cost of an algorithm on the best input
  4. DThe average cost per operation over a worst-case sequence of operations
2.Algorithms & complexityHard

Which definition of the class NP is correct?

  1. ADecision problems whose yes-answers can be verified in polynomial time given a certificate
  2. BProblems that cannot be solved in polynomial time
  3. CProblems that no algorithm can solve
  4. DProblems that are not polynomial
3.Data structuresMedium

What is the worst-case height of a binary search tree with n nodes if keys are inserted in sorted order?

  1. An (it becomes a linked list)
  2. B√n
  3. C1
  4. Dlog₂ n
4.Data structuresHard

Under simple uniform hashing, what is the expected time of a search in a hash table with chaining, n keys and m buckets?

  1. AO(n)
  2. BO(log n)
  3. CO(1 + α), where α = n / m
  4. DO(m)
5.Graph theoryMedium

A tree has 2 vertices of degree 4, 2 vertices of degree 2, and all its other vertices are leaves (degree 1). How many leaves L does it have?

2 × deg 42 × deg 2
L =
6.Graph theoryHard
ABCDE

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

M = adjacency matrixL = 3
N =

3Solutions

1.Algorithms & complexity

Answer: D · The average cost per operation over a worst-case sequence of operations

Why this is the answer

Amortised analysis spreads the cost of rare expensive operations over many cheap ones, giving a guaranteed average for any sequence.

Answer

D · The average cost per operation over a worst-case sequence of operations
2.Algorithms & complexity

Answer: A · Decision problems whose yes-answers can be verified in polynomial time given a certificate

Why this is the answer

For an NP problem, a proposed solution (certificate) can be checked quickly, for example verifying a given assignment satisfies a Boolean formula.

Answer

A · Decision problems whose yes-answers can be verified in polynomial time given a certificate
3.Data structures

Answer: A · n (it becomes a linked list)

Why this is the answer

Sorted insertions create a degenerate tree with height n, making searches O(n). Balanced trees prevent this.

Answer

A · n (it becomes a linked list)
4.Data structures

Answer: C · O(1 + α), where α = n / m

Why this is the answer

Computing the hash costs O(1) and the expected chain length is α, so keeping α bounded by resizing gives O(1) expected time.

Answer

C · O(1 + α), where α = n / m
5.Graph theory

Answer: L = 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.

Handshake lemma for a tree

L + 12 = 2(L + 4) − 2
L = 6

Answer

L = 6

Shortcut: L = 2 + Σ (d − 2) over the vertices with degree d ≥ 3.

6.Graph theory

Answer: N = 2

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

One more step

(M³)AA = 2·0 + 1·1 + 1·1 + 0·0 + 2·0 = 2

Answer

N = 2

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