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

How does Prim's algorithm build a minimum spanning tree?

  1. AIt grows one tree from a start vertex, adding the cheapest edge that leaves the tree
  2. BIt removes the most expensive edge until no cycles remain
  3. CIt runs breadth-first search and keeps the BFS tree
  4. DIt sorts all edges by weight and adds each one unless it would form a cycle in the forest
2.Algorithms & complexityHard

Which statement about P and NP is correct?

  1. ANP means "not polynomial"
  2. BNP problems cannot be verified quickly
  3. CEvery problem in P is also in NP
  4. DIt has been proven that P ≠ NP
3.Data structuresMedium

In a hash table using open addressing, what is the maximum possible load factor?

  1. A2
  2. B0.5
  3. CThere is no maximum
  4. D1
4.Data structuresHard

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

  1. ASwapping it with the root
  2. BReplacing it with its in-order successor (or predecessor) and deleting that node
  3. CRemoving the whole subtree
  4. DRebuilding the subtree below it from scratch and reinserting every key it contained
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| = 7
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
ABCDE

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

M = adjacency matrixL = 2
N =

3Solutions

1.Algorithms & complexity

Answer: A · It grows one tree from a start vertex, adding the cheapest edge that leaves the tree

Why this is the answer

Prim's algorithm, with a priority queue of crossing edges, runs in O(E log V) with a binary heap.

Answer

A · It grows one tree from a start vertex, adding the cheapest edge that leaves the tree
2.Algorithms & complexity

Answer: C · Every problem in P is also in NP

Why this is the answer

P ⊆ NP: if you can solve a problem quickly you can verify a solution quickly. Whether P = NP is still open.

Answer

C · Every problem in P is also in NP
3.Data structures

Answer: D · 1

Why this is the answer

With open addressing all keys are stored in the table itself, so n cannot exceed m; separate chaining can have a load factor above 1.

Answer

D · 1
4.Data structures

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

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

Answer: neither

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

Odd vertices

A, C, D, F → 4
neither

Answer

neither
6.Graph theory

Answer: N = 3

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

Common neighbours

(M²)CC = 1·1 + 1·1 + 0·0 + 0·0 + 1·1 = 3

Answer

N = 3

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