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 it mean that a problem has optimal substructure?

  1. AAn optimal solution can be built from optimal solutions of its subproblems
  2. BEvery subproblem has the same size
  3. CThe problem can be solved in constant time
  4. DThe problem has exactly one optimal solution, which every subproblem shares
2.Algorithms & complexityHard

A problem is NP-complete if it is:

  1. AIn NP and every NP problem reduces to it in polynomial time
  2. BImpossible to solve
  3. COutside NP but harder than all NP problems, such as the halting problem
  4. DSolvable in polynomial time
3.Data structuresMedium

How much memory does an adjacency list use for a graph with V vertices and E edges?

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

A segment tree is typically used to:

  1. AImplement a stack
  2. BStore a graph's edges
  3. CAnswer range queries (such as range sums) and updates in O(log n)
  4. DSort strings alphabetically by storing each prefix in a separate tree node
5.Graph theoryMedium

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

|V| = 12|E| = 17
k =
6.Graph theoryHard
104531214261ABCDEFG

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: A · An optimal solution can be built from optimal solutions of its subproblems

Why this is the answer

Optimal substructure is required for both greedy algorithms and dynamic programming to produce correct answers.

Answer

A · An optimal solution can be built from optimal solutions of its subproblems
2.Algorithms & complexity

Answer: A · In NP and every NP problem reduces to it in polynomial time

Why this is the answer

NP-complete problems are the hardest in NP; a polynomial algorithm for one would give one for all of NP.

Answer

A · In NP and every NP problem reduces to it in polynomial time
3.Data structures

Answer: A · O(V + E)

Why this is the answer

Each vertex has a list and each edge appears once (directed) or twice (undirected), giving O(V + E).

Answer

A · O(V + E)
4.Data structures

Answer: C · Answer range queries (such as range sums) and updates in O(log n)

Why this is the answer

A segment tree stores aggregates for intervals, supporting range queries and point updates in O(log n) time.

Answer

C · Answer range queries (such as range sums) and updates in O(log n)
5.Graph theory

Answer: k = 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.

Edges of a spanning tree

12 − 1 = 11

Edges to remove

k = 17 − 11 = 6

Answer

k = 6
6.Graph theory

Answer: d(F) = 21

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: 10, C: 4
C (4): G: 6
G (6): D: 12, E: 7
E (7): D: 10, F: 21
B (10)
D (10)
F (21)

Shortest path

A → C → G → E → F
d(F) = 21

Answer

d(F) = 21

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