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

How much stack space does a simple recursive factorial function fact(n) = n × fact(n − 1) use?

  1. AO(n²)
  2. BO(1)
  3. CO(log n)
  4. DO(n)
2.Algorithms & complexityHard

How do n! and 2ⁿ compare for large n?

  1. A2ⁿ grows faster than n!
  2. BThey grow at the same rate
  3. Cn! grows faster than 2ⁿ
  4. Dn! is O(n²)
3.Data structuresMedium

A binary tree has root 1 with left child 2 and right child 3; node 2 has children 4 (left) and 5 (right). What is the preorder traversal?

  1. A4 5 2 3 1
  2. B4 2 5 1 3
  3. C1 2 3 4 5
  4. D1 2 4 5 3
4.Data structuresHard

Why might a server choose its hash function at random from a universal family?

  1. ATo remove the need to resize the table
  2. BTo guarantee that no two keys can ever collide, whatever keys an attacker sends
  3. CTo make the hash table sorted
  4. DTo make it very unlikely that an attacker can pick many keys that all collide
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
23161419104159ABCDEFG

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

|V| = 7|E| = 9
W =

3Solutions

1.Algorithms & complexity

Answer: D · O(n)

Why this is the answer

The recursion is n calls deep before any returns, and each call needs a stack frame, so it uses O(n) space.

Answer

D · O(n)
2.Algorithms & complexity

Answer: C · n! grows faster than 2ⁿ

Why this is the answer

For n ≥ 4, n! exceeds 2ⁿ, and the ratio grows without bound because each extra factor of n! is larger than 2.

Answer

C · n! grows faster than 2ⁿ
3.Data structures

Answer: D · 1 2 4 5 3

Why this is the answer

Preorder visits 1, then its left subtree (2, 4, 5), then 3; the other options are inorder, postorder and level-order.

Answer

D · 1 2 4 5 3
4.Data structures

Answer: D · To make it very unlikely that an attacker can pick many keys that all collide

Why this is the answer

With universal hashing the expected number of collisions is small for any set of keys, since the attacker does not know which function was chosen.

Answer

D · To make it very unlikely that an attacker can pick many keys that all collide
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) = 1, deg(B) = 3, deg(C) = 2, deg(D) = 2, deg(E) = 2

Odd vertices

A, B → 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 = 51

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

AB (2): take
BC (3): take
GC (4): take
GE (9): take
GB (10): skip, closes a cycle
DE (14): take
GD (15): skip, closes a cycle
BD (16): skip, closes a cycle
EF (19): take

Total weight

W = 2 + 3 + 4 + 9 + 14 + 19 = 51

Answer

W = 51

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