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

How many levels does the recursion of merge sort have for an array of n elements?

  1. AAbout n / 2
  2. BAbout log₂ n
  3. CAbout n
  4. DAbout √n
2.Algorithms & complexityHard

What is the difference between an undecidable problem and an intractable one?

  1. AUndecidable problems are in NP, while intractable problems are in P
  2. BIntractable problems cannot be solved by any algorithm, while undecidable ones only need exponential time
  3. CAn undecidable problem has no algorithm for all inputs; an intractable one has one, but it is too slow
  4. DBoth mean the problem has no algorithm at all
3.Data structuresMedium

Why is traversing an array often much faster in practice than traversing a linked list of the same length?

  1. ALinked lists always store elements on disk
  2. BArray elements are contiguous, so they make good use of the CPU cache
  3. CArray traversal is O(1) in total, while linked list traversal is O(n)
  4. DArrays use fewer instructions to compare values
4.Data structuresHard

What are the time and extra space costs of reversing a singly linked list in place?

  1. AO(n) time and O(1) extra space
  2. BO(n) time and O(n) extra space
  3. CO(1) time and O(1) extra space
  4. DO(n log n) time and O(1) extra space
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
9213413123136ABCDEFG

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 · About log₂ n

Why this is the answer

Halving from n down to 1 takes about log₂ n levels, and each level does O(n) merging work, giving O(n log n).

Answer

B · About log₂ n
2.Algorithms & complexity

Answer: C · An undecidable problem has no algorithm for all inputs; an intractable one has one, but it is too slow

Why this is the answer

The halting problem has no algorithm at all; an NP-hard problem such as TSP can be solved by brute force, just not in known polynomial time.

Answer

C · An undecidable problem has no algorithm for all inputs; an intractable one has one, but it is too slow
3.Data structures

Answer: B · Array elements are contiguous, so they make good use of the CPU cache

Why this is the answer

Contiguous memory gives good locality of reference, while linked nodes may be scattered and cause many cache misses.

Answer

B · Array elements are contiguous, so they make good use of the CPU cache
4.Data structures

Answer: A · O(n) time and O(1) extra space

Why this is the answer

Keeping three pointers (previous, current, next) lets you reverse each link in one pass without allocating new nodes.

Answer

A · O(n) time and O(1) extra space
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) = 34

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: 9
B (9): C: 11, D: 22, G: 12
C (11): E: 15
G (12)
E (15)
D (22): F: 34
F (34)

Shortest path

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

Answer

d(F) = 34

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