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 the recurrence T(n) = 2T(n − 1) + O(1) solve to?

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

Taking both endpoints of every edge in a maximal matching gives a vertex cover. How good is this cover?

  1. AOf unknown quality compared to the optimum
  2. BAt most twice the size of a minimum vertex cover
  3. CAlways a minimum vertex cover
  4. DAt most log n times the minimum
3.Data structuresMedium

A node in a binary search tree has a right subtree. Where is its in-order successor?

  1. AIts right child, always
  2. BThe leftmost node of its right subtree
  3. CIts parent, always
  4. DThe rightmost node of its left subtree
4.Data structuresHard

An AVL node is unbalanced because its left child's right subtree became too tall (left-right case). Which fix is applied?

  1. AA right rotation at the left child, then a left rotation at the node
  2. BA left rotation at the left child, then a right rotation at the node
  3. CA single left rotation at the node
  4. DA single right rotation at the node
5.Graph theoryMedium

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

|V| = 14|E| = 21
k =
6.Graph theoryHard
1252061917410182ABCDEFG

Prim’s algorithm builds a minimum spanning tree starting from vertex F. Click the edge it adds as edge number 6.

start: Fk = 6
  1. 1edge AB
  2. 2edge AC
  3. 3edge BC
  4. 4edge BD
  5. 5edge CE
  6. 6edge DE
  7. 7edge DF
  8. 8edge EF
  9. 9edge GB
  10. 10edge GD

3Solutions

1.Algorithms & complexity

Answer: C · O(2ⁿ)

Why this is the answer

The number of calls doubles with each level and there are n levels, so the total is about 2ⁿ, as in the Towers of Hanoi.

Answer

C · O(2ⁿ)
2.Algorithms & complexity

Answer: B · At most twice the size of a minimum vertex cover

Why this is the answer

The matching edges share no vertices, so the optimum needs at least one vertex per edge, while this method takes two: a 2-approximation.

Answer

B · At most twice the size of a minimum vertex cover
3.Data structures

Answer: B · The leftmost node of its right subtree

Why this is the answer

All larger keys close to the node are in its right subtree, and the smallest of those is the leftmost node there.

Answer

B · The leftmost node of its right subtree
4.Data structures

Answer: B · A left rotation at the left child, then a right rotation at the node

Why this is the answer

The first rotation converts the left-right case into a left-left case, which a right rotation at the unbalanced node then fixes.

Answer

B · A left rotation at the left child, then a right rotation at the node
5.Graph theory

Answer: k = 8

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

14 − 1 = 13

Edges to remove

k = 21 − 13 = 8

Answer

k = 8
6.Graph theory

Answer: edge AC

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.

Prim’s algorithm

1. DF (4)
2. GD (2)
3. BD (6)
4. EF (10)
5. AB (12)
6. AC (5)

edge number 6

AC

Answer

edge AC

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