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

Dynamic programming is useful when a problem has:

  1. AOnly random inputs
  2. BA single loop
  3. CNo subproblems at all, so it can be solved in one step
  4. DOverlapping subproblems and optimal substructure
2.Algorithms & complexityHard

How do n! and 2ⁿ compare for large n?

  1. AThey grow at the same rate
  2. B2ⁿ grows faster than n!
  3. Cn! grows faster than 2ⁿ
  4. Dn! is O(n²)
3.Data structuresMedium

Which collision resolution method stores colliding keys in a list at the same bucket?

  1. ALinear probing
  2. BQuadratic probing
  3. CSeparate chaining
  4. DDouble hashing
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(1 + α), where α = n / m
  2. BO(n)
  3. CO(m)
  4. DO(log n)
5.Graph theoryMedium

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

3 × deg 42 × deg 5
L =
6.Graph theoryHard
54156135134661ABCDEFG

Use Dijkstra’s algorithm to find the length d(F) of the shortest path from A to F in the weighted graph.

start: Aend: F
d(F) =

3Solutions

1.Algorithms & complexity

Answer: D · Overlapping subproblems and optimal substructure

Why this is the answer

Storing results of overlapping subproblems (memoisation or tabulation) avoids repeated work, turning exponential algorithms into polynomial ones.

Answer

D · Overlapping subproblems and optimal substructure
2.Algorithms & complexity

Answer: C · n! grows faster than 2ⁿ

Why this is the answer

For n ≥ 4, n! exceeds 2ⁿ, and the ratio grows without bound because each extra factor of n! is larger than 2.

Answer

C · n! grows faster than 2ⁿ
3.Data structures

Answer: C · Separate chaining

Why this is the answer

Chaining keeps a linked list (or other structure) per bucket; open addressing looks for another free slot in the table itself.

Answer

C · Separate chaining
4.Data structures

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

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

Answer: L = 14

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

Answer

L = 14

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

6.Graph theory

Answer: d(F) = 20

Shortest paths and spanning trees: Dijkstra’s algorithm settles one vertex per round: the unsettled vertex with the smallest tentative distance. Its distance is then final, and every neighbour v gets d(v) = min(d(v), d(u) + w(u, v)). Kruskal’s algorithm builds a minimum spanning tree by taking the edges from light to heavy and skipping any edge that would close a cycle; Prim’s algorithm grows one tree from a start vertex by always adding the lightest edge that leaves it. A spanning tree of n vertices has n − 1 edges.

Dijkstra round by round

Each line: the vertex settled, its final distance, and the neighbours whose distance improves.

A (0): B: 5, C: 4
C (4): E: 10, G: 10
B (5): D: 20, G: 9
G (9): D: 15
E (10): F: 23
D (15): F: 20
F (20)

Shortest path

A → B → G → D → F
d(F) = 20

Answer

d(F) = 20

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