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

In a sorted array, you look for two elements that sum to a target by moving one pointer from each end inwards. What is the time complexity?

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

Using the master theorem, T(n) = 8T(n/2) + O(n²) solves to:

  1. AΘ(n² log n)
  2. BΘ(n²)
  3. CΘ(n log n)
  4. DΘ(n³)
3.Data structuresMedium

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

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

For a hash table to work correctly, which rule must hash and equality follow?

  1. AEqual hash values imply equal keys
  2. BHash values must be prime numbers
  3. CEqual keys must have equal hash values
  4. DDifferent keys must have different hash values
5.Graph theoryMedium

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

|V| = 15|E| = 22
k =
6.Graph theoryHard
31513101113610ABCDEF

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

If the sum is too small the left pointer moves right, if too large the right pointer moves left, so there are at most n steps.

Answer

A · O(n)
2.Algorithms & complexity

Answer: D · Θ(n³)

Why this is the answer

log₂ 8 = 3, and n² grows slower than n³, so the leaves dominate: Θ(n³).

Answer

D · Θ(n³)
3.Data structures

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

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

Answer: C · Equal keys must have equal hash values

Why this is the answer

If two equal keys hashed differently they would be stored in different buckets and lookups would fail; unequal keys may still share a hash.

Answer

C · Equal keys must have equal hash values
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

15 − 1 = 14

Edges to remove

k = 22 − 14 = 8

Answer

k = 8
6.Graph theory

Answer: d(F) = 19

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: 3, C: 15
B (3): E: 13
E (13): D: 24, F: 19
C (15)
F (19)
D (24)

Shortest path

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

Answer

d(F) = 19

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