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 is the time complexity of the Bellman–Ford algorithm on a graph with V vertices and E edges?

  1. AO(V × E)
  2. BO(E log V)
  3. CO(V + E)
  4. DO(V³ × E)
2.Algorithms & complexityHard

How does the Bellman–Ford algorithm detect a negative-weight cycle reachable from the source?

  1. AIt checks whether any edge has a negative weight
  2. BIt runs Dijkstra's algorithm twice and compares the two distance results
  3. CIt counts the cycles with depth-first search
  4. DAfter V − 1 rounds, it checks whether any edge can still be relaxed
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. BIts parent, always
  3. CThe leftmost node of its right subtree
  4. DThe rightmost node of its left subtree
4.Data structuresHard

In a hash table using open addressing, why is deletion often done with a "tombstone" marker?

  1. AEmptying the slot could break the probe sequence for other keys
  2. BIt makes the table sorted
  3. CDeleted keys must be kept forever for security, so slots can never be reused
  4. DTombstones speed up hashing
5.Graph theoryMedium
ABCDEFEuler circuitEuler path, no circuitneither

Does the connected graph have an Euler circuit, an Euler path that is not a circuit, or neither? Click your answer.

|V| = 6|E| = 7
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
1115612214315ABCDEF

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(V × E)

Why this is the answer

Each of the V − 1 rounds relaxes all E edges, giving O(VE); in exchange it handles negative edge weights.

Answer

A · O(V × E)
2.Algorithms & complexity

Answer: D · After V − 1 rounds, it checks whether any edge can still be relaxed

Why this is the answer

All true shortest distances are found within V − 1 rounds; if an edge can still be improved, a negative cycle must exist.

Answer

D · After V − 1 rounds, it checks whether any edge can still be relaxed
3.Data structures

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

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

Answer: A · Emptying the slot could break the probe sequence for other keys

Why this is the answer

If a deleted slot became empty, later searches might stop early and miss keys that were placed further along the probe chain.

Answer

A · Emptying the slot could break the probe sequence for other keys
5.Graph theory

Answer: Euler path, no circuit

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.

Degrees

deg(A) = 1, deg(B) = 2, deg(C) = 2, deg(D) = 3, deg(E) = 4, deg(F) = 2

Odd vertices

A, D → 2
Euler path, no circuit

Answer

Euler path, no circuit

The Euler path starts at one odd vertex and ends at the other.

6.Graph theory

Answer: d(F) = 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.

Dijkstra round by round

Each line: the vertex settled, its final distance, and the neighbours whose distance improves.

A (0): B: 11, C: 15
B (11): D: 17, E: 26
C (15)
D (17): E: 19, F: 31
E (19): F: 22
F (22)

Shortest path

A → B → D → E → F
d(F) = 22

Answer

d(F) = 22

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