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 does the recurrence T(n) = T(n − 1) + O(1) solve to?

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

The halting problem shows that:

  1. ASome programs run faster on faster computers, so halting depends on hardware
  2. BEvery program eventually halts
  3. CLoops should be avoided
  4. DNo algorithm can decide for every program and input whether it halts
3.Data structuresMedium

Why is traversing an array often much faster in practice than traversing a linked list of the same length?

  1. ALinked lists always store elements on disk
  2. BArray elements are contiguous, so they make good use of the CPU cache
  3. CArray traversal is O(1) in total, while linked list traversal is O(n)
  4. DArrays use fewer instructions to compare values
4.Data structuresHard

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

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

A connected graph has 13 vertices and 24 edges. How many edges k must be removed to leave a spanning tree?

|V| = 13|E| = 24
k =
6.Graph theoryHard
31110612914111528ABCDEFG

Use Dijkstra’s algorithm to find the length d(F) of the shortest path from A to F in the weighted graph.

start: Aend: F
d(F) =

3Solutions

1.Algorithms & complexity

Answer: A · O(n)

Why this is the answer

There are n levels with constant work each, as in a recursive sum of an array.

Answer

A · O(n)
2.Algorithms & complexity

Answer: D · No algorithm can decide for every program and input whether it halts

Why this is the answer

Turing showed the halting problem is undecidable: assuming a decider exists leads to a contradiction with a program that does the opposite.

Answer

D · No algorithm can decide for every program and input whether it halts
3.Data structures

Answer: B · Array elements are contiguous, so they make good use of the CPU cache

Why this is the answer

Contiguous memory gives good locality of reference, while linked nodes may be scattered and cause many cache misses.

Answer

B · Array elements are contiguous, so they make good use of the CPU cache
4.Data structures

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

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

Answer: k = 12

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.

Edges of a spanning tree

13 − 1 = 12

Edges to remove

k = 24 − 12 = 12

Answer

k = 12
6.Graph theory

Answer: d(F) = 23

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.

Dijkstra round by round

Each line: the vertex settled, its final distance, and the neighbours whose distance improves.

A (0): C: 3
C (3): B: 14, E: 9, G: 18
E (9): D: 21, F: 23, G: 17
B (14)
G (17): D: 19
D (19)
F (23)

Shortest path

A → C → E → F
d(F) = 23

Answer

d(F) = 23

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