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. ALogarithms are always rounded to integers
  2. BAll logarithms in computer science have base 10, so it is implied
  3. CLogarithms with different bases differ only by a constant factor
  4. DThe base only matters for small n
2.Algorithms & complexityHard

Why can Dijkstra's algorithm give wrong results when some edge weights are negative?

  1. AA vertex is finalised when extracted, but a later negative edge could still give it a shorter path
  2. BIt only works on undirected graphs
  3. CNegative numbers cannot be stored in a priority queue
  4. DIt goes into an infinite loop on every negative edge
3.Data structuresMedium

What is true of the adjacency matrix of an undirected graph?

  1. AIts main diagonal always contains ones
  2. BEach row has exactly one 1
  3. CIt is symmetric about the main diagonal
  4. DIt is always upper triangular
4.Data structuresHard

The time complexity of decrease-key in a binary heap (given the element's position) is:

  1. AO(n log n)
  2. BO(n)
  3. CO(log n)
  4. DO(1)
5.Graph theoryMedium

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

|V| = 7|E| = 10
k =
6.Graph theoryHard
3201521316118796ABCDEFG

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

|V| = 7|E| = 11
W =

3Solutions

1.Algorithms & complexity

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

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

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

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

Answer: C · It is symmetric about the main diagonal

Why this is the answer

In an undirected graph edge {u, v} means both M[u][v] and M[v][u] are set, so the matrix equals its transpose.

Answer

C · It is symmetric about the main diagonal
4.Data structures

Answer: C · O(log n)

Why this is the answer

After decreasing the key, the element sifts up at most the height of the heap. Fibonacci heaps achieve O(1) amortised decrease-key.

Answer

C · O(log n)
5.Graph theory

Answer: k = 4

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

7 − 1 = 6

Edges to remove

k = 10 − 6 = 4

Answer

k = 4
6.Graph theory

Answer: W = 32

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

DF (1): take
BD (2): take
AB (3): take
GE (6): take
GB (7): take
GD (9): skip, closes a cycle
CE (13): take

Total weight

W = 1 + 2 + 3 + 6 + 7 + 13 = 32

Answer

W = 32

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