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

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

What did the Cook–Levin theorem establish?

  1. AEvery NP problem can be solved in exponential time
  2. BThe halting problem is undecidable
  3. CP is not equal to NP
  4. DThe Boolean satisfiability problem (SAT) is NP-complete
3.Data structuresMedium

What balance condition does an AVL tree maintain at every node?

  1. AThe heights of the left and right subtrees differ by at most 1
  2. BEvery node is coloured red or black
  3. CBoth subtrees of every node contain exactly the same number of nodes
  4. DAll leaves are at exactly the same depth
4.Data structuresHard

Why might a server choose its hash function at random from a universal family?

  1. ATo make the hash table sorted
  2. BTo guarantee that no two keys can ever collide, whatever keys an attacker sends
  3. CTo remove the need to resize the table
  4. DTo make it very unlikely that an attacker can pick many keys that all collide
5.Graph theoryMedium

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

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

Kruskal’s algorithm builds a minimum spanning tree. Click the edge it adds as edge number 3; skipped edges do not count.

k = 3
  1. 1edge AB
  2. 2edge AC
  3. 3edge BC
  4. 4edge BD
  5. 5edge CE
  6. 6edge DE
  7. 7edge DF
  8. 8edge EF

3Solutions

1.Algorithms & complexity

Answer: D · O(2ⁿ)

Why this is the answer

The number of calls doubles with each level and there are n levels, so the total is about 2ⁿ, as in the Towers of Hanoi.

Answer

D · O(2ⁿ)
2.Algorithms & complexity

Answer: D · The Boolean satisfiability problem (SAT) is NP-complete

Why this is the answer

Cook and Levin showed independently that every problem in NP reduces to SAT in polynomial time, so SAT was the first known NP-complete problem.

Answer

D · The Boolean satisfiability problem (SAT) is NP-complete
3.Data structures

Answer: A · The heights of the left and right subtrees differ by at most 1

Why this is the answer

The balance factor (height left − height right) must be −1, 0 or 1; rotations restore it after inserts and deletes.

Answer

A · The heights of the left and right subtrees differ by at most 1
4.Data structures

Answer: D · To make it very unlikely that an attacker can pick many keys that all collide

Why this is the answer

With universal hashing the expected number of collisions is small for any set of keys, since the attacker does not know which function was chosen.

Answer

D · To make it very unlikely that an attacker can pick many keys that all collide
5.Graph theory

Answer: k = 1

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 = 7 − 6 = 1

Answer

k = 1
6.Graph theory

Answer: edge CE

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.

Kruskal’s algorithm

1. BD (1)
2. AC (2)
3. CE (10)
4. BC (12)
5. EF (16)

edge number 3

CE

Answer

edge CE

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