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

Why is the base of a logarithm usually left out in Big O, as in O(log n)?

  1. AAll logarithms in computer science have base 10, so it is implied
  2. BLogarithms with different bases differ only by a constant factor
  3. CLogarithms are always rounded to integers
  4. DThe base only matters for small n
2.Algorithms & complexityHard

Which bound is correct for log(n!)?

  1. AΘ(n²)
  2. BΘ(n log n)
  3. CΘ(n)
  4. DΘ(log n)
3.Data structuresMedium

In a binary min-heap stored in an array (index starting at 0), the children of the node at index i are at:

  1. A2i + 1 and 2i + 2
  2. Bi/2 and i/2 + 1
  3. C2i and 2i + 1
  4. Di + 1 and i + 2
4.Data structuresHard

For a hash table to work correctly, which rule must hash and equality follow?

  1. AEqual hash values imply equal keys
  2. BDifferent keys must have different hash values
  3. CEqual keys must have equal hash values
  4. DHash values must be prime numbers
5.Graph theoryMedium

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

|V| = 13|E| = 24
k =
6.Graph theoryHard
1111511028151411ABCDEFG

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

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

3Solutions

1.Algorithms & complexity

Answer: B · Logarithms with different bases differ only by a constant factor

Why this is the answer

Changing the base multiplies the logarithm by a constant, and Big O ignores constant factors.

Answer

B · Logarithms with different bases differ only by a constant factor
2.Algorithms & complexity

Answer: B · Θ(n log n)

Why this is the answer

log(n!) ≤ n log n, and the largest n / 2 factors give log(n!) ≥ (n / 2) log(n / 2); this is why comparison sorting needs Ω(n log n).

Answer

B · Θ(n log n)
3.Data structures

Answer: A · 2i + 1 and 2i + 2

Why this is the answer

For 0-based arrays, the left child is at 2i + 1, the right child at 2i + 2, and the parent at ⌊(i − 1)/2⌋.

Answer

A · 2i + 1 and 2i + 2
4.Data structures

Answer: C · Equal keys must have equal hash values

Why this is the answer

If two equal keys hashed differently they would be stored in different buckets and lookups would fail; unequal keys may still share a hash.

Answer

C · Equal keys must have equal hash values
5.Graph theory

Answer: k = 12

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

13 − 1 = 12

Edges to remove

k = 24 − 12 = 12

Answer

k = 12
6.Graph theory

Answer: B

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: 1
2. C (1): E: 2, G: 16
3. E (2): D: 12, F: 4, G: 13
4. F (4)
5. B (11)
6. D (12)
7. G (13)

round 5

B

Answer

B

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