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. AAn optimal solution can be built from optimal solutions of its subproblems
  2. BThe problem can be solved in constant time
  3. CEvery subproblem has the same size
  4. DThe problem has exactly one optimal solution, which every subproblem shares
2.Algorithms & complexityHard

Which definition of the class NP is correct?

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

In a binary min-heap stored in an array (index starting at 0), the children of the node at index i are at:

  1. Ai/2 and i/2 + 1
  2. B2i + 1 and 2i + 2
  3. Ci + 1 and i + 2
  4. D2i and 2i + 1
4.Data structuresHard

Without union by rank or path compression, what is the worst-case cost of a single find in a union-find structure with n elements?

  1. AO(α(n))
  2. BO(1)
  3. CO(n)
  4. DO(log n)
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
ABCDE

How many closed walks of length 3 start and end at A? A walk may repeat vertices and edges. Call the number N.

M = adjacency matrixL = 3
N =

3Solutions

1.Algorithms & complexity

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

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

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

D · Decision problems whose yes-answers can be verified in polynomial time given a certificate
3.Data structures

Answer: B · 2i + 1 and 2i + 2

Why this is the answer

For 0-based arrays, the left child is at 2i + 1, the right child at 2i + 2, and the parent at ⌊(i − 1)/2⌋.

Answer

B · 2i + 1 and 2i + 2
4.Data structures

Answer: C · O(n)

Why this is the answer

Naive unions can link trees into a long chain, so find may follow n − 1 parent pointers; the two heuristics bring it close to constant.

Answer

C · O(n)
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) = 3, deg(D) = 1, deg(E) = 2

Odd vertices

C, D → 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: N = 2

Degrees: the degree of a vertex is the number of edges that meet it. Every edge has two ends, so the degrees add up to twice the number of edges: Σ deg(v) = 2|E| (the handshake lemma). The number of vertices with odd degree is therefore even. Kn has n(n − 1)/2 edges, a k-regular graph on n vertices has nk/2, and a tree on n vertices has n − 1 edges.

Adjacency matrix

A: 0 1 1 0 0
B: 1 0 1 0 1
C: 1 1 0 0 1
D: 0 0 0 0 1
E: 0 1 1 1 0

One more step

(M³)AA = 2·0 + 1·1 + 1·1 + 0·0 + 2·0 = 2

Answer

N = 2

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