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. BThe problem has exactly one optimal solution, which every subproblem shares
  3. CEvery subproblem has the same size
  4. DThe problem can be solved in constant time
2.Algorithms & complexityHard

Strassen's algorithm multiplies matrices using 7 instead of 8 recursive multiplications of half-size blocks. What is its running time?

  1. AΘ(nlog₂ 7), about n2.81
  2. BΘ(n2)
  3. CΘ(n² log n)
  4. DΘ(n³)
3.Data structuresMedium

An in-order traversal of a binary search tree visits the keys in:

  1. ALevel order
  2. BAscending sorted order
  3. CDescending order always
  4. DInsertion order
4.Data structuresHard

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

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

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

2 × deg 33 × deg 2
L =
6.Graph theoryHard
21391817115ABCDE

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 · 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 · Θ(nlog₂ 7), about n2.81

Why this is the answer

With a = 7 and b = 2, nlog₂ 7 dominates the O(n²) addition work, giving about n2.81.

Answer

A · Θ(nlog₂ 7), about n2.81
3.Data structures

Answer: B · Ascending sorted order

Why this is the answer

Visiting the left subtree, then the node, then the right subtree outputs BST keys in sorted order.

Answer

B · Ascending sorted order
4.Data structures

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

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

Answer: L = 4

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

Answer

L = 4

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

6.Graph theory

Answer: W = 27

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 (1): take
AB (2): take
BC (9): take
AC (13): skip, closes a cycle
BE (15): take

Total weight

W = 1 + 2 + 9 + 15 = 27

Answer

W = 27

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