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

Which technique gives an expected O(n log n) running time for quicksort on any input?

  1. AChoosing the pivot uniformly at random
  2. BSorting the input before running quicksort
  3. CAlways choosing the first element
  4. DUsing recursion only on the left side
3.Data structuresMedium

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

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

Which pair of traversals always determines a unique binary tree with distinct keys?

  1. APreorder and inorder
  2. BPreorder alone
  3. CLevel-order alone
  4. DPreorder and postorder
5.Graph theoryMedium
ABCDEFGEuler circuitEuler path, no circuitneither

Does the connected graph have an Euler circuit, an Euler path that is not a circuit, or neither? Click your answer.

|V| = 7|E| = 9
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
ABCDEF

How many walks of length 3 go from F to A? A walk may repeat vertices and edges. Call the number N.

M = adjacency matrixL = 3
N =

3Solutions

1.Algorithms & complexity

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

D · Greedy uses 3 coins; the optimum is 2
2.Algorithms & complexity

Answer: A · Choosing the pivot uniformly at random

Why this is the answer

With a random pivot, the expected running time is O(n log n) for every input; bad cases still exist but are very unlikely.

Answer

A · Choosing the pivot uniformly at random
3.Data structures

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

D · A min-priority queue
4.Data structures

Answer: A · Preorder and inorder

Why this is the answer

Preorder gives the root, and its position in the inorder sequence splits the left and right subtrees; preorder with postorder is ambiguous when a node has one child.

Answer

A · Preorder and inorder
5.Graph theory

Answer: neither

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.

Degrees

deg(A) = 1, deg(B) = 3, deg(C) = 4, deg(D) = 2, deg(E) = 3, deg(F) = 2, deg(G) = 3

Odd vertices

A, B, E, G → 4
neither

Answer

neither
6.Graph theory

Answer: N = 3

Degrees: the degree of a vertex is the number of edges that meet it. Every edge has two ends, so the degrees add up to twice the number of edges: Σ deg(v) = 2|E| (the handshake lemma). The number of vertices with odd degree is therefore even. Kn has n(n − 1)/2 edges, a k-regular graph on n vertices has nk/2, and a tree on n vertices has n − 1 edges.

Adjacency matrix

A: 0 1 1 0 0 0
B: 1 0 1 1 1 0
C: 1 1 0 0 1 0
D: 0 1 0 0 1 1
E: 0 1 1 1 0 1
F: 0 0 0 1 1 0

One more step

(M³)FA = 0·0 + 2·1 + 1·1 + 1·0 + 1·0 + 2·0 = 3

Answer

N = 3

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