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 computing the n-th Fibonacci number with a bottom-up table?

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

What is the time complexity of building a binary heap from n unsorted elements with the bottom-up method?

  1. AO(log n)
  2. BO(n log n)
  3. CO(n)
  4. DO(n²)
3.Data structuresMedium

A trie (prefix tree) is especially efficient for:

  1. AFinding shortest paths
  2. BPrefix searches such as autocomplete
  3. CStoring matrices
  4. DSorting numbers
4.Data structuresHard

Why do databases often use B+ trees rather than plain B-trees for indexes?

  1. AB+ trees use binary internal nodes, which reduces the number of disk reads
  2. BAll records are in linked leaves, which makes range scans efficient
  3. CB+ trees do not need to be balanced
  4. DB+ trees store data only in the root
5.Graph theoryMedium

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

|V| = 6|E| = 16
k =
6.Graph theoryHard
21051395964ABCDEFG

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

Filling the table from 0 to n takes one addition per entry, so the work is linear instead of exponential.

Answer

A · O(n)
2.Algorithms & complexity

Answer: C · O(n)

Why this is the answer

Summing sift-down costs over the levels gives a convergent series, so heapify runs in linear time.

Answer

C · O(n)
3.Data structures

Answer: B · Prefix searches such as autocomplete

Why this is the answer

Tries store strings by characters along paths, so lookups and prefix queries take time proportional to the key length.

Answer

B · Prefix searches such as autocomplete
4.Data structures

Answer: B · All records are in linked leaves, which makes range scans efficient

Why this is the answer

In a B+ tree internal nodes only guide the search and the leaves are linked in key order, so a range query finds the first key and then walks along the leaves.

Answer

B · All records are in linked leaves, which makes range scans efficient
5.Graph theory

Answer: k = 11

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

6 − 1 = 5

Edges to remove

k = 16 − 5 = 11

Answer

k = 11
6.Graph theory

Answer: d(F) = 16

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: 2, C: 10
B (2): D: 7, G: 11
D (7): E: 20, F: 16
C (10)
G (11): E: 15
E (15)
F (16)

Shortest path

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

Answer

d(F) = 16

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