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

Breadth-first search on an unweighted graph finds:

  1. AShortest paths in graphs that contain negative edge weights
  2. BShortest paths in number of edges from the start node
  3. CA topological order in all graphs
  4. DThe minimum spanning tree
2.Algorithms & complexityHard

A problem is NP-complete if it is:

  1. AIn NP and every NP problem reduces to it in polynomial time
  2. BImpossible to solve
  3. CSolvable in polynomial time
  4. DOutside NP but harder than all NP problems, such as the halting problem
3.Data structuresMedium

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

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

Which property keeps every B-tree perfectly balanced?

  1. AAll leaves are at the same depth
  2. BEach node stores one key
  3. CEvery node has exactly two children
  4. DThe keys are stored only in the root
5.Graph theoryMedium

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

2 × deg 33 × deg 42 × deg 2
L =
6.Graph theoryHard
471227108131215ABCDEFG

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: B · Shortest paths in number of edges from the start node

Why this is the answer

BFS visits nodes in order of distance (edges) from the source, so it finds shortest unweighted paths in O(V + E).

Answer

B · Shortest paths in number of edges from the start node
2.Algorithms & complexity

Answer: A · In NP and every NP problem reduces to it in polynomial time

Why this is the answer

NP-complete problems are the hardest in NP; a polynomial algorithm for one would give one for all of NP.

Answer

A · In NP and every NP problem reduces to it in polynomial time
3.Data structures

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

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

Answer: A · All leaves are at the same depth

Why this is the answer

Nodes split upwards when full and the tree only gets taller when the root splits, so all leaves always stay on the same level.

Answer

A · All leaves are at the same depth
5.Graph theory

Answer: L = 10

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 + 22 = 2(L + 7) − 2
L = 10

Answer

L = 10

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

6.Graph theory

Answer: B

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: 4
2. C (4): B: 11, E: 6
3. E (6): D: 13, F: 14, G: 21
4. B (11)
5. D (13)
6. F (14)
7. G (21)

round 4

B

Answer

B

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