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 running time of LSD radix sort on n integers with d digits in base k?

  1. AO(d(n + k))
  2. BO(n²)
  3. CO(n log n)
  4. DO(dn log k)
2.Algorithms & complexityHard

To show that a new problem X is NP-hard, what must you do?

  1. AReduce X to a known NP-hard problem in polynomial time
  2. BShow that X has no polynomial algorithm for small inputs
  3. CReduce a known NP-hard problem to X in polynomial time
  4. DShow that X can be verified in polynomial time
3.Data structuresMedium

In a binary heap stored in an array starting at index 0, where is the parent of the node at index i?

  1. AAt index ⌊(i − 1) / 2⌋
  2. BAt index i − 1
  3. CAt index ⌊i / 2⌋ + 1
  4. DAt index 2i + 1
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. BEqual keys must have equal hash values
  3. CHash values must be prime numbers
  4. DDifferent keys must have different hash values
5.Graph theoryMedium

A tree has 3 vertices of degree 5, 2 vertices of degree 2, and all its other vertices are leaves (degree 1). How many leaves L does it have?

3 × deg 52 × deg 2
L =
6.Graph theoryHard
139652173ABCDEF

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

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

3Solutions

1.Algorithms & complexity

Answer: A · O(d(n + k))

Why this is the answer

Each of the d passes is a counting sort costing O(n + k), so for fixed d and k the total is linear in n.

Answer

A · O(d(n + k))
2.Algorithms & complexity

Answer: C · Reduce a known NP-hard problem to X in polynomial time

Why this is the answer

If a known hard problem can be transformed into X efficiently, a fast algorithm for X would solve the known problem too.

Answer

C · Reduce a known NP-hard problem to X in polynomial time
3.Data structures

Answer: A · At index ⌊(i − 1) / 2⌋

Why this is the answer

Children of i are at 2i + 1 and 2i + 2, so the parent of i is ⌊(i − 1) / 2⌋; with 1-based indexing it is ⌊i / 2⌋.

Answer

A · At index ⌊(i − 1) / 2⌋
4.Data structures

Answer: B · 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

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

Answer: L = 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.

Handshake lemma for a tree

L + 19 = 2(L + 5) − 2
L = 11

Answer

L = 11

Shortcut: L = 2 + Σ (d − 2) over the vertices with degree d ≥ 3.

6.Graph theory

Answer: D

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: 13
2. B (13): C: 22, D: 19, E: 16
3. E (16): C: 21, D: 18, F: 23
4. D (18): F: 19
5. F (19)
6. C (21)

round 4

D

Answer

D

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