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. CEvery subproblem has the same size
  4. DThe problem has exactly one optimal solution, which every subproblem shares
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 can be solved by Dijkstra's algorithm with negated weights
  2. BIt is undecidable
  3. CIt is NP-hard
  4. DIt is always solvable in O(V + E)
3.Data structuresMedium

In a circular queue stored in an array of capacity n, how is the next position after index i computed?

  1. A(i − 1) mod n
  2. B2i + 1
  3. Ci + 1
  4. D(i + 1) mod n
4.Data structuresHard

Why can elements not simply be deleted from a standard Bloom filter by clearing their bits?

  1. ABloom filters store the full elements, and these cannot be located again once hashed
  2. BDeleting would increase the false positive rate to 100%
  3. CThose bits may also belong to other elements, which would cause false negatives
  4. DBits in a Bloom filter cannot be changed after creation
5.Graph theoryMedium
ABCDEFEuler 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| = 6|E| = 8
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
174161012113ABCDE

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

|V| = 5|E| = 7
W =

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 · (i + 1) mod n

Why this is the answer

The modulo operation wraps index n − 1 back to 0, so the array is reused without shifting elements.

Answer

D · (i + 1) mod n
4.Data structures

Answer: C · Those bits may also belong to other elements, which would cause false negatives

Why this is the answer

Clearing a shared bit would make another element look absent; counting Bloom filters keep counters instead of bits to allow deletion.

Answer

C · Those bits may also belong to other elements, which would cause false negatives
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) = 3, deg(C) = 3, deg(D) = 2, deg(E) = 4, deg(F) = 2

Odd vertices

B, C → 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: W = 29

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

BE (3): take
AC (4): take
BD (10): take
DE (11): skip, closes a cycle
CE (12): take

Total weight

W = 3 + 4 + 10 + 12 = 29

Answer

W = 29

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