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

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

What is the time complexity of building a binary heap from n unsorted elements with the bottom-up method?

  1. AO(n²)
  2. BO(log n)
  3. CO(n log n)
  4. DO(n)
3.Data structuresMedium

How is a new element inserted into a binary heap?

  1. ARebuild the whole heap from scratch
  2. BInsert it at its sorted position by shifting all of the larger elements one place right
  3. CPlace it at the end of the array and sift it up while it violates the heap property
  4. DPlace it at the root and sift it down
4.Data structuresHard

A segment tree is typically used to:

  1. AImplement a stack
  2. BStore a graph's edges
  3. CSort strings alphabetically by storing each prefix in a separate tree node
  4. DAnswer range queries (such as range sums) and updates in O(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| = 9
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
92215144313ABCDEF

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(2ⁿ)

Why this is the answer

The number of calls doubles with each level and there are n levels, so the total is about 2ⁿ, as in the Towers of Hanoi.

Answer

C · O(2ⁿ)
2.Algorithms & complexity

Answer: D · O(n)

Why this is the answer

Summing sift-down costs over the levels gives a convergent series, so heapify runs in linear time.

Answer

D · O(n)
3.Data structures

Answer: C · Place it at the end of the array and sift it up while it violates the heap property

Why this is the answer

Adding at the end keeps the tree complete; swapping with the parent restores the order in O(log n) steps.

Answer

C · Place it at the end of the array and sift it up while it violates the heap property
4.Data structures

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

D · Answer range queries (such as range sums) and updates in 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) = 1, deg(B) = 2, deg(C) = 3, deg(D) = 3, deg(E) = 4, deg(F) = 2, deg(G) = 3

Odd vertices

A, C, D, G → 4
neither

Answer

neither
6.Graph theory

Answer: d(F) = 17

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): C: 9
C (9): B: 11, E: 24
B (11): D: 13
D (13): F: 17
F (17): E: 20
E (20)

Shortest path

A → C → B → D → F
d(F) = 17

Answer

d(F) = 17

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