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

About how many comparisons does binary search need in the worst case on a sorted array of 1,000,000 elements?

  1. AAbout 500,000
  2. BAbout 100
  3. CAbout 1,000
  4. DAbout 20
2.Algorithms & complexityHard

For which knapsack variant does the greedy rule "take items in order of value per weight" always give an optimal answer?

  1. ANeither variant
  2. BThe 0/1 knapsack, where items must always be taken whole
  3. CThe fractional knapsack, where items may be split
  4. DBoth variants
3.Data structuresMedium

What is the worst-case height of a binary search tree with n nodes if keys are inserted in sorted order?

  1. A1
  2. B√n
  3. Cn (it becomes a linked list)
  4. Dlog₂ n
4.Data structuresHard

A segment tree is typically used to:

  1. AStore a graph's edges
  2. BSort strings alphabetically by storing each prefix in a separate tree node
  3. CAnswer range queries (such as range sums) and updates in O(log n)
  4. DImplement a stack
5.Graph theoryMedium
ABCDEEuler 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| = 5|E| = 6
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
1166536121ABCDEF

Dijkstra’s algorithm runs from A. Click the vertex that is settled (made permanent) in round 3; A itself is round 1.

start: Around 3
  1. 1A
  2. 2B
  3. 3C
  4. 4D
  5. 5E
  6. 6F

3Solutions

1.Algorithms & complexity

Answer: D · About 20

Why this is the answer

220 ≈ 1,048,576, so after about 20 halvings only one element remains.

Answer

D · About 20
2.Algorithms & complexity

Answer: C · The fractional knapsack, where items may be split

Why this is the answer

When items can be split, the best ratio first is optimal; in 0/1 knapsack a high-ratio item can block a better combination, so dynamic programming is needed.

Answer

C · The fractional knapsack, where items may be split
3.Data structures

Answer: C · n (it becomes a linked list)

Why this is the answer

Sorted insertions create a degenerate tree with height n, making searches O(n). Balanced trees prevent this.

Answer

C · n (it becomes a linked list)
4.Data structures

Answer: C · Answer range queries (such as range sums) and updates in O(log n)

Why this is the answer

A segment tree stores aggregates for intervals, supporting range queries and point updates in O(log n) time.

Answer

C · Answer range queries (such as range sums) and updates in O(log n)
5.Graph theory

Answer: Euler 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) = 2, deg(B) = 4, deg(C) = 2, deg(D) = 2, deg(E) = 2

Odd vertices

0
Euler circuit

Answer

Euler circuit
6.Graph theory

Answer: E

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

1. A (0): B: 11, C: 6
2. C (6): E: 9
3. E (9): D: 15, B: 10
4. B (10)
5. D (15): F: 27
6. F (27)

round 3

E

Answer

E

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