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 does Prim's algorithm build a minimum spanning tree?

  1. AIt runs breadth-first search and keeps the BFS tree
  2. BIt sorts all edges by weight and adds each one unless it would form a cycle in the forest
  3. CIt grows one tree from a start vertex, adding the cheapest edge that leaves the tree
  4. DIt removes the most expensive edge until no cycles remain
2.Algorithms & complexityHard

Which algorithm finds a minimum spanning tree by repeatedly adding the cheapest edge that does not form a cycle?

  1. AKruskal's algorithm
  2. BFloyd–Warshall
  3. CDijkstra's algorithm
  4. DPrim's algorithm starting from one node
3.Data structuresMedium

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

  1. AIt is symmetric about the main diagonal
  2. BIts main diagonal always contains ones
  3. CIt is always upper triangular
  4. DEach row has exactly one 1
4.Data structuresHard

What guarantee do the red-black tree rules give about the height of a tree with n keys?

  1. AThe height is at most 2 log2(n + 1)
  2. BThe height is exactly log2 n
  3. CThe height is at most n / 2
  4. DThe height is at most log2 n + 1
5.Graph theoryMedium

How many different Hamilton circuits H does the complete graph K4 have? Circuits that differ only in the starting vertex or the direction count as the same.

K4
H =
6.Graph theoryHard
61673492ABCDE

Prim’s algorithm builds a minimum spanning tree starting from vertex C. Click the edge it adds as edge number 4.

start: Ck = 4
  1. 1edge AB
  2. 2edge AC
  3. 3edge BC
  4. 4edge BD
  5. 5edge CE
  6. 6edge DE
  7. 7edge BE

3Solutions

1.Algorithms & complexity

Answer: C · It grows one tree from a start vertex, adding the cheapest edge that leaves the tree

Why this is the answer

Prim's algorithm, with a priority queue of crossing edges, runs in O(E log V) with a binary heap.

Answer

C · It grows one tree from a start vertex, adding the cheapest edge that leaves the tree
2.Algorithms & complexity

Answer: A · Kruskal's algorithm

Why this is the answer

Kruskal sorts edges by weight and adds them if they connect different components; Prim grows one tree from a start vertex.

Answer

A · Kruskal's algorithm
3.Data structures

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

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

Answer: A · The height is at most 2 log2(n + 1)

Why this is the answer

Every path has the same number of black nodes and red nodes cannot be adjacent, so the longest path is at most twice the shortest, giving height O(log n).

Answer

A · The height is at most 2 log2(n + 1)
5.Graph theory

Answer: H = 3

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.

Count

H = (4 − 1)!/2 = 6/2 = 3

Answer

H = 3
6.Graph theory

Answer: edge AB

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.

Prim’s algorithm

1. CE (4)
2. BE (2)
3. BD (3)
4. AB (6)

edge number 4

AB

Answer

edge AB

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