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 amortised time complexity of appending to a dynamic array that doubles its capacity when full?

  1. AO(n)
  2. BO(1)
  3. CO(log n)
  4. DO(n²)
2.Algorithms & complexityHard

What would follow if someone found a polynomial-time algorithm for one NP-complete problem?

  1. AOnly that one problem would move into P
  2. BEvery problem in NP could be solved in polynomial time, so P = NP
  3. CThe halting problem would become decidable
  4. DAll exponential-time algorithms would immediately run in linear time
3.Data structuresMedium

What is the value of the postfix expression 3 4 + 2 * ?

  1. A10
  2. B24
  3. C14
  4. D11
4.Data structuresHard

Which property must a red-black tree satisfy?

  1. AEvery node must be red
  2. BEvery path from a node to its descendant leaves has the same number of black nodes
  3. CEvery red node must have red children, so red nodes always form unbroken chains to the leaves
  4. DThe root must be red
5.Graph theoryMedium

A connected graph has 7 vertices and 13 edges. How many edges k must be removed to leave a spanning tree?

|V| = 7|E| = 13
k =
6.Graph theoryHard
145111061419ABCDEF

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: B · O(1)

Why this is the answer

Copying all elements happens only at powers of two; spread over all appends, the average cost per append is constant.

Answer

B · O(1)
2.Algorithms & complexity

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

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

Answer: C · 14

Why this is the answer

Push 3 and 4, + gives 7; push 2, * gives 7 × 2 = 14.

Answer

C · 14
4.Data structures

Answer: B · Every path from a node to its descendant leaves has the same number of black nodes

Why this is the answer

Red-black rules: nodes are red or black, root is black, red nodes have black children, and all paths have equal black-height, keeping height ≤ 2 log₂(n + 1).

Answer

B · Every path from a node to its descendant leaves has the same number of black nodes
5.Graph theory

Answer: k = 7

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.

Edges of a spanning tree

7 − 1 = 6

Edges to remove

k = 13 − 6 = 7

Answer

k = 7
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: 14, C: 5
2. C (5): E: 15
3. B (14): D: 25
4. E (15): D: 21, F: 16
5. F (16)
6. D (21)

round 4

E

Answer

E

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