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

What is the difference between an undecidable problem and an intractable one?

  1. AUndecidable problems are in NP, while intractable problems are in P
  2. BIntractable problems cannot be solved by any algorithm, while undecidable ones only need exponential time
  3. CBoth mean the problem has no algorithm at all
  4. DAn undecidable problem has no algorithm for all inputs; an intractable one has one, but it is too slow
3.Data structuresMedium

How many nodes does a perfect binary tree of height h have, with height counted in edges?

  1. A2h+1 − 1
  2. B2h
  3. C2h + 1
  4. Dh2
4.Data structuresHard

In Kruskal's minimum spanning tree algorithm, what is the union-find structure used for?

  1. AChecking whether an edge's two endpoints are already connected
  2. BChoosing the starting vertex
  3. CSorting the edges by weight
  4. DStoring each vertex's current distance from the source during the search
5.Graph theoryMedium

How many different Hamilton circuits H does the complete graph K7 have? Circuits that differ only in the starting vertex or the direction count as the same.

K7
H =
6.Graph theoryHard
651211661216ABCDEFG

Use Dijkstra’s algorithm to find the length d(F) of the shortest path from A to F in the weighted graph.

start: Aend: F
d(F) =

3Solutions

1.Algorithms & complexity

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

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

Answer: D · An undecidable problem has no algorithm for all inputs; an intractable one has one, but it is too slow

Why this is the answer

The halting problem has no algorithm at all; an NP-hard problem such as TSP can be solved by brute force, just not in known polynomial time.

Answer

D · An undecidable problem has no algorithm for all inputs; an intractable one has one, but it is too slow
3.Data structures

Answer: A · 2h+1 − 1

Why this is the answer

Summing 1 + 2 + 4 + ... + 2h gives 2h+1 − 1; for example, height 2 gives 7 nodes.

Answer

A · 2h+1 − 1
4.Data structures

Answer: A · Checking whether an edge's two endpoints are already connected

Why this is the answer

Find tells whether both endpoints are in the same component; if not, the edge is added and union merges the components.

Answer

A · Checking whether an edge's two endpoints are already connected
5.Graph theory

Answer: H = 360

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.

Count

H = (7 − 1)!/2 = 720/2 = 360

Answer

H = 360
6.Graph theory

Answer: d(F) = 12

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.

Dijkstra round by round

Each line: the vertex settled, its final distance, and the neighbours whose distance improves.

A (0): B: 6, C: 5
C (5): E: 11
B (6): D: 17, G: 12
E (11): F: 12
F (12)
G (12)
D (17)

Shortest path

A → C → E → F
d(F) = 12

Answer

d(F) = 12

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