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/2) + O(1) solve to?

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

For which knapsack variant does the greedy rule "take items in order of value per weight" always give an optimal answer?

  1. AThe fractional knapsack, where items may be split
  2. BBoth variants
  3. CNeither variant
  4. DThe 0/1 knapsack, where items must always be taken whole
3.Data structuresMedium

What is the purpose of a sentinel (dummy) node in a linked list?

  1. ATo simplify code by removing special cases at the head or tail
  2. BTo store the number of elements
  3. CTo make the list sorted
  4. DTo prevent the list from growing beyond a fixed maximum number of nodes
4.Data structuresHard

Deleting a node with two children from a binary search tree is usually done by:

  1. ASwapping it with the root
  2. BRemoving the whole subtree
  3. CRebuilding the subtree below it from scratch and reinserting every key it contained
  4. DReplacing it with its in-order successor (or predecessor) and deleting that node
5.Graph theoryMedium

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

2 × deg 32 × deg 5
L =
6.Graph theoryHard
712131441477ABCDEF

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 · O(n)

Why this is the answer

By the master theorem nlog₂ 2 = n dominates the constant work, so T(n) = Θ(n), as when finding a maximum by splitting in halves.

Answer

A · O(n)
2.Algorithms & complexity

Answer: A · The fractional knapsack, where items may be split

Why this is the answer

When items can be split, the best ratio first is optimal; in 0/1 knapsack a high-ratio item can block a better combination, so dynamic programming is needed.

Answer

A · The fractional knapsack, where items may be split
3.Data structures

Answer: A · To simplify code by removing special cases at the head or tail

Why this is the answer

With a sentinel, every real node has a predecessor, so inserting or deleting at the head needs no special handling.

Answer

A · To simplify code by removing special cases at the head or tail
4.Data structures

Answer: D · Replacing it with its in-order successor (or predecessor) and deleting that node

Why this is the answer

The in-order successor has at most one child, so it can be removed easily after copying its key into the node being deleted.

Answer

D · Replacing it with its in-order successor (or predecessor) and deleting that node
5.Graph theory

Answer: L = 10

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

Answer

L = 10

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

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: 7, C: 12
B (7): C: 8, D: 10, E: 14
C (8)
D (10): F: 24
E (14): F: 21
F (21)

Shortest path

A → B → E → F
d(F) = 21

Answer

d(F) = 21

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