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

Why is the base of a logarithm usually left out in Big O, as in O(log n)?

  1. AAll logarithms in computer science have base 10, so it is implied
  2. BThe base only matters for small n
  3. CLogarithms are always rounded to integers
  4. DLogarithms with different bases differ only by a constant factor
2.Algorithms & complexityHard

How does the Bellman–Ford algorithm detect a negative-weight cycle reachable from the source?

  1. AIt runs Dijkstra's algorithm twice and compares the two distance results
  2. BIt counts the cycles with depth-first search
  3. CIt checks whether any edge has a negative weight
  4. DAfter V − 1 rounds, it checks whether any edge can still be relaxed
3.Data structuresMedium

Which collision resolution method stores colliding keys in a list at the same bucket?

  1. ASeparate chaining
  2. BLinear probing
  3. CQuadratic probing
  4. DDouble hashing
4.Data structuresHard

What does a splay tree do after each access?

  1. ARebuilds the whole tree in balanced form
  2. BRecolours the nodes on the search path
  3. CMoves the accessed node to a leaf
  4. DRotates the accessed node up to the root
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| = 6
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
9341212315ABCDEF

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: D · Logarithms with different bases differ only by a constant factor

Why this is the answer

Changing the base multiplies the logarithm by a constant, and Big O ignores constant factors.

Answer

D · Logarithms with different bases differ only by a constant factor
2.Algorithms & complexity

Answer: D · After V − 1 rounds, it checks whether any edge can still be relaxed

Why this is the answer

All true shortest distances are found within V − 1 rounds; if an edge can still be improved, a negative cycle must exist.

Answer

D · After V − 1 rounds, it checks whether any edge can still be relaxed
3.Data structures

Answer: A · Separate chaining

Why this is the answer

Chaining keeps a linked list (or other structure) per bucket; open addressing looks for another free slot in the table itself.

Answer

A · Separate chaining
4.Data structures

Answer: D · Rotates the accessed node up to the root

Why this is the answer

Splaying moves the accessed node to the root through rotations; a single operation can cost O(n), but the amortised cost is O(log n).

Answer

D · Rotates the accessed node up to the root
5.Graph theory

Answer: Euler 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) = 2, deg(B) = 4, deg(C) = 2, deg(D) = 2, deg(E) = 2

Odd vertices

0
Euler circuit

Answer

Euler circuit
6.Graph theory

Answer: d(F) = 9

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): B: 9, C: 3
C (3): B: 7, E: 4
E (4): D: 6
D (6): F: 9
B (7)
F (9)

Shortest path

A → C → E → D → F
d(F) = 9

Answer

d(F) = 9

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