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 is the time complexity of the standard dynamic programming algorithm for the longest common subsequence of strings of lengths m and n?

  1. AO(2m+n)
  2. BO(mn log n)
  3. CO(mn)
  4. DO(m + n)
2.Algorithms & complexityHard

Which definition of the class P is correct?

  1. AProblems that need exponential time on every computer
  2. BDecision problems solvable by a deterministic algorithm in polynomial time
  3. CProblems whose solutions can be checked but never found in polynomial time
  4. DProblems that can be solved in parallel
3.Data structuresMedium

What is the value of the postfix expression 3 4 + 2 * ?

  1. A14
  2. B24
  3. C10
  4. D11
4.Data structuresHard

What is the main advantage of a skip list over a sorted linked list?

  1. AIt stores keys without order
  2. BExpected O(log n) search by using several levels of forward pointers
  3. CGuaranteed O(1) search because every node stores a pointer to every other node
  4. DIt uses no extra memory
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
915416871053ABCDEFG

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

|V| = 7|E| = 9
W =

3Solutions

1.Algorithms & complexity

Answer: C · O(mn)

Why this is the answer

The table has (m + 1)(n + 1) cells and each is computed in O(1) from its neighbours.

Answer

C · O(mn)
2.Algorithms & complexity

Answer: B · Decision problems solvable by a deterministic algorithm in polynomial time

Why this is the answer

P contains decision problems with a deterministic polynomial-time algorithm, such as checking whether a graph is connected.

Answer

B · Decision problems solvable by a deterministic algorithm in polynomial time
3.Data structures

Answer: A · 14

Why this is the answer

Push 3 and 4, + gives 7; push 2, * gives 7 × 2 = 14.

Answer

A · 14
4.Data structures

Answer: B · Expected O(log n) search by using several levels of forward pointers

Why this is the answer

Randomised levels allow searches to skip many nodes, giving expected O(log n) search, insert and delete.

Answer

B · Expected O(log n) search by using several levels of forward pointers
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: W = 43

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

GE (3): take
CE (4): take
GD (5): take
EF (7): take
DF (8): skip, closes a cycle
AB (9): take
GC (10): skip, closes a cycle
BC (15): take

Total weight

W = 3 + 4 + 5 + 7 + 9 + 15 = 43

Answer

W = 43

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