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

You sort an array of n elements once and then answer k membership queries with binary search. What is the total cost?

  1. AO(k n log n)
  2. BO(nk)
  3. CO(n + k)
  4. DO(n log n + k log 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. BIt is in P because Dijkstra's algorithm solves it by visiting every city once
  3. CThe decision version is in P but the optimisation version is NP-complete
  4. DIt is undecidable
3.Data structuresMedium

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

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

Under simple uniform hashing, what is the expected time of a search in a hash table with chaining, n keys and m buckets?

  1. AO(n)
  2. BO(m)
  3. CO(log n)
  4. DO(1 + α), where α = n / m
5.Graph theoryMedium

A tree has 2 vertices of degree 3, 4 vertices of degree 4, 2 vertices of degree 5, 4 vertices of degree 2, and all its other vertices are leaves (degree 1). How many leaves L does it have?

2 × deg 34 × deg 42 × deg 54 × deg 2
L =
6.Graph theoryHard
1382018419ABCDE

Find the total weight W of a minimum spanning tree of the weighted graph.

|V| = 5|E| = 7
W =

3Solutions

1.Algorithms & complexity

Answer: D · O(n log n + k log n)

Why this is the answer

Sorting costs O(n log n) and each query O(log n); this beats k linear scans (O(nk)) when k is large.

Answer

D · O(n log n + k log 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 · 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: D · O(1 + α), where α = n / m

Why this is the answer

Computing the hash costs O(1) and the expected chain length is α, so keeping α bounded by resizing gives O(1) expected time.

Answer

D · O(1 + α), where α = n / m
5.Graph theory

Answer: L = 18

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.

Handshake lemma for a tree

L + 40 = 2(L + 12) − 2
L = 18

Answer

L = 18

Shortcut: L = 2 + Σ (d − 2) over the vertices with degree d ≥ 3.

6.Graph theory

Answer: W = 26

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.

Kruskal’s algorithm

AB (1): take
AC (3): take
DE (4): take
BC (8): skip, closes a cycle
CE (18): take

Total weight

W = 1 + 3 + 4 + 18 = 26

Answer

W = 26

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