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 worst-case time complexity of quicksort?

  1. AO(log n)
  2. BO(n log n)
  3. CO(n)
  4. DO(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. BBoth mean the problem has no algorithm at all
  3. CAn undecidable problem has no algorithm for all inputs; an intractable one has one, but it is too slow
  4. DIntractable problems cannot be solved by any algorithm, while undecidable ones only need exponential time
3.Data structuresMedium

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

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

Which property must a red-black tree satisfy?

  1. AEvery red node must have red children, so red nodes always form unbroken chains to the leaves
  2. BEvery path from a node to its descendant leaves has the same number of black nodes
  3. CEvery node must be red
  4. DThe root must be red
5.Graph theoryMedium

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

K8
H =
6.Graph theoryHard
141617191114ABCDE

Prim’s algorithm builds a minimum spanning tree starting from vertex D. Click the edge it adds as edge number 3.

start: Dk = 3
  1. 1edge AB
  2. 2edge AC
  3. 3edge BC
  4. 4edge BD
  5. 5edge CE
  6. 6edge DE
  7. 7edge BE

3Solutions

1.Algorithms & complexity

Answer: D · O(n²)

Why this is the answer

With consistently bad pivots (e.g. already sorted input and first-element pivot) partitions are unbalanced, giving O(n²). The average case is O(n log n).

Answer

D · O(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: A · 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

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

Answer: B · Every path from a node to its descendant leaves has the same number of black nodes

Why this is the answer

Red-black rules: nodes are red or black, root is black, red nodes have black children, and all paths have equal black-height, keeping height ≤ 2 log₂(n + 1).

Answer

B · Every path from a node to its descendant leaves has the same number of black nodes
5.Graph theory

Answer: H = 2520

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 = (8 − 1)!/2 = 5040/2 = 2520

Answer

H = 2520
6.Graph theory

Answer: edge AB

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.

Prim’s algorithm

1. DE (11)
2. BE (14)
3. AB (1)
4. AC (4)

edge number 3

AB

Answer

edge AB

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