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 computing the n-th Fibonacci number with a bottom-up table?

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

Taking both endpoints of every edge in a maximal matching gives a vertex cover. How good is this cover?

  1. AOf unknown quality compared to the optimum
  2. BAt most log n times the minimum
  3. CAlways a minimum vertex cover
  4. DAt most twice the size of a minimum vertex cover
3.Data structuresMedium

What is the cost of inserting an element in the middle of an array of n elements?

  1. AO(log n), because of binary search
  2. BO(n²), because each element moves n times
  3. CO(n), because later elements must shift
  4. DO(1), because the index is known
4.Data structuresHard

Which structure lets you compute the maximum of every window of size k in an array in O(n) total?

  1. AA min-heap rebuilt for every window
  2. BA sorted array updated by shifting
  3. CA singly linked list of the window's elements
  4. DA deque holding indices in decreasing order of value
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
1911146131161111ABCDEFG

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: A · O(n)

Why this is the answer

Filling the table from 0 to n takes one addition per entry, so the work is linear instead of exponential.

Answer

A · O(n)
2.Algorithms & complexity

Answer: D · At most twice the size of a minimum vertex cover

Why this is the answer

The matching edges share no vertices, so the optimum needs at least one vertex per edge, while this method takes two: a 2-approximation.

Answer

D · At most twice the size of a minimum vertex cover
3.Data structures

Answer: C · O(n), because later elements must shift

Why this is the answer

All elements after the insertion point move one position to the right, which takes time proportional to n.

Answer

C · O(n), because later elements must shift
4.Data structures

Answer: D · A deque holding indices in decreasing order of value

Why this is the answer

The front of the deque is always the window's maximum; each index enters and leaves the deque once, so the work is linear.

Answer

D · A deque holding indices in decreasing order of value
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) = 4, deg(D) = 1, deg(E) = 4, deg(F) = 1, deg(G) = 3

Odd vertices

A, D, F, G → 4
neither

Answer

neither
6.Graph theory

Answer: d(F) = 26

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: 1, C: 9
B (1): D: 15
C (9): E: 15, G: 15
D (15)
E (15): F: 26
G (15)
F (26)

Shortest path

A → C → E → F
d(F) = 26

Answer

d(F) = 26

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