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

The lower bound for comparison-based sorting in the worst case is:

  1. AΩ(n²)
  2. BΩ(log n)
  3. CΩ(n log n)
  4. DΩ(n)
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. ABoth variants
  2. BNeither variant
  3. CThe fractional knapsack, where items may be split
  4. DThe 0/1 knapsack, where items must always be taken whole
3.Data structuresMedium

A road network has 100,000 junctions, each connected to about 4 others. Which representation is most suitable?

  1. AA binary heap of edges
  2. BAdjacency matrix
  3. CA single sorted array of vertices
  4. DAdjacency list
4.Data structuresHard

An object is stored as a key in a hash map, and then a field used by its hash function is changed. What is the likely result?

  1. AThe map automatically moves the key to its new bucket
  2. BThe map throws an error at the moment the field changes
  3. CLooking up the object may fail because it sits in the bucket for its old hash
  4. DNothing changes, because a key's hash is computed only once when the program starts
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
261971331610ABCDEF

Kruskal’s algorithm builds a minimum spanning tree. Click the edge it adds as edge number 2; skipped edges do not count.

k = 2
  1. 1edge AB
  2. 2edge AC
  3. 3edge BC
  4. 4edge BD
  5. 5edge DE
  6. 6edge DF
  7. 7edge EF
  8. 8edge BE

3Solutions

1.Algorithms & complexity

Answer: C · Ω(n log n)

Why this is the answer

Any comparison sort needs at least log₂(n!) ≈ n log n comparisons in the worst case. Counting sort beats it because it does not compare.

Answer

C · Ω(n log n)
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: D · Adjacency list

Why this is the answer

A matrix would need 1010 cells, almost all empty; an adjacency list only stores the roughly 400,000 edge entries.

Answer

D · Adjacency list
4.Data structures

Answer: C · Looking up the object may fail because it sits in the bucket for its old hash

Why this is the answer

The key's location was chosen from its old hash; with a new hash, lookups search the wrong bucket, so keys should be immutable.

Answer

C · Looking up the object may fail because it sits in the bucket for its old hash
5.Graph theory

Answer: neither

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) = 3, deg(C) = 3, deg(D) = 1, deg(E) = 3, deg(F) = 2

Odd vertices

B, C, D, E → 4
neither

Answer

neither
6.Graph theory

Answer: edge DF

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.

Kruskal’s algorithm

1. AB (2)
2. DF (3)
3. AC (6)
4. BD (7)
5. BE (10)

edge number 2

DF

Answer

edge DF

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