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/2) + O(1) solve to?

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

Which two things must be shown to prove that a decision problem X is NP-complete?

  1. AX has no polynomial algorithm, and X is decidable
  2. BX reduces to a problem in P, and X is in NP
  3. CX is in NP, and a known NP-complete problem reduces to X in polynomial time
  4. DX is in P, and X reduces to SAT
3.Data structuresMedium

The keys 50, 30, 70, 20, 40 are inserted in this order into an empty binary search tree. What is the left child of 30?

  1. A20
  2. B40
  3. C70
  4. D50
4.Data structuresHard

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

  1. APrefix-sum queries and single-element updates
  2. BFinding the median in O(1)
  3. CSorting the array and binary search
  4. DInserting elements at any position
5.Graph theoryMedium

How many different Hamilton circuits H does the complete graph K7 have? Circuits that differ only in the starting vertex or the direction count as the same.

K7
H =
6.Graph theoryHard
13189610153ABCDE

Find the total weight W of a minimum spanning tree of the weighted graph.

|V| = 5|E| = 7
W =

3Solutions

1.Algorithms & complexity

Answer: C · O(log n)

Why this is the answer

The problem halves at each step with constant work per step, so there are about log₂ n steps.

Answer

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

Answer: C · X is in NP, and a known NP-complete problem reduces to X in polynomial time

Why this is the answer

Membership in NP shows X is not harder than NP; the reduction from a known NP-complete problem shows X is at least as hard as all of NP.

Answer

C · X is in NP, and a known NP-complete problem reduces to X in polynomial time
3.Data structures

Answer: A · 20

Why this is the answer

20 is smaller than 50 and smaller than 30, so it becomes the left child of 30; 40 becomes its right child.

Answer

A · 20
4.Data structures

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

A · Prefix-sum queries and single-element updates
5.Graph theory

Answer: H = 360

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.

Count

H = (7 − 1)!/2 = 720/2 = 360

Answer

H = 360
6.Graph theory

Answer: W = 31

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.

Kruskal’s algorithm

BE (3): take
BD (6): take
BC (9): take
CE (10): skip, closes a cycle
AB (13): take

Total weight

W = 3 + 6 + 9 + 13 = 31

Answer

W = 31

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