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 time complexity of: for i = 1 to n: (j = 1; while j < n: j = j × 2)?

  1. AO(n log n)
  2. BO(n)
  3. CO(n²)
  4. DO(log 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)
  2. BO((V + E) log V)
  3. CO(V³)
  4. DO(V × E)
3.Data structuresMedium

Which data structure is used by depth-first search (iterative version)?

  1. AA queue
  2. BA heap
  3. CA hash table only
  4. DA stack
4.Data structuresHard

The time complexity of decrease-key in a binary heap (given the element's position) is:

  1. AO(1)
  2. BO(n log n)
  3. CO(log n)
  4. DO(n)
5.Graph theoryMedium

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

|V| = 15|E| = 25
k =
6.Graph theoryHard
17111052191320ABCDEFG

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

start: Ak = 3
  1. 1edge AC
  2. 2edge BC
  3. 3edge BD
  4. 4edge CE
  5. 5edge DF
  6. 6edge EF
  7. 7edge GB
  8. 8edge GD
  9. 9edge GE

3Solutions

1.Algorithms & complexity

Answer: A · O(n log n)

Why this is the answer

The inner loop runs about log₂ n times for each of the n outer iterations, giving O(n log n).

Answer

A · O(n log n)
2.Algorithms & complexity

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

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

Answer: D · A stack

Why this is the answer

DFS explores as deep as possible, naturally using a stack (or recursion's call stack); BFS uses a queue.

Answer

D · A stack
4.Data structures

Answer: C · O(log n)

Why this is the answer

After decreasing the key, the element sifts up at most the height of the heap. Fibonacci heaps achieve O(1) amortised decrease-key.

Answer

C · O(log n)
5.Graph theory

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

Edges of a spanning tree

15 − 1 = 14

Edges to remove

k = 25 − 14 = 11

Answer

k = 11
6.Graph theory

Answer: edge BC

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. AC (17)
2. CE (5)
3. BC (11)
4. GB (1)
5. GD (3)
6. DF (2)

edge number 3

BC

Answer

edge BC

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