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 time complexity of naive recursive Fibonacci (fib(n) = fib(n−1) + fib(n−2)) is:

  1. AConstant
  2. BExponential
  3. CLinear
  4. DLogarithmic
2.Algorithms & complexityHard

Which definition of the class NP is correct?

  1. ADecision problems whose yes-answers can be verified in polynomial time given a certificate
  2. BProblems that no algorithm can solve
  3. CProblems that are not polynomial
  4. DProblems that cannot be solved in polynomial time
3.Data structuresMedium

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

  1. AEach row has exactly one 1
  2. BIt is always upper triangular
  3. CIt is symmetric about the main diagonal
  4. DIts main diagonal always contains ones
4.Data structuresHard

An AVL node is unbalanced because its left child's right subtree became too tall (left-right case). Which fix is applied?

  1. AA single left rotation at the node
  2. BA single right rotation at the node
  3. CA right rotation at the left child, then a left rotation at the node
  4. DA left rotation at the left child, then a right rotation at the node
5.Graph theoryMedium
ABCDEFGEuler 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| = 7|E| = 9
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
3141321814207910ABCDEFG

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

start: Ck = 3
  1. 1edge AB
  2. 2edge AC
  3. 3edge BC
  4. 4edge BD
  5. 5edge CE
  6. 6edge DF
  7. 7edge EF
  8. 8edge GB
  9. 9edge GC
  10. 10edge GD
  11. 11edge GE

3Solutions

1.Algorithms & complexity

Answer: B · Exponential

Why this is the answer

The call tree grows roughly like φⁿ (about 1.618ⁿ). Memoisation reduces it to O(n).

Answer

B · Exponential
2.Algorithms & complexity

Answer: A · Decision problems whose yes-answers can be verified in polynomial time given a certificate

Why this is the answer

For an NP problem, a proposed solution (certificate) can be checked quickly, for example verifying a given assignment satisfies a Boolean formula.

Answer

A · Decision problems whose yes-answers can be verified in polynomial time given a certificate
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: D · A left rotation at the left child, then a right rotation at the node

Why this is the answer

The first rotation converts the left-right case into a left-left case, which a right rotation at the unbalanced node then fixes.

Answer

D · A left rotation at the left child, then a right rotation at the node
5.Graph theory

Answer: Euler path, no 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) = 4, deg(D) = 2, deg(E) = 3, deg(F) = 1, deg(G) = 2

Odd vertices

E, F → 2
Euler path, no circuit

Answer

Euler path, no circuit

The Euler path starts at one odd vertex and ends at the other.

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. AC (1)
2. CE (2)
3. AB (3)
4. GC (7)
5. GD (9)
6. EF (14)

edge number 3

AB

Answer

edge AB

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