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

Quicksort always uses the first element as pivot. On which input does it show its worst-case behaviour?

  1. AAn array whose elements are all different
  2. BAn array that is already sorted
  3. CAn array in random order
  4. DAn array of length 2
2.Algorithms & complexityHard

Why does binary search not give O(log n) time on a singly linked list?

  1. AReaching the middle element takes O(n) steps, since there is no direct index access
  2. BLinked lists cannot be sorted
  3. CComparisons on linked list nodes are slower
  4. DBinary search needs at least twice the memory
3.Data structuresMedium

Which data structure is used to check whether the brackets in "{[()]}" are balanced?

  1. AA hash table
  2. BA binary search tree
  3. CA queue
  4. DA stack
4.Data structuresHard

The time complexity of decrease-key in a binary heap (given the element's position) is:

  1. AO(n log n)
  2. BO(1)
  3. CO(n)
  4. DO(log n)
5.Graph theoryMedium
ABCDEEuler 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| = 5|E| = 5
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
417114131639207ABCDEFG

Find the total weight W of a minimum spanning tree of the weighted graph.

|V| = 7|E| = 10
W =

3Solutions

1.Algorithms & complexity

Answer: B · An array that is already sorted

Why this is the answer

On sorted input the pivot is always the minimum, so one side is empty and the other has n − 1 elements, giving O(n²).

Answer

B · An array that is already sorted
2.Algorithms & complexity

Answer: A · Reaching the middle element takes O(n) steps, since there is no direct index access

Why this is the answer

Binary search needs O(1) access to the middle; on a linked list walking there costs linear time, so the total is O(n).

Answer

A · Reaching the middle element takes O(n) steps, since there is no direct index access
3.Data structures

Answer: D · A stack

Why this is the answer

Push each opening bracket and pop when a closing bracket appears; it must match the popped bracket and the stack must be empty at the end.

Answer

D · A stack
4.Data structures

Answer: D · O(log n)

Why this is the answer

After decreasing the key, the element sifts up at most the height of the heap. Fibonacci heaps achieve O(1) amortised decrease-key.

Answer

D · O(log n)
5.Graph theory

Answer: Euler path, no circuit

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) = 2, deg(B) = 2, deg(C) = 2, deg(D) = 1, deg(E) = 3

Odd vertices

D, E → 2
Euler path, no circuit

Answer

Euler path, no circuit

The Euler path starts at one odd vertex and ends at the other.

6.Graph theory

Answer: W = 38

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

BD (1): take
EF (3): take
AC (4): take
GE (7): take
GB (9): take
DE (13): skip, closes a cycle
CE (14): take

Total weight

W = 1 + 3 + 4 + 7 + 9 + 14 = 38

Answer

W = 38

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