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 time complexity of the standard dynamic programming algorithm for the longest common subsequence of strings of lengths m and n?

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

Which definition of the class P is correct?

  1. AProblems that need exponential time on every computer
  2. BProblems whose solutions can be checked but never found in polynomial time
  3. CDecision problems solvable by a deterministic algorithm in polynomial time
  4. DProblems that can be solved in parallel
3.Data structuresMedium

An application needs fast lookups and also needs to list keys in sorted order and answer range queries. Which structure fits best?

  1. AA balanced binary search tree
  2. BA stack
  3. CAn unsorted linked list
  4. DA hash table
4.Data structuresHard

Which statement about heapsort is correct?

  1. AIt needs a binary search tree as extra storage, so it uses O(n) extra memory
  2. BIt is stable and needs O(n) extra memory
  3. CIt sorts in place in O(n log n) worst-case time but is not stable
  4. DIt runs in O(n) time on any input
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| = 10
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
ABCDE

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

M = adjacency matrixL = 3
N =

3Solutions

1.Algorithms & complexity

Answer: B · O(mn)

Why this is the answer

The table has (m + 1)(n + 1) cells and each is computed in O(1) from its neighbours.

Answer

B · O(mn)
2.Algorithms & complexity

Answer: C · Decision problems solvable by a deterministic algorithm in polynomial time

Why this is the answer

P contains decision problems with a deterministic polynomial-time algorithm, such as checking whether a graph is connected.

Answer

C · Decision problems solvable by a deterministic algorithm in polynomial time
3.Data structures

Answer: A · A balanced binary search tree

Why this is the answer

A balanced BST gives O(log n) lookups and keeps keys ordered, so in-order traversal and range queries are easy; a hash table scatters keys.

Answer

A · A balanced binary search tree
4.Data structures

Answer: C · It sorts in place in O(n log n) worst-case time but is not stable

Why this is the answer

Heapsort builds a max-heap and extracts the maximum n times within the same array; swaps over long distances can reorder equal keys.

Answer

C · It sorts in place in O(n log n) worst-case time but is not stable
5.Graph theory

Answer: Euler path, no circuit

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) = 2, deg(B) = 4, deg(C) = 4, deg(D) = 4, deg(E) = 2, deg(F) = 1, deg(G) = 3

Odd vertices

F, G → 2
Euler path, no circuit

Answer

Euler path, no circuit

The Euler path starts at one odd vertex and ends at the other.

6.Graph theory

Answer: N = 1

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
B: 1 0 1 1 1
C: 1 1 0 0 1
D: 0 1 0 0 0
E: 0 1 1 0 0

One more step

(M³)ED = 2·0 + 1·1 + 1·0 + 1·0 + 2·0 = 1

Answer

N = 1

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