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

Which algorithm finds the shortest paths from one source in a graph with non-negative edge weights?

  1. ABellman–Ford is required in all cases
  2. BDepth-first search
  3. CKruskal's algorithm
  4. DDijkstra's algorithm
2.Algorithms & complexityHard

Which two things must be shown to prove that a decision problem X is NP-complete?

  1. AX has no polynomial algorithm, and X is decidable
  2. BX is in NP, and a known NP-complete problem reduces to X in polynomial time
  3. CX reduces to a problem in P, and X is in NP
  4. DX is in P, and X reduces to SAT
3.Data structuresMedium

A hash table of size 7 uses h(k) = k mod 7 and linear probing. After inserting 10, where is 17 stored?

  1. AIndex 3
  2. BIndex 6
  3. CIndex 0
  4. DIndex 4
4.Data structuresHard

Why can elements not simply be deleted from a standard Bloom filter by clearing their bits?

  1. AThose bits may also belong to other elements, which would cause false negatives
  2. BDeleting would increase the false positive rate to 100%
  3. CBits in a Bloom filter cannot be changed after creation
  4. DBloom filters store the full elements, and these cannot be located again once hashed
5.Graph theoryMedium

How many different Hamilton circuits H does the complete graph K5 have? Circuits that differ only in the starting vertex or the direction count as the same.

K5
H =
6.Graph theoryHard
2015716131211ABCDE

Prim’s algorithm builds a minimum spanning tree starting from vertex B. Click the edge it adds as edge number 4.

start: Bk = 4
  1. 1edge AB
  2. 2edge AC
  3. 3edge BC
  4. 4edge BD
  5. 5edge CE
  6. 6edge DE
  7. 7edge BE

3Solutions

1.Algorithms & complexity

Answer: D · Dijkstra's algorithm

Why this is the answer

Dijkstra's algorithm works with non-negative weights; Bellman–Ford handles negative weights; Kruskal builds minimum spanning trees.

Answer

D · Dijkstra's algorithm
2.Algorithms & complexity

Answer: B · X is in NP, and a known NP-complete problem reduces to X in polynomial time

Why this is the answer

Membership in NP shows X is not harder than NP; the reduction from a known NP-complete problem shows X is at least as hard as all of NP.

Answer

B · X is in NP, and a known NP-complete problem reduces to X in polynomial time
3.Data structures

Answer: D · Index 4

Why this is the answer

10 mod 7 = 3 and 17 mod 7 = 3; index 3 is taken, so linear probing tries the next slot, index 4.

Answer

D · Index 4
4.Data structures

Answer: A · Those bits may also belong to other elements, which would cause false negatives

Why this is the answer

Clearing a shared bit would make another element look absent; counting Bloom filters keep counters instead of bits to allow deletion.

Answer

A · Those bits may also belong to other elements, which would cause false negatives
5.Graph theory

Answer: H = 12

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.

Count

H = (5 − 1)!/2 = 24/2 = 12

Answer

H = 12
6.Graph theory

Answer: edge AC

Shortest paths and spanning trees: Dijkstra’s algorithm settles one vertex per round: the unsettled vertex with the smallest tentative distance. Its distance is then final, and every neighbour v gets d(v) = min(d(v), d(u) + w(u, v)). Kruskal’s algorithm builds a minimum spanning tree by taking the edges from light to heavy and skipping any edge that would close a cycle; Prim’s algorithm grows one tree from a start vertex by always adding the lightest edge that leaves it. A spanning tree of n vertices has n − 1 edges.

Prim’s algorithm

1. BC (7)
2. BE (11)
3. DE (12)
4. AC (15)

edge number 4

AC

Answer

edge AC

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