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

You sort an array of n elements once and then answer k membership queries with binary search. What is the total cost?

  1. AO(nk)
  2. BO(n + k)
  3. CO(n log n + k log n)
  4. DO(k n log n)
2.Algorithms & complexityHard

Which statement about P and NP is correct?

  1. ANP means "not polynomial"
  2. BNP problems cannot be verified quickly
  3. CIt has been proven that P ≠ NP
  4. DEvery problem in P is also in NP
3.Data structuresMedium

A trie (prefix tree) is especially efficient for:

  1. ASorting numbers
  2. BFinding shortest paths
  3. CPrefix searches such as autocomplete
  4. DStoring matrices
4.Data structuresHard

The keys 5, 3, 8, 1 are inserted in this order into an empty array-based binary min-heap. What is the final array?

  1. A[1, 3, 5, 8]
  2. B[1, 5, 8, 3]
  3. C[3, 1, 8, 5]
  4. D[1, 3, 8, 5]
5.Graph theoryMedium

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

4 × deg 32 × deg 44 × deg 52 × deg 2
L =
6.Graph theoryHard
ABCDEF

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

M = adjacency matrixL = 3
N =

3Solutions

1.Algorithms & complexity

Answer: C · O(n log n + k log n)

Why this is the answer

Sorting costs O(n log n) and each query O(log n); this beats k linear scans (O(nk)) when k is large.

Answer

C · O(n log n + k log n)
2.Algorithms & complexity

Answer: D · Every problem in P is also in NP

Why this is the answer

P ⊆ NP: if you can solve a problem quickly you can verify a solution quickly. Whether P = NP is still open.

Answer

D · Every problem in P is also in NP
3.Data structures

Answer: C · Prefix searches such as autocomplete

Why this is the answer

Tries store strings by characters along paths, so lookups and prefix queries take time proportional to the key length.

Answer

C · Prefix searches such as autocomplete
4.Data structures

Answer: D · [1, 3, 8, 5]

Why this is the answer

After 5, 3, 8 the array is [3, 5, 8]; 1 goes to index 3, swaps with its parent 5 and then with 3, giving [1, 3, 8, 5].

Answer

D · [1, 3, 8, 5]
5.Graph theory

Answer: L = 22

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 + 44 = 2(L + 12) − 2
L = 22

Answer

L = 22

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

One more step

(M³)DD = 1·0 + 1·1 + 1·0 + 3·0 + 1·1 + 0·1 = 2

Answer

N = 2

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