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

In a sorted array, you look for two elements that sum to a target by moving one pointer from each end inwards. What is the time complexity?

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

Why is the average lookup in a hash table O(1) but the worst case O(n)?

  1. AArrays have O(n) access
  2. BMany keys may collide into the same bucket
  3. CHash functions are slow
  4. DKeys must be sorted first
3.Data structuresMedium

The keys 50, 30, 70, 20, 40 are inserted in this order into an empty binary search tree. What is the left child of 30?

  1. A50
  2. B40
  3. C70
  4. D20
4.Data structuresHard

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

  1. ALevel-order alone
  2. BPreorder and inorder
  3. CPreorder and postorder
  4. DPreorder alone
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| = 8
  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 B? A walk may repeat vertices and edges. Call the number N.

M = adjacency matrixL = 2
N =

3Solutions

1.Algorithms & complexity

Answer: A · O(n)

Why this is the answer

If the sum is too small the left pointer moves right, if too large the right pointer moves left, so there are at most n steps.

Answer

A · O(n)
2.Algorithms & complexity

Answer: B · Many keys may collide into the same bucket

Why this is the answer

With a good hash function and load factor, buckets stay short on average; adversarial or poor hashing can put all keys in one bucket.

Answer

B · Many keys may collide into the same bucket
3.Data structures

Answer: D · 20

Why this is the answer

20 is smaller than 50 and smaller than 30, so it becomes the left child of 30; 40 becomes its right child.

Answer

D · 20
4.Data structures

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

B · Preorder and inorder
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) = 2, deg(C) = 3, deg(D) = 2, deg(E) = 3, deg(F) = 2, deg(G) = 2

Odd vertices

C, 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 = 2

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

Common neighbours

(M²)BB = 1·1 + 0·0 + 0·0 + 0·0 + 1·1 + 0·0 = 2

Answer

N = 2

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