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

How does Prim's algorithm build a minimum spanning tree?

  1. AIt removes the most expensive edge until no cycles remain
  2. BIt sorts all edges by weight and adds each one unless it would form a cycle in the forest
  3. CIt runs breadth-first search and keeps the BFS tree
  4. DIt grows one tree from a start vertex, adding the cheapest edge that leaves the tree
2.Algorithms & complexityHard

Which definition of the class NP is correct?

  1. ADecision problems whose yes-answers can be verified in polynomial time given a certificate
  2. BProblems that cannot be solved in polynomial time
  3. CProblems that no algorithm can solve
  4. DProblems that are not polynomial
3.Data structuresMedium

How does extract-min work in a binary min-heap?

  1. ASearch all leaves for the new minimum
  2. BMove the last element to the root and sift it down
  3. CRemove the last element of the array
  4. DRemove the root and shift all elements one place left
4.Data structuresHard

A dynamic array doubles when full. Why do many implementations shrink it only when it is one quarter full, not half full?

  1. ATo keep the array sorted
  2. BBecause halving at one half would lose elements
  3. CBecause the memory allocator can only release memory in quarters of a block
  4. DTo avoid repeated resizing when pushes and pops alternate near the boundary
5.Graph theoryMedium

A connected graph has 17 vertices and 24 edges. How many edges k must be removed to leave a spanning tree?

|V| = 17|E| = 24
k =
6.Graph theoryHard
56111107152ABCDEFG

Dijkstra’s algorithm runs from A. Click the vertex that is settled (made permanent) in round 4; A itself is round 1.

start: Around 4
  1. 1A
  2. 2B
  3. 3C
  4. 4D
  5. 5E
  6. 6F
  7. 7G

3Solutions

1.Algorithms & complexity

Answer: D · It grows one tree from a start vertex, adding the cheapest edge that leaves the tree

Why this is the answer

Prim's algorithm, with a priority queue of crossing edges, runs in O(E log V) with a binary heap.

Answer

D · It grows one tree from a start vertex, adding the cheapest edge that leaves the tree
2.Algorithms & complexity

Answer: A · Decision problems whose yes-answers can be verified in polynomial time given a certificate

Why this is the answer

For an NP problem, a proposed solution (certificate) can be checked quickly, for example verifying a given assignment satisfies a Boolean formula.

Answer

A · Decision problems whose yes-answers can be verified in polynomial time given a certificate
3.Data structures

Answer: B · Move the last element to the root and sift it down

Why this is the answer

The last element fills the hole at the root and is swapped with its smaller child until the heap property holds, taking O(log n).

Answer

B · Move the last element to the root and sift it down
4.Data structures

Answer: D · To avoid repeated resizing when pushes and pops alternate near the boundary

Why this is the answer

Shrinking at one half could trigger a resize on every operation in such a sequence; the gap between 1/4 and full keeps the amortised cost O(1).

Answer

D · To avoid repeated resizing when pushes and pops alternate near the boundary
5.Graph theory

Answer: k = 8

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.

Edges of a spanning tree

17 − 1 = 16

Edges to remove

k = 24 − 16 = 8

Answer

k = 8
6.Graph theory

Answer: C

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

1. A (0): B: 5
2. B (5): G: 12
3. G (12): C: 13, D: 17, E: 14
4. C (13)
5. E (14): F: 24
6. D (17): F: 18
7. F (18)

round 4

C

Answer

C

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