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

With coins of 1, 3 and 4 and an amount of 6, how many coins does the greedy "largest coin first" method use, compared to the optimum?

  1. AGreedy uses 3 coins; the optimum is 3
  2. BGreedy uses 3 coins; the optimum is 2
  3. CGreedy uses 2 coins; the optimum is 2
  4. DGreedy uses 4 coins; the optimum is 3
2.Algorithms & complexityHard

Which of these satisfiability problems is known to be solvable in polynomial time?

  1. ACircuit satisfiability
  2. B2-SAT, where each clause has at most two literals
  3. C3-SAT, where each clause has exactly three literals
  4. DGeneral SAT on formulas in conjunctive normal form
3.Data structuresMedium

A trie (prefix tree) is especially efficient for:

  1. ASorting numbers
  2. BFinding shortest paths
  3. CPrefix searches such as autocomplete
  4. DStoring matrices
4.Data structuresHard

Kahn's algorithm for topological sorting repeatedly removes vertices with in-degree 0. Which structure holds those vertices?

  1. AA stack of all visited edges
  2. BAn adjacency matrix recording which vertices have already been removed
  3. CA queue (or any collection) of vertices whose in-degree is 0
  4. DA max-heap ordered by out-degree
5.Graph theoryMedium

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

4 × deg 34 × deg 44 × deg 2
L =
6.Graph theoryHard
7911213131311ABCDEF

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: B · Greedy uses 3 coins; the optimum is 2

Why this is the answer

Greedy takes 4 + 1 + 1 = 3 coins, but 3 + 3 uses only 2, so greedy is not optimal for this coin system; dynamic programming is.

Answer

B · Greedy uses 3 coins; the optimum is 2
2.Algorithms & complexity

Answer: B · 2-SAT, where each clause has at most two literals

Why this is the answer

2-SAT is in P (linear time via strongly connected components), while 3-SAT is NP-complete.

Answer

B · 2-SAT, where each clause has at most two literals
3.Data structures

Answer: C · Prefix searches such as autocomplete

Why this is the answer

Tries store strings by characters along paths, so lookups and prefix queries take time proportional to the key length.

Answer

C · Prefix searches such as autocomplete
4.Data structures

Answer: C · A queue (or any collection) of vertices whose in-degree is 0

Why this is the answer

Ready vertices are kept in a queue; removing one lowers its neighbours' in-degrees, and any that reach 0 are added, giving O(V + E) time.

Answer

C · A queue (or any collection) of vertices whose in-degree is 0
5.Graph theory

Answer: L = 14

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 + 36 = 2(L + 12) − 2
L = 14

Answer

L = 14

Shortcut: L = 2 + Σ (d − 2) over the vertices with degree d ≥ 3.

6.Graph theory

Answer: d(F) = 24

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: 7, C: 9
B (7): D: 18, E: 18
C (9): E: 11
E (11): F: 24
D (18)
F (24)

Shortest path

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

Answer

d(F) = 24

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