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

What is the time complexity of the Bellman–Ford algorithm on a graph with V vertices and E edges?

  1. AO(V³ × E)
  2. BO(V × E)
  3. CO(V + E)
  4. DO(E log V)
2.Algorithms & complexityHard

Insertion sort runs in O(n) on sorted input. Does this contradict the Ω(n log n) lower bound for comparison sorting?

  1. AYes, the lower bound is therefore wrong
  2. BYes, but only for arrays shorter than 100
  3. CNo, the lower bound applies to the worst case over all inputs, not to every input
  4. DNo, because insertion sort is not a comparison sort
3.Data structuresMedium

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

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

Which problem of linear probing does double hashing mainly reduce?

  1. AThe need for a hash function
  2. BPrimary clustering, where long runs of occupied slots form
  3. CThe O(n) cost of reading a key's value
  4. DThe need to store keys in the table
5.Graph theoryMedium

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

K4
H =
6.Graph theoryHard
3416831014ABCDEF

Use Dijkstra’s algorithm to find the length d(F) of the shortest path from A to F in the weighted graph.

start: Aend: F
d(F) =

3Solutions

1.Algorithms & complexity

Answer: B · O(V × E)

Why this is the answer

Each of the V − 1 rounds relaxes all E edges, giving O(VE); in exchange it handles negative edge weights.

Answer

B · O(V × E)
2.Algorithms & complexity

Answer: C · No, the lower bound applies to the worst case over all inputs, not to every input

Why this is the answer

The bound says every comparison sort needs about n log n comparisons on some input of size n; special inputs can be much faster.

Answer

C · No, the lower bound applies to the worst case over all inputs, not to every input
3.Data structures

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

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

Answer: B · Primary clustering, where long runs of occupied slots form

Why this is the answer

Linear probing steps by 1, so occupied runs grow and merge; double hashing uses a second hash for the step size so different keys probe different sequences.

Answer

B · Primary clustering, where long runs of occupied slots form
5.Graph theory

Answer: H = 3

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 = (4 − 1)!/2 = 6/2 = 3

Answer

H = 3
6.Graph theory

Answer: d(F) = 19

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

Each line: the vertex settled, its final distance, and the neighbours whose distance improves.

A (0): B: 3, C: 4
B (3): D: 9, E: 17
C (4): E: 12
D (9): F: 19
E (12)
F (19)

Shortest path

A → B → D → F
d(F) = 19

Answer

d(F) = 19

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