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

Why does dynamic programming give no real speed-up for merge sort?

  1. AMerge sort has no recursive structure
  2. BDynamic programming only works on graph problems, not on arrays
  3. CMerge sort is already O(n)
  4. DIts subproblems do not overlap, so there is nothing to reuse
2.Algorithms & complexityHard

Using the master theorem, T(n) = 8T(n/2) + O(n²) solves to:

  1. AΘ(n log n)
  2. BΘ(n²)
  3. CΘ(n² log n)
  4. DΘ(n³)
3.Data structuresMedium

An adjacency matrix for a graph with V vertices uses how much memory?

  1. AO(V²)
  2. BO(log V)
  3. CO(V + E)
  4. DO(E)
4.Data structuresHard

A Bloom filter can answer "is this element in the set?" with:

  1. AAnswers only for numbers
  2. BExact answers always
  3. CPossible false negatives but no false positives
  4. DPossible false positives but no false negatives
5.Graph theoryMedium

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

|V| = 18|E| = 28
k =
6.Graph theoryHard
111315512188ABCDEF

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

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

3Solutions

1.Algorithms & complexity

Answer: D · Its subproblems do not overlap, so there is nothing to reuse

Why this is the answer

Merge sort's halves are disjoint and each is solved once; DP helps only when subproblems recur, as in Fibonacci.

Answer

D · Its subproblems do not overlap, so there is nothing to reuse
2.Algorithms & complexity

Answer: D · Θ(n³)

Why this is the answer

log₂ 8 = 3, and n² grows slower than n³, so the leaves dominate: Θ(n³).

Answer

D · Θ(n³)
3.Data structures

Answer: A · O(V²)

Why this is the answer

An adjacency matrix stores V × V entries, efficient for dense graphs; adjacency lists use O(V + E), better for sparse graphs.

Answer

A · O(V²)
4.Data structures

Answer: D · Possible false positives but no false negatives

Why this is the answer

If any bit for an item is 0, it is definitely absent; if all are 1 it is probably present. Bloom filters trade accuracy for very little memory.

Answer

D · Possible false positives but no false negatives
5.Graph theory

Answer: k = 11

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

18 − 1 = 17

Edges to remove

k = 28 − 17 = 11

Answer

k = 11
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.

Kruskal’s algorithm

1. AC (1)
2. BC (3)
3. CE (5)
4. DF (12)
5. BD (15)

edge number 5

BD

Answer

edge BD

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