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 computing the n-th Fibonacci number with a bottom-up table?

  1. AO(2ⁿ)
  2. BO(n²)
  3. CO(log n)
  4. DO(n)
2.Algorithms & complexityHard

Why does binary search not give O(log n) time on a singly linked list?

  1. ALinked lists cannot be sorted
  2. BReaching the middle element takes O(n) steps, since there is no direct index access
  3. CBinary search needs at least twice the memory
  4. DComparisons on linked list nodes are slower
3.Data structuresMedium

In a binary min-heap stored in an array (index starting at 0), the children of the node at index i are at:

  1. Ai/2 and i/2 + 1
  2. B2i + 1 and 2i + 2
  3. Ci + 1 and i + 2
  4. D2i and 2i + 1
4.Data structuresHard

Why are B-trees used in databases and file systems?

  1. AThey store data unsorted
  2. BThey use less memory than any array, so the entire index always fits in main memory
  3. CThey need no rebalancing
  4. DTheir high branching factor keeps the tree shallow, reducing slow disk reads
5.Graph theoryMedium
ABCDEEuler 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| = 5|E| = 6
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
ABCDEF

How many closed walks of length 2 start and end at F? A walk may repeat vertices and edges. Call the number N.

M = adjacency matrixL = 2
N =

3Solutions

1.Algorithms & complexity

Answer: D · O(n)

Why this is the answer

Filling the table from 0 to n takes one addition per entry, so the work is linear instead of exponential.

Answer

D · O(n)
2.Algorithms & complexity

Answer: B · Reaching the middle element takes O(n) steps, since there is no direct index access

Why this is the answer

Binary search needs O(1) access to the middle; on a linked list walking there costs linear time, so the total is O(n).

Answer

B · Reaching the middle element takes O(n) steps, since there is no direct index access
3.Data structures

Answer: B · 2i + 1 and 2i + 2

Why this is the answer

For 0-based arrays, the left child is at 2i + 1, the right child at 2i + 2, and the parent at ⌊(i − 1)/2⌋.

Answer

B · 2i + 1 and 2i + 2
4.Data structures

Answer: D · Their high branching factor keeps the tree shallow, reducing slow disk reads

Why this is the answer

B-trees store many keys per node, so height is small and few block reads are needed per lookup; B+ trees also link leaves for range scans.

Answer

D · Their high branching factor keeps the tree shallow, reducing slow disk reads
5.Graph theory

Answer: Euler 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) = 2, deg(D) = 2, deg(E) = 2

Odd vertices

0
Euler circuit

Answer

Euler circuit
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 0 1 0
C: 1 1 0 0 1 0
D: 0 0 0 0 1 1
E: 0 1 1 1 0 0
F: 0 0 0 1 0 0

Common neighbours

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

Answer

N = 1

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