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 multiplying two n × n matrices with the standard triple loop?

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

The halting problem shows that:

  1. AEvery program eventually halts
  2. BNo algorithm can decide for every program and input whether it halts
  3. CLoops should be avoided
  4. DSome programs run faster on faster computers, so halting depends on hardware
3.Data structuresMedium

Which abstract data type does Dijkstra's algorithm use to choose the next vertex to process?

  1. AA min-priority queue
  2. BA set with no ordering
  3. CA FIFO queue
  4. DA stack
4.Data structuresHard

A segment tree is typically used to:

  1. AImplement a stack
  2. BAnswer range queries (such as range sums) and updates in O(log n)
  3. CStore a graph's edges
  4. DSort strings alphabetically by storing each prefix in a separate tree node
5.Graph theoryMedium

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

|V| = 8|E| = 19
k =
6.Graph theoryHard
191031811320ABCDE

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

start: Ck = 3
  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

There are n² entries and each needs n multiplications, giving n³ operations.

Answer

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

Answer: B · No algorithm can decide for every program and input whether it halts

Why this is the answer

Turing showed the halting problem is undecidable: assuming a decider exists leads to a contradiction with a program that does the opposite.

Answer

B · No algorithm can decide for every program and input whether it halts
3.Data structures

Answer: A · A min-priority queue

Why this is the answer

A min-priority queue, usually a binary heap, returns the unvisited vertex with the smallest distance efficiently.

Answer

A · A min-priority queue
4.Data structures

Answer: B · Answer range queries (such as range sums) and updates in O(log n)

Why this is the answer

A segment tree stores aggregates for intervals, supporting range queries and point updates in O(log n) time.

Answer

B · Answer range queries (such as range sums) and updates in O(log n)
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

8 − 1 = 7

Edges to remove

k = 19 − 7 = 12

Answer

k = 12
6.Graph theory

Answer: edge AC

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 (1)
2. BC (3)
3. AC (10)
4. DE (13)

edge number 3

AC

Answer

edge AC

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