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

Why do many library sorting routines switch to insertion sort for very small subarrays?

  1. ARecursive algorithms cannot handle arrays below 10 elements
  2. BInsertion sort is O(n log n) in the worst case
  3. CInsertion sort has little overhead and is fast on small or nearly sorted inputs
  4. DInsertion sort uses less memory than any other sorting algorithm on large inputs
2.Algorithms & complexityHard

Why does any comparison-based search in a sorted array need Ω(log n) comparisons in the worst case?

  1. AEvery element must be compared at least once
  2. BBinary search is the only possible algorithm, and it needs log₂ n comparisons
  3. CA decision tree with n possible outcomes must have depth at least log₂ n
  4. DComparisons take logarithmic time each
3.Data structuresMedium

You have a reference to a node in the middle of a list. In which list can you remove it in O(1)?

  1. AA dynamic array
  2. BA doubly linked list
  3. CA singly linked list
  4. DA sorted array
4.Data structuresHard

Which structure lets you compute the maximum of every window of size k in an array in O(n) total?

  1. AA min-heap rebuilt for every window
  2. BA singly linked list of the window's elements
  3. CA sorted array updated by shifting
  4. DA deque holding indices in decreasing order of value
5.Graph theoryMedium
ABCDEFEuler 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| = 6|E| = 6
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
ABCDEF

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

M = adjacency matrixL = 2
N =

3Solutions

1.Algorithms & complexity

Answer: C · Insertion sort has little overhead and is fast on small or nearly sorted inputs

Why this is the answer

For small n the simple loop of insertion sort beats the recursion overhead of quicksort or merge sort, even though it is O(n²).

Answer

C · Insertion sort has little overhead and is fast on small or nearly sorted inputs
2.Algorithms & complexity

Answer: C · A decision tree with n possible outcomes must have depth at least log₂ n

Why this is the answer

Each comparison at most halves the set of remaining possibilities, so distinguishing n positions needs at least log₂ n comparisons.

Answer

C · A decision tree with n possible outcomes must have depth at least log₂ n
3.Data structures

Answer: B · A doubly linked list

Why this is the answer

A doubly linked node knows its predecessor, so you can relink prev and next directly; a singly linked list must search for the predecessor.

Answer

B · A doubly linked list
4.Data structures

Answer: D · A deque holding indices in decreasing order of value

Why this is the answer

The front of the deque is always the window's maximum; each index enters and leaves the deque once, so the work is linear.

Answer

D · A deque holding indices in decreasing order of value
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) = 3, deg(C) = 2, deg(D) = 2, deg(E) = 1, deg(F) = 2

Odd vertices

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

Common neighbours

(M²)AB = 0·1 + 1·0 + 1·1 + 0·1 + 0·1 + 0·0 = 1

Answer

N = 1

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