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

Is it correct to say that an O(n²) algorithm is also O(n³)?

  1. ANo, because Big O must always state the exact growth rate of the function
  2. BNo, because n³ is smaller than n² for large n
  3. CYes, because Big O is an upper bound and n² grows no faster than n³
  4. DYes, but only if n is smaller than 100
2.Algorithms & complexityHard

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

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

An adjacency matrix for a graph with V vertices uses how much memory?

  1. AO(V²)
  2. BO(V + E)
  3. CO(log V)
  4. DO(E)
4.Data structuresHard

The keys 5, 3, 8, 1 are inserted in this order into an empty array-based binary min-heap. What is the final array?

  1. A[1, 5, 8, 3]
  2. B[1, 3, 8, 5]
  3. C[3, 1, 8, 5]
  4. D[1, 3, 5, 8]
5.Graph theoryMedium

A tree has 4 vertices of degree 3, 4 vertices of degree 4, 2 vertices of degree 5, 4 vertices of degree 2, and all its other vertices are leaves (degree 1). How many leaves L does it have?

4 × deg 34 × deg 42 × deg 54 × deg 2
L =
6.Graph theoryHard
1121314461312ABCDEFG

Dijkstra’s algorithm runs from A. Click the vertex that is settled (made permanent) in round 4; A itself is round 1.

start: Around 4
  1. 1A
  2. 2B
  3. 3C
  4. 4D
  5. 5E
  6. 6F
  7. 7G

3Solutions

1.Algorithms & complexity

Answer: C · Yes, because Big O is an upper bound and n² grows no faster than n³

Why this is the answer

Big O is an upper bound, so the statement is true but not tight; Θ(n²) states the exact growth rate.

Answer

C · Yes, because Big O is an upper bound and n² grows no faster than n³
2.Algorithms & complexity

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

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

Answer: A · O(V²)

Why this is the answer

An adjacency matrix stores V × V entries, efficient for dense graphs; adjacency lists use O(V + E), better for sparse graphs.

Answer

A · O(V²)
4.Data structures

Answer: B · [1, 3, 8, 5]

Why this is the answer

After 5, 3, 8 the array is [3, 5, 8]; 1 goes to index 3, swaps with its parent 5 and then with 3, giving [1, 3, 8, 5].

Answer

B · [1, 3, 8, 5]
5.Graph theory

Answer: L = 20

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.

Handshake lemma for a tree

L + 46 = 2(L + 14) − 2
L = 20

Answer

L = 20

Shortcut: L = 2 + Σ (d − 2) over the vertices with degree d ≥ 3.

6.Graph theory

Answer: D

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

1. A (0): B: 11, C: 2
2. C (2): B: 3, E: 16, G: 15
3. B (3): D: 6
4. D (6): F: 10
5. F (10)
6. G (15)
7. E (16)

round 4

D

Answer

D

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