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

A recurrence T(n) = 2T(n/2) + O(n) solves to:

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

Topological sorting is possible only for:

  1. AUndirected graphs
  2. BGraphs with negative weights
  3. CComplete graphs
  4. DDirected acyclic graphs
3.Data structuresMedium

What is the worst-case height of a binary search tree with n nodes if keys are inserted in sorted order?

  1. A√n
  2. B1
  3. Cn (it becomes a linked list)
  4. Dlog₂ n
4.Data structuresHard

In the BST with root 50, left subtree 30 (children 20, 40) and right subtree 70 (children 60, 80), the root is deleted using the in-order successor. Which key becomes the new root?

  1. A40
  2. B60
  3. C80
  4. D70
5.Graph theoryMedium
ABCDEFGEuler circuitEuler path, no circuitneither

Does the connected graph have an Euler circuit, an Euler path that is not a circuit, or neither? Click your answer.

|V| = 7|E| = 7
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
12191862079ABCDE

Find the total weight W of a minimum spanning tree of the weighted graph.

|V| = 5|E| = 7
W =

3Solutions

1.Algorithms & complexity

Answer: C · O(n log n)

Why this is the answer

By the master theorem (a = 2, b = 2, f(n) = n), T(n) = Θ(n log n).

Answer

C · O(n log n)
2.Algorithms & complexity

Answer: D · Directed acyclic graphs

Why this is the answer

A topological order exists if and only if the directed graph has no cycles; it can be found in O(V + E) with DFS or Kahn's algorithm.

Answer

D · Directed acyclic graphs
3.Data structures

Answer: C · n (it becomes a linked list)

Why this is the answer

Sorted insertions create a degenerate tree with height n, making searches O(n). Balanced trees prevent this.

Answer

C · n (it becomes a linked list)
4.Data structures

Answer: B · 60

Why this is the answer

The leftmost node of the right subtree is 60, so 60 replaces 50 and its old position is removed; using the predecessor would give 40.

Answer

B · 60
5.Graph theory

Answer: Euler path, no circuit

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.

Degrees

deg(A) = 2, deg(B) = 2, deg(C) = 2, deg(D) = 1, deg(E) = 4, deg(F) = 1, deg(G) = 2

Odd vertices

D, F → 2
Euler path, no circuit

Answer

Euler path, no circuit

The Euler path starts at one odd vertex and ends at the other.

6.Graph theory

Answer: W = 43

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

BD (6): take
DE (7): take
BE (9): skip, closes a cycle
AB (12): take
BC (18): take

Total weight

W = 6 + 7 + 12 + 18 = 43

Answer

W = 43

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