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

Which definition of the class NP is correct?

  1. AProblems that no algorithm can solve
  2. BProblems that are not polynomial
  3. CProblems that cannot be solved in polynomial time
  4. DDecision problems whose yes-answers can be verified in polynomial time given a certificate
3.Data structuresMedium

Which abstract data type does Dijkstra's algorithm use to choose the next vertex to process?

  1. AA stack
  2. BA min-priority queue
  3. CA FIFO queue
  4. DA set with no ordering
4.Data structuresHard

Deleting a node with two children from a binary search tree is usually done by:

  1. ASwapping it with the root
  2. BReplacing it with its in-order successor (or predecessor) and deleting that node
  3. CRebuilding the subtree below it from scratch and reinserting every key it contained
  4. DRemoving the whole subtree
5.Graph theoryMedium

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

|V| = 6|E| = 13
k =
6.Graph theoryHard
172012511476ABCDEF

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

|V| = 6|E| = 8
W =

3Solutions

1.Algorithms & complexity

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

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

Answer: D · Decision problems whose yes-answers can be verified in polynomial time given a certificate

Why this is the answer

For an NP problem, a proposed solution (certificate) can be checked quickly, for example verifying a given assignment satisfies a Boolean formula.

Answer

D · Decision problems whose yes-answers can be verified in polynomial time given a certificate
3.Data structures

Answer: B · A min-priority queue

Why this is the answer

A min-priority queue, usually a binary heap, returns the unvisited vertex with the smallest distance efficiently.

Answer

B · A min-priority queue
4.Data structures

Answer: B · Replacing it with its in-order successor (or predecessor) and deleting that node

Why this is the answer

The in-order successor has at most one child, so it can be removed easily after copying its key into the node being deleted.

Answer

B · Replacing it with its in-order successor (or predecessor) and deleting that node
5.Graph theory

Answer: k = 8

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

6 − 1 = 5

Edges to remove

k = 13 − 5 = 8

Answer

k = 8
6.Graph theory

Answer: W = 43

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

DE (4): take
BD (5): take
EF (6): take
DF (7): skip, closes a cycle
CE (11): take
BC (12): skip, closes a cycle
AB (17): take

Total weight

W = 4 + 5 + 6 + 11 + 17 = 43

Answer

W = 43

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