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 Floyd–Warshall algorithm compute, and how fast?

  1. AA minimum spanning tree in O(E log V)
  2. BA topological order in O(V²)
  3. CShortest paths between all pairs of vertices in O(V³)
  4. DShortest paths from one source vertex to all others in O(V + E)
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 NP, and a known NP-complete problem reduces to X in polynomial time
  3. CX is in P, and X reduces to SAT
  4. DX has no polynomial algorithm, and X is decidable
3.Data structuresMedium

How do you find the minimum key in a binary search tree?

  1. AVisit every leaf and compare them
  2. BLook at the root only
  3. CFollow left children from the root until there is no left child
  4. DFollow right children from the root until there is no right child
4.Data structuresHard

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

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

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

|V| = 17|E| = 19
k =
6.Graph theoryHard
121114125151510ABCDEF

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: C · Shortest paths between all pairs of vertices in O(V³)

Why this is the answer

Floyd–Warshall is a dynamic programming algorithm that allows each vertex in turn as an intermediate point, using O(V³) time.

Answer

C · Shortest paths between all pairs of vertices in O(V³)
2.Algorithms & complexity

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

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

Answer: C · Follow left children from the root until there is no left child

Why this is the answer

The leftmost node has no smaller key in the tree, so it is the minimum; the cost is proportional to the height.

Answer

C · Follow left children from the root until there is no left child
4.Data structures

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

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

Answer: k = 3

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

17 − 1 = 16

Edges to remove

k = 19 − 16 = 3

Answer

k = 3
6.Graph theory

Answer: d(F) = 31

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: 12, C: 11
C (11): E: 16
B (12): D: 24
E (16): F: 31
D (24)
F (31)

Shortest path

A → C → E → F
d(F) = 31

Answer

d(F) = 31

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