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

About how many comparisons does binary search need in the worst case on a sorted array of 1,000,000 elements?

  1. AAbout 1,000
  2. BAbout 100
  3. CAbout 20
  4. DAbout 500,000
2.Algorithms & complexityHard

Karatsuba multiplication satisfies T(n) = 3T(n/2) + O(n). What does this solve to?

  1. AΘ(nlog₂ 3), about n1.585
  2. BΘ(n²)
  3. CΘ(n log n)
  4. DΘ(n3)
3.Data structuresMedium

What is the cost of inserting an element in the middle of an array of n elements?

  1. AO(1), because the index is known
  2. BO(n²), because each element moves n times
  3. CO(n), because later elements must shift
  4. DO(log n), because of binary search
4.Data structuresHard

Deleting a node with two children from a binary search tree is usually done by:

  1. AReplacing it with its in-order successor (or predecessor) and deleting that node
  2. BRebuilding the subtree below it from scratch and reinserting every key it contained
  3. CSwapping it with the root
  4. DRemoving the whole subtree
5.Graph theoryMedium

A connected graph has 8 vertices and 16 edges. How many edges k must be removed to leave a spanning tree?

|V| = 8|E| = 16
k =
6.Graph theoryHard
ABCDE

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

M = adjacency matrixL = 2
N =

3Solutions

1.Algorithms & complexity

Answer: C · About 20

Why this is the answer

220 ≈ 1,048,576, so after about 20 halvings only one element remains.

Answer

C · About 20
2.Algorithms & complexity

Answer: A · Θ(nlog₂ 3), about n1.585

Why this is the answer

Since log₂ 3 ≈ 1.585 > 1, the leaves dominate by the master theorem, beating the O(n²) schoolbook method.

Answer

A · Θ(nlog₂ 3), about n1.585
3.Data structures

Answer: C · O(n), because later elements must shift

Why this is the answer

All elements after the insertion point move one position to the right, which takes time proportional to n.

Answer

C · O(n), because later elements must shift
4.Data structures

Answer: A · Replacing it with its in-order successor (or predecessor) and deleting that node

Why this is the answer

The in-order successor has at most one child, so it can be removed easily after copying its key into the node being deleted.

Answer

A · Replacing it with its in-order successor (or predecessor) and deleting that node
5.Graph theory

Answer: k = 9

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.

Edges of a spanning tree

8 − 1 = 7

Edges to remove

k = 16 − 7 = 9

Answer

k = 9
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 0
C: 1 1 0 0 1
D: 0 1 0 0 1
E: 0 0 1 1 0

Common neighbours

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

Answer

N = 1

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