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 did the Cook–Levin theorem establish?

  1. AEvery NP problem can be solved in exponential time
  2. BP is not equal to NP
  3. CThe Boolean satisfiability problem (SAT) is NP-complete
  4. DThe halting problem is undecidable
3.Data structuresMedium

Which data structure does a running program use to keep track of active function calls and their local variables?

  1. AThe heap memory queue
  2. BA hash table of functions
  3. CA binary search tree of frames
  4. DThe call stack
4.Data structuresHard

Which property must a red-black tree satisfy?

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

A tree has 4 vertices of degree 3, 3 vertices of degree 4, 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 33 × deg 44 × deg 53 × deg 2
L =
6.Graph theoryHard
1991683414ABCDE

Prim’s algorithm builds a minimum spanning tree starting from vertex A. Click the edge it adds as edge number 4.

start: Ak = 4
  1. 1edge AB
  2. 2edge AC
  3. 3edge BC
  4. 4edge BD
  5. 5edge CE
  6. 6edge DE
  7. 7edge BE

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: C · The Boolean satisfiability problem (SAT) is NP-complete

Why this is the answer

Cook and Levin showed independently that every problem in NP reduces to SAT in polynomial time, so SAT was the first known NP-complete problem.

Answer

C · The Boolean satisfiability problem (SAT) is NP-complete
3.Data structures

Answer: D · The call stack

Why this is the answer

Each call pushes a stack frame and each return pops it, which is why the most recent call finishes first.

Answer

D · The call stack
4.Data structures

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

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

Answer: L = 24

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 + 50 = 2(L + 14) − 2
L = 24

Answer

L = 24

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

6.Graph theory

Answer: edge BD

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.

Prim’s algorithm

1. AC (9)
2. CE (3)
3. DE (4)
4. BD (8)

edge number 4

BD

Answer

edge BD

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