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 does the recurrence T(n) = T(n − 1) + O(n) solve to?

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

Which algorithm finds a minimum spanning tree by repeatedly adding the cheapest edge that does not form a cycle?

  1. AFloyd–Warshall
  2. BKruskal's algorithm
  3. CDijkstra's algorithm
  4. DPrim's algorithm starting from one node
3.Data structuresMedium

In a circular queue stored in an array of capacity n, how is the next position after index i computed?

  1. A(i + 1) mod n
  2. B2i + 1
  3. C(i − 1) mod n
  4. Di + 1
4.Data structuresHard

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

  1. AO(n)
  2. BO(log n)
  3. CO(1)
  4. DO(n log n)
5.Graph theoryMedium
ABCDEFGEuler circuitEuler path, no circuitneither

Does the connected graph have an Euler circuit, an Euler path that is not a circuit, or neither? Click your answer.

|V| = 7|E| = 8
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
1010121253912ABCDEF

Use Dijkstra’s algorithm to find the length d(F) of the shortest path from A to F in the weighted graph.

start: Aend: F
d(F) =

3Solutions

1.Algorithms & complexity

Answer: C · O(n²)

Why this is the answer

The work sums to about n² / 2, which is the recurrence of selection sort or of quicksort with the worst pivot.

Answer

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

Answer: B · Kruskal's algorithm

Why this is the answer

Kruskal sorts edges by weight and adds them if they connect different components; Prim grows one tree from a start vertex.

Answer

B · Kruskal's algorithm
3.Data structures

Answer: A · (i + 1) mod n

Why this is the answer

The modulo operation wraps index n − 1 back to 0, so the array is reused without shifting elements.

Answer

A · (i + 1) mod n
4.Data structures

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

B · O(log n)
5.Graph theory

Answer: neither

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.

Degrees

deg(A) = 2, deg(B) = 3, deg(C) = 1, deg(D) = 4, deg(E) = 2, deg(F) = 1, deg(G) = 3

Odd vertices

B, C, F, G → 4
neither

Answer

neither
6.Graph theory

Answer: d(F) = 25

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

Each line: the vertex settled, its final distance, and the neighbours whose distance improves.

A (0): B: 10, C: 10
B (10): D: 22, E: 22
C (10)
D (22): F: 25
E (22)
F (25)

Shortest path

A → B → D → F
d(F) = 25

Answer

d(F) = 25

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