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

How much stack space does a simple recursive factorial function fact(n) = n × fact(n − 1) use?

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

What did the Cook–Levin theorem establish?

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

A trie (prefix tree) is especially efficient for:

  1. ASorting numbers
  2. BStoring matrices
  3. CFinding shortest paths
  4. DPrefix searches such as autocomplete
4.Data structuresHard

How long does it take to search for an arbitrary key in a binary min-heap of n elements?

  1. AO(n)
  2. BO(log n)
  3. CO(1)
  4. DO(log log n)
5.Graph theoryMedium

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

4 × deg 3
L =
6.Graph theoryHard
59412061028ABCDEF

Prim’s algorithm builds a minimum spanning tree starting from vertex F. Click the edge it adds as edge number 3.

start: Fk = 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
  9. 9edge BE

3Solutions

1.Algorithms & complexity

Answer: D · O(n)

Why this is the answer

The recursion is n calls deep before any returns, and each call needs a stack frame, so it uses O(n) space.

Answer

D · O(n)
2.Algorithms & complexity

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

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

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

D · Prefix searches such as autocomplete
4.Data structures

Answer: A · O(n)

Why this is the answer

A heap gives no rule for which subtree contains a key, so in the worst case all nodes must be checked; only the minimum is fast to find.

Answer

A · O(n)
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: edge BD

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.

Prim’s algorithm

1. EF (2)
2. DE (6)
3. BD (1)
4. BC (4)
5. AB (5)

edge number 3

BD

Answer

edge BD

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