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(log n)
  2. BO(n log n)
  3. CO(n)
  4. DO(n²)
2.Algorithms & complexityHard

How is the travelling salesman problem classified?

  1. AThe decision version is NP-complete and the optimisation version is NP-hard
  2. BThe decision version is in P but the optimisation version is NP-complete
  3. CIt is undecidable
  4. DIt is in P because Dijkstra's algorithm solves it by visiting every city once
3.Data structuresMedium

Which abstract data type does Dijkstra's algorithm use to choose the next vertex to process?

  1. AA set with no ordering
  2. BA FIFO queue
  3. CA min-priority queue
  4. DA stack
4.Data structuresHard

Why do databases often use B+ trees rather than plain B-trees for indexes?

  1. AB+ trees store data only in the root
  2. BAll records are in linked leaves, which makes range scans efficient
  3. CB+ trees use binary internal nodes, which reduces the number of disk reads
  4. DB+ trees do not need to be balanced
5.Graph theoryMedium

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

|V| = 16|E| = 27
k =
6.Graph theoryHard
869815151814ABCDEF

Dijkstra’s algorithm runs from A. Click the vertex that is settled (made permanent) in round 5; A itself is round 1.

start: Around 5
  1. 1A
  2. 2B
  3. 3C
  4. 4D
  5. 5E
  6. 6F

3Solutions

1.Algorithms & complexity

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

C · O(n)
2.Algorithms & complexity

Answer: A · The decision version is NP-complete and the optimisation version is NP-hard

Why this is the answer

"Is there a tour of length at most k?" is NP-complete; finding the shortest tour is NP-hard, since it is at least as hard.

Answer

A · The decision version is NP-complete and the optimisation version is NP-hard
3.Data structures

Answer: C · A min-priority queue

Why this is the answer

A min-priority queue, usually a binary heap, returns the unvisited vertex with the smallest distance efficiently.

Answer

C · A min-priority queue
4.Data structures

Answer: B · All records are in linked leaves, which makes range scans efficient

Why this is the answer

In a B+ tree internal nodes only guide the search and the leaves are linked in key order, so a range query finds the first key and then walks along the leaves.

Answer

B · All records are in linked leaves, which makes range scans efficient
5.Graph theory

Answer: k = 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.

Edges of a spanning tree

16 − 1 = 15

Edges to remove

k = 27 − 15 = 12

Answer

k = 12
6.Graph theory

Answer: F

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.

Dijkstra round by round

1. A (0): B: 8, C: 6
2. C (6): E: 21
3. B (8): D: 16
4. D (16): F: 17
5. F (17)
6. E (21)

round 5

F

Answer

F

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