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. BEvery subproblem has the same size
  3. CThe problem has exactly one optimal solution, which every subproblem shares
  4. DAn optimal solution can be built from optimal solutions of its subproblems
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

How do you find the minimum key in a binary search tree?

  1. AFollow left children from the root until there is no left child
  2. BFollow right children from the root until there is no right child
  3. CVisit every leaf and compare them
  4. DLook at the root only
4.Data structuresHard

An object is stored as a key in a hash map, and then a field used by its hash function is changed. What is the likely result?

  1. AThe map throws an error at the moment the field changes
  2. BLooking up the object may fail because it sits in the bucket for its old hash
  3. CThe map automatically moves the key to its new bucket
  4. DNothing changes, because a key's hash is computed only once when the program starts
5.Graph theoryMedium

A connected graph has 9 vertices and 14 edges. How many edges k must be removed to leave a spanning tree?

|V| = 9|E| = 14
k =
6.Graph theoryHard
924513782ABCDEF

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: 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: A · Follow left children from the root until there is no left child

Why this is the answer

The leftmost node has no smaller key in the tree, so it is the minimum; the cost is proportional to the height.

Answer

A · Follow left children from the root until there is no left child
4.Data structures

Answer: B · Looking up the object may fail because it sits in the bucket for its old hash

Why this is the answer

The key's location was chosen from its old hash; with a new hash, lookups search the wrong bucket, so keys should be immutable.

Answer

B · Looking up the object may fail because it sits in the bucket for its old hash
5.Graph theory

Answer: k = 6

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.

Edges of a spanning tree

9 − 1 = 8

Edges to remove

k = 14 − 8 = 6

Answer

k = 6
6.Graph theory

Answer: d(F) = 11

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: 9, C: 2
C (2): B: 6, E: 3
E (3): D: 6, F: 11, B: 5
B (5)
D (6)
F (11)

Shortest path

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

Answer

d(F) = 11

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