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

Which algorithm finds the shortest paths from one source in a graph with non-negative edge weights?

  1. ADepth-first search
  2. BDijkstra's algorithm
  3. CBellman–Ford is required in all cases
  4. DKruskal's algorithm
2.Algorithms & complexityHard

What would follow if someone found a polynomial-time algorithm for one NP-complete problem?

  1. AThe halting problem would become decidable
  2. BAll exponential-time algorithms would immediately run in linear time
  3. COnly that one problem would move into P
  4. DEvery problem in NP could be solved in polynomial time, so P = NP
3.Data structuresMedium

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

  1. AThere is no maximum
  2. B0.5
  3. C1
  4. D2
4.Data structuresHard

For each element of an array you want the next greater element to its right, in O(n) total time. Which structure helps?

  1. AA hash table of all elements
  2. BA queue that holds every pair of elements
  3. CA binary search tree rebuilt for each element
  4. DA stack that keeps elements waiting for their answer
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| = 7
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
6146145121113ABCDEF

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: B · Dijkstra's algorithm

Why this is the answer

Dijkstra's algorithm works with non-negative weights; Bellman–Ford handles negative weights; Kruskal builds minimum spanning trees.

Answer

B · Dijkstra's algorithm
2.Algorithms & complexity

Answer: D · Every problem in NP could be solved in polynomial time, so P = NP

Why this is the answer

Since all of NP reduces to any NP-complete problem in polynomial time, a fast algorithm for one gives a fast algorithm for all.

Answer

D · Every problem in NP could be solved in polynomial time, so P = NP
3.Data structures

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

C · 1
4.Data structures

Answer: D · A stack that keeps elements waiting for their answer

Why this is the answer

Scanning left to right, pop every stacked element smaller than the current one (the current element is their answer), then push it; each element moves at most twice.

Answer

D · A stack that keeps elements waiting for their answer
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) = 2, deg(E) = 3

Odd vertices

C, E → 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: d(F) = 30

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: 14
B (6): C: 12, D: 20
C (12): E: 17
E (17): F: 30
D (20)
F (30)

Shortest path

A → B → C → E → F
d(F) = 30

Answer

d(F) = 30

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