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 is the worst-case time complexity of quicksort?

  1. AO(log n)
  2. BO(n²)
  3. CO(n log n)
  4. DO(n)
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. CEvery problem in NP could be solved in polynomial time, so P = NP
  4. DOnly that one problem would move into P
3.Data structuresMedium

What balance condition does an AVL tree maintain at every node?

  1. AThe heights of the left and right subtrees differ by at most 1
  2. BAll leaves are at exactly the same depth
  3. CBoth subtrees of every node contain exactly the same number of nodes
  4. DEvery node is coloured red or black
4.Data structuresHard

Which pair of traversals always determines a unique binary tree with distinct keys?

  1. APreorder and postorder
  2. BLevel-order alone
  3. CPreorder alone
  4. DPreorder and inorder
5.Graph theoryMedium
ABCDEFEuler 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| = 6|E| = 7
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
102108111488ABCDEF

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

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

3Solutions

1.Algorithms & complexity

Answer: B · O(n²)

Why this is the answer

With consistently bad pivots (e.g. already sorted input and first-element pivot) partitions are unbalanced, giving O(n²). The average case is O(n log n).

Answer

B · O(n²)
2.Algorithms & complexity

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

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

Answer: A · The heights of the left and right subtrees differ by at most 1

Why this is the answer

The balance factor (height left − height right) must be −1, 0 or 1; rotations restore it after inserts and deletes.

Answer

A · The heights of the left and right subtrees differ by at most 1
4.Data structures

Answer: D · Preorder and inorder

Why this is the answer

Preorder gives the root, and its position in the inorder sequence splits the left and right subtrees; preorder with postorder is ambiguous when a node has one child.

Answer

D · Preorder and inorder
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) = 2, deg(D) = 3, deg(E) = 2, deg(F) = 1

Odd vertices

D, F → 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

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): C: 10
2. C (10): B: 12, E: 18
3. B (12): D: 22
4. E (18): F: 26
5. D (22)
6. F (26)

round 5

D

Answer

D

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