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

In the activity selection problem, which greedy rule always gives a maximum number of non-overlapping activities?

  1. APick the activity with the fewest overlaps first, then repeat with the compatible ones
  2. BPick the activity that finishes earliest, then repeat with the compatible ones
  3. CPick the shortest activity first
  4. DPick the activity that starts earliest
2.Algorithms & complexityHard

Topological sorting is possible only for:

  1. AUndirected graphs
  2. BGraphs with negative weights
  3. CComplete graphs
  4. DDirected acyclic graphs
3.Data structuresMedium

What is the purpose of a sentinel (dummy) node in a linked list?

  1. ATo prevent the list from growing beyond a fixed maximum number of nodes
  2. BTo store the number of elements
  3. CTo make the list sorted
  4. DTo simplify code by removing special cases at the head or tail
4.Data structuresHard

A Fenwick tree (binary indexed tree) over an array of n numbers supports which operations in O(log n)?

  1. AInserting elements at any position
  2. BSorting the array and binary search
  3. CPrefix-sum queries and single-element updates
  4. DFinding the median in O(1)
5.Graph theoryMedium

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

4 × deg 33 × deg 2
L =
6.Graph theoryHard
614141014633ABCDEF

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: B · Pick the activity that finishes earliest, then repeat with the compatible ones

Why this is the answer

Choosing the earliest finishing time can be proven optimal by an exchange argument; the other rules have counterexamples.

Answer

B · Pick the activity that finishes earliest, then repeat with the compatible ones
2.Algorithms & complexity

Answer: D · Directed acyclic graphs

Why this is the answer

A topological order exists if and only if the directed graph has no cycles; it can be found in O(V + E) with DFS or Kahn's algorithm.

Answer

D · Directed acyclic graphs
3.Data structures

Answer: D · To simplify code by removing special cases at the head or tail

Why this is the answer

With a sentinel, every real node has a predecessor, so inserting or deleting at the head needs no special handling.

Answer

D · To simplify code by removing special cases at the head or tail
4.Data structures

Answer: C · Prefix-sum queries and single-element updates

Why this is the answer

A Fenwick tree stores partial sums over ranges determined by the low bits of each index, so both prefix sums and point updates take O(log n).

Answer

C · Prefix-sum queries and single-element updates
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 + 18 = 2(L + 7) − 2
L = 6

Answer

L = 6

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

6.Graph theory

Answer: d(F) = 12

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: 6, C: 14
B (6): D: 20, E: 9
E (9): F: 12
F (12): D: 18
C (14)
D (18)

Shortest path

A → B → E → F
d(F) = 12

Answer

d(F) = 12

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