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(V + E)
  3. CO(V × E)
  4. DO(E log V)
2.Algorithms & complexityHard

The Held–Karp dynamic programming algorithm solves the travelling salesman problem exactly. What is its running time for n cities?

  1. AO(n!)
  2. BO(n² 2ⁿ)
  3. CO(2n²)
  4. DO(n³)
3.Data structuresMedium

In a hash table using open addressing, what is the maximum possible load factor?

  1. AThere is no maximum
  2. B2
  3. C0.5
  4. D1
4.Data structuresHard

Which property keeps every B-tree perfectly balanced?

  1. AEach node stores one key
  2. BEvery node has exactly two children
  3. CAll leaves are at the same depth
  4. DThe keys are stored only in the root
5.Graph theoryMedium

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

|V| = 14|E| = 17
k =
6.Graph theoryHard
593531122ABCDEF

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 · 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

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

Answer: B · O(n² 2ⁿ)

Why this is the answer

There are about n 2ⁿ states, each computed in O(n); this is exponential but far faster than trying all (n − 1)! tours.

Answer

B · O(n² 2ⁿ)
3.Data structures

Answer: D · 1

Why this is the answer

With open addressing all keys are stored in the table itself, so n cannot exceed m; separate chaining can have a load factor above 1.

Answer

D · 1
4.Data structures

Answer: C · All leaves are at the same depth

Why this is the answer

Nodes split upwards when full and the tree only gets taller when the root splits, so all leaves always stay on the same level.

Answer

C · All leaves are at the same depth
5.Graph theory

Answer: k = 4

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

14 − 1 = 13

Edges to remove

k = 17 − 13 = 4

Answer

k = 4
6.Graph theory

Answer: d(F) = 9

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: 5, C: 9
B (5): D: 8, E: 7
E (7): F: 9
D (8)
C (9)
F (9)

Shortest path

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

Answer

d(F) = 9

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