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

With coins of 1, 3 and 4 and an amount of 6, how many coins does the greedy "largest coin first" method use, compared to the optimum?

  1. AGreedy uses 2 coins; the optimum is 2
  2. BGreedy uses 3 coins; the optimum is 2
  3. CGreedy uses 3 coins; the optimum is 3
  4. DGreedy uses 4 coins; the optimum is 3
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

In a hash table using open addressing, what is the maximum possible load factor?

  1. AThere is no maximum
  2. B0.5
  3. C1
  4. D2
4.Data structuresHard

What guarantee do the red-black tree rules give about the height of a tree with n keys?

  1. AThe height is exactly log2 n
  2. BThe height is at most log2 n + 1
  3. CThe height is at most 2 log2(n + 1)
  4. DThe height is at most n / 2
5.Graph theoryMedium

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

|V| = 11|E| = 21
k =
6.Graph theoryHard
105197152ABCDE

Find the total weight W of a minimum spanning tree of the weighted graph.

|V| = 5|E| = 7
W =

3Solutions

1.Algorithms & complexity

Answer: B · Greedy uses 3 coins; the optimum is 2

Why this is the answer

Greedy takes 4 + 1 + 1 = 3 coins, but 3 + 3 uses only 2, so greedy is not optimal for this coin system; dynamic programming is.

Answer

B · Greedy uses 3 coins; the optimum is 2
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 · 1

Why this is the answer

With open addressing all keys are stored in the table itself, so n cannot exceed m; separate chaining can have a load factor above 1.

Answer

C · 1
4.Data structures

Answer: C · The height is at most 2 log2(n + 1)

Why this is the answer

Every path has the same number of black nodes and red nodes cannot be adjacent, so the longest path is at most twice the shortest, giving height O(log n).

Answer

C · The height is at most 2 log2(n + 1)
5.Graph theory

Answer: k = 11

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

11 − 1 = 10

Edges to remove

k = 21 − 10 = 11

Answer

k = 11
6.Graph theory

Answer: W = 17

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.

Kruskal’s algorithm

BC (1): take
BE (2): take
AC (5): take
CE (7): skip, closes a cycle
BD (9): take

Total weight

W = 1 + 2 + 5 + 9 = 17

Answer

W = 17

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