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

Dynamic programming is useful when a problem has:

  1. AOnly random inputs
  2. BNo subproblems at all, so it can be solved in one step
  3. COverlapping subproblems and optimal substructure
  4. DA single loop
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. CAfter V − 1 rounds, it checks whether any edge can still be relaxed
  4. DIt counts the cycles with depth-first search
3.Data structuresMedium

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

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

Why are B-trees used in databases and file systems?

  1. AThey need no rebalancing
  2. BThey store data unsorted
  3. CTheir high branching factor keeps the tree shallow, reducing slow disk reads
  4. DThey use less memory than any array, so the entire index always fits in main memory
5.Graph theoryMedium

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

3 × deg 34 × deg 2
L =
6.Graph theoryHard
13615239101011ABCDEFG

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: C · Overlapping subproblems and optimal substructure

Why this is the answer

Storing results of overlapping subproblems (memoisation or tabulation) avoids repeated work, turning exponential algorithms into polynomial ones.

Answer

C · Overlapping subproblems and optimal substructure
2.Algorithms & complexity

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

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

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

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

Answer: C · Their high branching factor keeps the tree shallow, reducing slow disk reads

Why this is the answer

B-trees store many keys per node, so height is small and few block reads are needed per lookup; B+ trees also link leaves for range scans.

Answer

C · Their high branching factor keeps the tree shallow, reducing slow disk reads
5.Graph theory

Answer: L = 5

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

Answer

L = 5

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

6.Graph theory

Answer: d(F) = 31

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: 13
B (13): C: 19, D: 28
C (19): G: 29
D (28): E: 30, F: 31
G (29)
E (30)
F (31)

Shortest path

A → B → D → F
d(F) = 31

Answer

d(F) = 31

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