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

How much memory does an adjacency list use for a graph with V vertices and E edges?

  1. AO(E²)
  2. BO(V²)
  3. CO(V × E)
  4. DO(V + E)
4.Data structuresHard

The time complexity of decrease-key in a binary heap (given the element's position) is:

  1. AO(1)
  2. BO(n)
  3. CO(n log n)
  4. DO(log n)
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
138917103157ABCDEF

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

|V| = 6|E| = 8
W =

3Solutions

1.Algorithms & complexity

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

D · 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: D · O(V + E)

Why this is the answer

Each vertex has a list and each edge appears once (directed) or twice (undirected), giving O(V + E).

Answer

D · O(V + E)
4.Data structures

Answer: D · O(log n)

Why this is the answer

After decreasing the key, the element sifts up at most the height of the heap. Fibonacci heaps achieve O(1) amortised decrease-key.

Answer

D · O(log n)
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: W = 42

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

DF (3): take
BE (7): take
AC (8): take
BC (9): take
CE (10): skip, closes a cycle
AB (13): skip, closes a cycle
EF (15): take

Total weight

W = 3 + 7 + 8 + 9 + 15 = 42

Answer

W = 42

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