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. AYes, because Big O is an upper bound and n² grows no faster than n³
  2. BNo, because n³ is smaller than n² for large n
  3. CYes, but only if n is smaller than 100
  4. DNo, because Big O must always state the exact growth rate of the function
2.Algorithms & complexityHard

Which two things must be shown to prove that a decision problem X is NP-complete?

  1. AX is in P, and X reduces to SAT
  2. BX has no polynomial algorithm, and X is decidable
  3. CX reduces to a problem in P, and X is in NP
  4. DX is in NP, and a known NP-complete problem reduces to X in polynomial time
3.Data structuresMedium

Which data structure is used to check whether the brackets in "{[()]}" are balanced?

  1. AA stack
  2. BA queue
  3. CA hash table
  4. DA binary search tree
4.Data structuresHard

Inserting a key into an AVL tree makes a node's left subtree too tall, and the new key went into the left subtree of its left child (left-left case). Which fix is applied?

  1. ARecolouring the node and its child
  2. BA single right rotation at the unbalanced node
  3. CA left rotation at the child, then a right rotation at the node
  4. DA single left rotation at the unbalanced node
5.Graph theoryMedium

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

4 × deg 34 × deg 53 × deg 2
L =
6.Graph theoryHard
412111495924127ABCDEFG

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

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

3Solutions

1.Algorithms & complexity

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

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

Answer: D · X is in NP, and a known NP-complete problem reduces to X in polynomial time

Why this is the answer

Membership in NP shows X is not harder than NP; the reduction from a known NP-complete problem shows X is at least as hard as all of NP.

Answer

D · X is in NP, and a known NP-complete problem reduces to X in polynomial time
3.Data structures

Answer: A · A stack

Why this is the answer

Push each opening bracket and pop when a closing bracket appears; it must match the popped bracket and the stack must be empty at the end.

Answer

A · A stack
4.Data structures

Answer: B · A single right rotation at the unbalanced node

Why this is the answer

In the left-left case one right rotation lifts the left child up and restores balance; zig-zag cases need a double rotation.

Answer

B · A single right rotation at the unbalanced node
5.Graph theory

Answer: L = 18

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 + 38 = 2(L + 11) − 2
L = 18

Answer

L = 18

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

round 6

D

Answer

D

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