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 worst-case time complexity of quicksort?

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

What is the running time of Dijkstra's algorithm with a binary heap on a graph with V vertices and E edges?

  1. AO((V + E) log V)
  2. BO(V × E)
  3. CO(V + E)
  4. DO(V³)
3.Data structuresMedium

How many nodes does a perfect binary tree of height h have, with height counted in edges?

  1. A2h+1 − 1
  2. B2h + 1
  3. Ch2
  4. D2h
4.Data structuresHard

Under simple uniform hashing, what is the expected time of a search in a hash table with chaining, n keys and m buckets?

  1. AO(m)
  2. BO(log n)
  3. CO(n)
  4. DO(1 + α), where α = n / m
5.Graph theoryMedium

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

2 × deg 4
L =
6.Graph theoryHard
10112029114ABCDE

Prim’s algorithm builds a minimum spanning tree starting from vertex C. Click the edge it adds as edge number 4.

start: Ck = 4
  1. 1edge AB
  2. 2edge AC
  3. 3edge BC
  4. 4edge BD
  5. 5edge CE
  6. 6edge DE
  7. 7edge BE

3Solutions

1.Algorithms & complexity

Answer: D · O(n²)

Why this is the answer

With consistently bad pivots (e.g. already sorted input and first-element pivot) partitions are unbalanced, giving O(n²). The average case is O(n log n).

Answer

D · O(n²)
2.Algorithms & complexity

Answer: A · O((V + E) log V)

Why this is the answer

There are V extract-min and up to E decrease-key operations, each O(log V); a Fibonacci heap improves this to O(E + V log V).

Answer

A · O((V + E) log V)
3.Data structures

Answer: A · 2h+1 − 1

Why this is the answer

Summing 1 + 2 + 4 + ... + 2h gives 2h+1 − 1; for example, height 2 gives 7 nodes.

Answer

A · 2h+1 − 1
4.Data structures

Answer: D · O(1 + α), where α = n / m

Why this is the answer

Computing the hash costs O(1) and the expected chain length is α, so keeping α bounded by resizing gives O(1) expected time.

Answer

D · O(1 + α), where α = n / m
5.Graph theory

Answer: L = 6

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 + 8 = 2(L + 2) − 2
L = 6

Answer

L = 6

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

6.Graph theory

Answer: edge AB

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.

Prim’s algorithm

1. CE (9)
2. DE (1)
3. BD (2)
4. AB (10)

edge number 4

AB

Answer

edge AB

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