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 in random order
  2. BAn array whose elements are all different
  3. CAn array of length 2
  4. DAn array that is already sorted
2.Algorithms & complexityHard

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

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

How do you find the minimum key in a binary search tree?

  1. AFollow right children from the root until there is no right child
  2. BFollow left children from the root until there is no left child
  3. CLook at the root only
  4. DVisit every leaf and compare them
4.Data structuresHard

In a hash table using open addressing, why is deletion often done with a "tombstone" marker?

  1. AIt makes the table sorted
  2. BEmptying the slot could break the probe sequence for other keys
  3. CDeleted keys must be kept forever for security, so slots can never be reused
  4. DTombstones speed up hashing
5.Graph theoryMedium

A tree has 2 vertices of degree 3, 4 vertices of degree 4, 4 vertices of degree 5, 2 vertices of degree 2, and all its other vertices are leaves (degree 1). How many leaves L does it have?

2 × deg 34 × deg 44 × deg 52 × deg 2
L =
6.Graph theoryHard
181912149152ABCDE

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

k = 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: D · 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

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

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

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

Answer: B · Follow left children from the root until there is no left child

Why this is the answer

The leftmost node has no smaller key in the tree, so it is the minimum; the cost is proportional to the height.

Answer

B · Follow left children from the root until there is no left child
4.Data structures

Answer: B · Emptying the slot could break the probe sequence for other keys

Why this is the answer

If a deleted slot became empty, later searches might stop early and miss keys that were placed further along the probe chain.

Answer

B · Emptying the slot could break the probe sequence for other keys
5.Graph theory

Answer: L = 24

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.

Handshake lemma for a tree

L + 46 = 2(L + 12) − 2
L = 24

Answer

L = 24

Shortcut: L = 2 + Σ (d − 2) over the vertices with degree d ≥ 3.

6.Graph theory

Answer: edge CE

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. BE (2)
2. CE (9)
3. BD (14)
4. AB (18)

edge number 2

CE

Answer

edge CE

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