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

The lower bound for comparison-based sorting in the worst case is:

  1. AΩ(n²)
  2. BΩ(log n)
  3. CΩ(n log n)
  4. DΩ(n)
2.Algorithms & complexityHard

Why is the average lookup in a hash table O(1) but the worst case O(n)?

  1. AArrays have O(n) access
  2. BKeys must be sorted first
  3. CMany keys may collide into the same bucket
  4. DHash functions are slow
3.Data structuresMedium

You have a reference to a node in the middle of a list. In which list can you remove it in O(1)?

  1. AA doubly linked list
  2. BA singly linked list
  3. CA sorted array
  4. DA dynamic array
4.Data structuresHard

Which property must a red-black tree satisfy?

  1. AEvery node must be red
  2. BThe root must be red
  3. CEvery red node must have red children, so red nodes always form unbroken chains to the leaves
  4. DEvery path from a node to its descendant leaves has the same number of black nodes
5.Graph theoryMedium

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

3 × deg 43 × deg 53 × deg 2
L =
6.Graph theoryHard
19117912101872ABCDEF

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

k = 5
  1. 1edge AB
  2. 2edge AC
  3. 3edge BC
  4. 4edge BD
  5. 5edge CE
  6. 6edge DE
  7. 7edge DF
  8. 8edge EF
  9. 9edge BE

3Solutions

1.Algorithms & complexity

Answer: C · Ω(n log n)

Why this is the answer

Any comparison sort needs at least log₂(n!) ≈ n log n comparisons in the worst case. Counting sort beats it because it does not compare.

Answer

C · Ω(n log n)
2.Algorithms & complexity

Answer: C · Many keys may collide into the same bucket

Why this is the answer

With a good hash function and load factor, buckets stay short on average; adversarial or poor hashing can put all keys in one bucket.

Answer

C · Many keys may collide into the same bucket
3.Data structures

Answer: A · A doubly linked list

Why this is the answer

A doubly linked node knows its predecessor, so you can relink prev and next directly; a singly linked list must search for the predecessor.

Answer

A · A doubly linked list
4.Data structures

Answer: D · Every path from a node to its descendant leaves has the same number of black nodes

Why this is the answer

Red-black rules: nodes are red or black, root is black, red nodes have black children, and all paths have equal black-height, keeping height ≤ 2 log₂(n + 1).

Answer

D · Every path from a node to its descendant leaves has the same number of black nodes
5.Graph theory

Answer: L = 17

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 + 33 = 2(L + 9) − 2
L = 17

Answer

L = 17

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. AC (1)
2. BE (2)
3. EF (7)
4. BD (9)
5. CE (12)

edge number 5

CE

Answer

edge CE

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