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 many levels does the recursion of merge sort have for an array of n elements?

  1. AAbout log₂ n
  2. BAbout n / 2
  3. CAbout √n
  4. DAbout n
2.Algorithms & complexityHard

What is the difference between an undecidable problem and an intractable one?

  1. AIntractable problems cannot be solved by any algorithm, while undecidable ones only need exponential time
  2. BAn undecidable problem has no algorithm for all inputs; an intractable one has one, but it is too slow
  3. CBoth mean the problem has no algorithm at all
  4. DUndecidable problems are in NP, while intractable problems are in P
3.Data structuresMedium

What is the time complexity of searching for a key in a balanced binary search tree?

  1. AO(log n)
  2. BO(1)
  3. CO(n)
  4. DO(n log n)
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 avoid repeated resizing when pushes and pops alternate near the boundary
  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 keep the array sorted
5.Graph theoryMedium
ABCDEFEuler 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| = 6|E| = 7
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
412611155131312ABCDEF

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

3Solutions

1.Algorithms & complexity

Answer: A · About log₂ n

Why this is the answer

Halving from n down to 1 takes about log₂ n levels, and each level does O(n) merging work, giving O(n log n).

Answer

A · About log₂ n
2.Algorithms & complexity

Answer: B · An undecidable problem has no algorithm for all inputs; an intractable one has one, but it is too slow

Why this is the answer

The halting problem has no algorithm at all; an NP-hard problem such as TSP can be solved by brute force, just not in known polynomial time.

Answer

B · An undecidable problem has no algorithm for all inputs; an intractable one has one, but it is too slow
3.Data structures

Answer: A · O(log n)

Why this is the answer

A balanced tree has height about log₂ n, so a search follows one path from root to leaf.

Answer

A · O(log n)
4.Data structures

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

A · To avoid repeated resizing when pushes and pops alternate near the boundary
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) = 4, deg(C) = 1, deg(D) = 3, deg(E) = 3, deg(F) = 2

Odd vertices

A, C, D, E → 4
neither

Answer

neither
6.Graph theory

Answer: D

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: 4, C: 12
2. B (4): C: 10, D: 15, E: 16
3. C (10)
4. D (15): F: 28
5. E (16)
6. F (28)

round 4

D

Answer

D

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