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 does it mean that a problem has optimal substructure?

  1. AThe problem can be solved in constant time
  2. BAn optimal solution can be built from optimal solutions of its subproblems
  3. CThe problem has exactly one optimal solution, which every subproblem shares
  4. DEvery subproblem has the same size
2.Algorithms & complexityHard

Shortest simple paths can be found in polynomial time. What is known about finding the longest simple path between two vertices in a general graph?

  1. AIt is undecidable
  2. BIt can be solved by Dijkstra's algorithm with negated weights
  3. CIt is NP-hard
  4. DIt is always solvable in O(V + E)
3.Data structuresMedium

In a hash table using open addressing, what is the maximum possible load factor?

  1. A2
  2. BThere is no maximum
  3. C0.5
  4. D1
4.Data structuresHard

The union-find (disjoint set) structure with union by rank and path compression has an amortised cost per operation of:

  1. AO(n²)
  2. BO(log n) exactly
  3. CO(α(n)), the inverse Ackermann function, which is practically constant
  4. DO(n)
5.Graph theoryMedium

A tree has 2 vertices of degree 4, 2 vertices of degree 5, and all its other vertices are leaves (degree 1). How many leaves L does it have?

2 × deg 42 × deg 5
L =
6.Graph theoryHard
820119141012ABCDE

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

start: Bk = 3
  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: B · An optimal solution can be built from optimal solutions of its subproblems

Why this is the answer

Optimal substructure is required for both greedy algorithms and dynamic programming to produce correct answers.

Answer

B · An optimal solution can be built from optimal solutions of its subproblems
2.Algorithms & complexity

Answer: C · It is NP-hard

Why this is the answer

A longest simple path of length V − 1 is a Hamiltonian path, an NP-complete problem; on directed acyclic graphs, however, it is solvable in linear time.

Answer

C · It is NP-hard
3.Data structures

Answer: D · 1

Why this is the answer

With open addressing all keys are stored in the table itself, so n cannot exceed m; separate chaining can have a load factor above 1.

Answer

D · 1
4.Data structures

Answer: C · O(α(n)), the inverse Ackermann function, which is practically constant

Why this is the answer

With both optimisations, operations take O(α(n)) amortised time; α(n) ≤ 4 for any realistic n.

Answer

C · O(α(n)), the inverse Ackermann function, which is practically constant
5.Graph theory

Answer: L = 12

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.

Handshake lemma for a tree

L + 18 = 2(L + 4) − 2
L = 12

Answer

L = 12

Shortcut: L = 2 + Σ (d − 2) over the vertices with degree d ≥ 3.

6.Graph theory

Answer: edge BE

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. BC (1)
2. AB (8)
3. BE (12)
4. DE (10)

edge number 3

BE

Answer

edge BE

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