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

Why do many library sorting routines switch to insertion sort for very small subarrays?

  1. AInsertion sort is O(n log n) in the worst case
  2. BInsertion sort has little overhead and is fast on small or nearly sorted inputs
  3. CInsertion sort uses less memory than any other sorting algorithm on large inputs
  4. DRecursive algorithms cannot handle arrays below 10 elements
2.Algorithms & complexityHard

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

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

Which abstract data type does Dijkstra's algorithm use to choose the next vertex to process?

  1. AA min-priority queue
  2. BA FIFO queue
  3. CA set with no ordering
  4. DA stack
4.Data structuresHard

Inserting a key into an AVL tree makes a node's left subtree too tall, and the new key went into the left subtree of its left child (left-left case). Which fix is applied?

  1. AA single left rotation at the unbalanced node
  2. BA left rotation at the child, then a right rotation at the node
  3. CRecolouring the node and its child
  4. DA single right rotation at the unbalanced node
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
6209181211371916ABCDEFG

Kruskal’s algorithm builds a minimum spanning tree. Click the edge it adds as edge number 3; skipped edges do not count.

k = 3
  1. 1edge AC
  2. 2edge BC
  3. 3edge CE
  4. 4edge DE
  5. 5edge DF
  6. 6edge EF
  7. 7edge GB
  8. 8edge GC
  9. 9edge GD
  10. 10edge GE

3Solutions

1.Algorithms & complexity

Answer: B · Insertion sort has little overhead and is fast on small or nearly sorted inputs

Why this is the answer

For small n the simple loop of insertion sort beats the recursion overhead of quicksort or merge sort, even though it is O(n²).

Answer

B · Insertion sort has little overhead and is fast on small or nearly sorted inputs
2.Algorithms & complexity

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

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

Answer: A · A min-priority queue

Why this is the answer

A min-priority queue, usually a binary heap, returns the unvisited vertex with the smallest distance efficiently.

Answer

A · A min-priority queue
4.Data structures

Answer: D · A single right rotation at the unbalanced node

Why this is the answer

In the left-left case one right rotation lifts the left child up and restores balance; zig-zag cases need a double rotation.

Answer

D · A single right rotation at the unbalanced node
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) = 3, deg(C) = 3, deg(D) = 2, deg(E) = 3, deg(F) = 2

Odd vertices

A, B, C, E → 4
neither

Answer

neither
6.Graph theory

Answer: edge GC

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

1. EF (1)
2. AC (6)
3. GC (7)
4. CE (9)
5. DF (12)
6. GB (13)

edge number 3

GC

Answer

edge GC

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