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

Which sorting algorithm is stable?

  1. ASelection sort (typical version)
  2. BQuicksort (typical in-place version)
  3. CMerge sort
  4. DHeap sort
2.Algorithms & complexityHard

Why can Dijkstra's algorithm give wrong results when some edge weights are negative?

  1. AIt goes into an infinite loop on every negative edge
  2. BNegative numbers cannot be stored in a priority queue
  3. CA vertex is finalised when extracted, but a later negative edge could still give it a shorter path
  4. DIt only works on undirected graphs
3.Data structuresMedium

A trie (prefix tree) is especially efficient for:

  1. ASorting numbers
  2. BStoring matrices
  3. CPrefix searches such as autocomplete
  4. DFinding shortest paths
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. BTo keep the array sorted
  3. CBecause halving at one half would lose elements
  4. DBecause the memory allocator can only release memory in quarters of a block
5.Graph theoryMedium

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

K8
H =
6.Graph theoryHard
17182491311ABCDE

Prim’s algorithm builds a minimum spanning tree starting from vertex E. Click the edge it adds as edge number 2.

start: Ek = 2
  1. 1edge AB
  2. 2edge AC
  3. 3edge BC
  4. 4edge BD
  5. 5edge CE
  6. 6edge DE
  7. 7edge BE

3Solutions

1.Algorithms & complexity

Answer: C · Merge sort

Why this is the answer

Merge sort is stable when merging takes from the left half first on ties. In-place quicksort, heap sort and selection sort are usually not stable.

Answer

C · Merge sort
2.Algorithms & complexity

Answer: C · A vertex is finalised when extracted, but a later negative edge could still give it a shorter path

Why this is the answer

The greedy step relies on non-negative weights so that extracted distances are final; Bellman–Ford is used when weights may be negative.

Answer

C · A vertex is finalised when extracted, but a later negative edge could still give it a shorter path
3.Data structures

Answer: C · Prefix searches such as autocomplete

Why this is the answer

Tries store strings by characters along paths, so lookups and prefix queries take time proportional to the key length.

Answer

C · Prefix searches such as autocomplete
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: H = 2520

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 = (8 − 1)!/2 = 5040/2 = 2520

Answer

H = 2520
6.Graph theory

Answer: edge BC

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.

Prim’s algorithm

1. CE (9)
2. BC (2)
3. BD (4)
4. AB (17)

edge number 2

BC

Answer

edge BC

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