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

Why do many library sorting routines switch to insertion sort for very small subarrays?

  1. AInsertion sort uses less memory than any other sorting algorithm on large inputs
  2. BRecursive algorithms cannot handle arrays below 10 elements
  3. CInsertion sort has little overhead and is fast on small or nearly sorted inputs
  4. DInsertion sort is O(n log n) in the worst case
2.Algorithms & complexityHard

Is 22n in O(2ⁿ)?

  1. ANo, because 22n grows more slowly than 2ⁿ
  2. BNo, because 22n = 4ⁿ and 4ⁿ / 2ⁿ = 2ⁿ grows without bound
  3. CYes, because constant factors in the exponent are always ignored in Big O
  4. DYes, because both are exponential
3.Data structuresMedium

An in-order traversal of a binary search tree visits the keys in:

  1. AInsertion order
  2. BDescending order always
  3. CAscending sorted order
  4. DLevel order
4.Data structuresHard

Kahn's algorithm for topological sorting repeatedly removes vertices with in-degree 0. Which structure holds those vertices?

  1. AAn adjacency matrix recording which vertices have already been removed
  2. BA max-heap ordered by out-degree
  3. CA queue (or any collection) of vertices whose in-degree is 0
  4. DA stack of all visited edges
5.Graph theoryMedium

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

K8
H =
6.Graph theoryHard
2537316814ABCDEF

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

3Solutions

1.Algorithms & complexity

Answer: C · Insertion sort has little overhead and is fast on small or nearly sorted inputs

Why this is the answer

For small n the simple loop of insertion sort beats the recursion overhead of quicksort or merge sort, even though it is O(n²).

Answer

C · Insertion sort has little overhead and is fast on small or nearly sorted inputs
2.Algorithms & complexity

Answer: B · No, because 22n = 4ⁿ and 4ⁿ / 2ⁿ = 2ⁿ grows without bound

Why this is the answer

A constant added to the exponent gives a constant factor, but a constant multiplying the exponent changes the base and the growth rate.

Answer

B · No, because 22n = 4ⁿ and 4ⁿ / 2ⁿ = 2ⁿ grows without bound
3.Data structures

Answer: C · Ascending sorted order

Why this is the answer

Visiting the left subtree, then the node, then the right subtree outputs BST keys in sorted order.

Answer

C · Ascending sorted order
4.Data structures

Answer: C · A queue (or any collection) of vertices whose in-degree is 0

Why this is the answer

Ready vertices are kept in a queue; removing one lowers its neighbours' in-degrees, and any that reach 0 are added, giving O(V + E) time.

Answer

C · A queue (or any collection) of vertices whose in-degree is 0
5.Graph theory

Answer: H = 2520

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 = (8 − 1)!/2 = 5040/2 = 2520

Answer

H = 2520
6.Graph theory

Answer: E

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: 2, C: 5
2. B (2): D: 9, E: 16
3. C (5): E: 8
4. E (8): F: 16
5. D (9): F: 15
6. F (15)

round 4

E

Answer

E

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