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

What is the running time of LSD radix sort on n integers with d digits in base k?

  1. AO(n log n)
  2. BO(n²)
  3. CO(dn log k)
  4. DO(d(n + k))
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. BA vertex is finalised when extracted, but a later negative edge could still give it a shorter path
  3. CNegative numbers cannot be stored in a priority queue
  4. DIt only works on undirected graphs
3.Data structuresMedium

What is the value of the postfix expression 3 4 + 2 * ?

  1. A14
  2. B10
  3. C11
  4. D24
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 left rotation at the child, then a right rotation at the node
  2. BA single left rotation at the unbalanced node
  3. CA single right rotation at the unbalanced node
  4. DRecolouring the node and its child
5.Graph theoryMedium

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

K7
H =
6.Graph theoryHard
79208126144ABCDEF

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

|V| = 6|E| = 8
W =

3Solutions

1.Algorithms & complexity

Answer: D · O(d(n + k))

Why this is the answer

Each of the d passes is a counting sort costing O(n + k), so for fixed d and k the total is linear in n.

Answer

D · O(d(n + k))
2.Algorithms & complexity

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

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

Answer: A · 14

Why this is the answer

Push 3 and 4, + gives 7; push 2, * gives 7 × 2 = 14.

Answer

A · 14
4.Data structures

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

C · A single right rotation at the unbalanced node
5.Graph theory

Answer: H = 360

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 = (7 − 1)!/2 = 720/2 = 360

Answer

H = 360
6.Graph theory

Answer: W = 40

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

BE (4): take
DE (6): take
AB (7): take
BD (8): skip, closes a cycle
AC (9): take
CE (12): skip, closes a cycle
EF (14): take

Total weight

W = 4 + 6 + 7 + 9 + 14 = 40

Answer

W = 40

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