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(2ⁿ)
  2. BO(n)
  3. CO(n²)
  4. DO(n log n)
2.Algorithms & complexityHard

Which two things must be shown to prove that a decision problem X is NP-complete?

  1. AX reduces to a problem in P, and X is in NP
  2. BX is in P, and X reduces to SAT
  3. CX is in NP, and a known NP-complete problem reduces to X in polynomial time
  4. DX has no polynomial algorithm, and X is decidable
3.Data structuresMedium

What is the time complexity of searching for a key in a balanced binary search tree?

  1. AO(log n)
  2. BO(1)
  3. CO(n)
  4. DO(n log n)
4.Data structuresHard

For a hash table to work correctly, which rule must hash and equality follow?

  1. AEqual keys must have equal hash values
  2. BEqual hash values imply equal keys
  3. CHash values must be prime numbers
  4. DDifferent keys must have different hash values
5.Graph theoryMedium

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

2 × deg 3
L =
6.Graph theoryHard
12141113159185ABCDEF

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

start: Ek = 4
  1. 1edge AB
  2. 2edge AC
  3. 3edge BC
  4. 4edge BD
  5. 5edge DE
  6. 6edge DF
  7. 7edge EF
  8. 8edge BE

3Solutions

1.Algorithms & complexity

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

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

Answer: C · X is in NP, and a known NP-complete problem reduces to X in polynomial time

Why this is the answer

Membership in NP shows X is not harder than NP; the reduction from a known NP-complete problem shows X is at least as hard as all of NP.

Answer

C · X is in NP, and a known NP-complete problem reduces to X in polynomial time
3.Data structures

Answer: A · O(log n)

Why this is the answer

A balanced tree has height about log₂ n, so a search follows one path from root to leaf.

Answer

A · O(log n)
4.Data structures

Answer: A · Equal keys must have equal hash values

Why this is the answer

If two equal keys hashed differently they would be stored in different buckets and lookups would fail; unequal keys may still share a hash.

Answer

A · Equal keys must have equal hash values
5.Graph theory

Answer: L = 4

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 + 6 = 2(L + 2) − 2
L = 4

Answer

L = 4

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. BE (5)
2. BC (11)
3. AB (12)
4. BD (13)
5. DF (9)

edge number 4

BD

Answer

edge BD

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