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 2
  2. BGreedy uses 3 coins; the optimum is 3
  3. CGreedy uses 4 coins; the optimum is 3
  4. DGreedy uses 2 coins; the optimum is 2
2.Algorithms & complexityHard

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

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

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

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

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

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

How many different Hamilton circuits H does the complete graph K8 have? Circuits that differ only in the starting vertex or the direction count as the same.

K8
H =
6.Graph theoryHard
32013418212ABCDE

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

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

3Solutions

1.Algorithms & complexity

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

A · 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: D · 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

D · Follow left children from the root until there is no left child
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: H = 2520

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.

Count

H = (8 − 1)!/2 = 5040/2 = 2520

Answer

H = 2520
6.Graph theory

Answer: W = 22

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

DE (2): take
AB (3): take
BD (4): take
BE (12): skip, closes a cycle
BC (13): take

Total weight

W = 2 + 3 + 4 + 13 = 22

Answer

W = 22

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