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 running time of LSD radix sort on n integers with d digits in base k?

  1. AO(n log n)
  2. BO(n²)
  3. CO(d(n + k))
  4. DO(dn log k)
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

Which data structure is used to check whether the brackets in "{[()]}" are balanced?

  1. AA binary search tree
  2. BA queue
  3. CA hash table
  4. DA stack
4.Data structuresHard

For a hash table to work correctly, which rule must hash and equality follow?

  1. AHash values must be prime numbers
  2. BEqual keys must have equal hash values
  3. CEqual hash values imply equal keys
  4. DDifferent keys must have different hash values
5.Graph theoryMedium

A connected graph has 11 vertices and 22 edges. How many edges k must be removed to leave a spanning tree?

|V| = 11|E| = 22
k =
6.Graph theoryHard
111116153113103ABCDEFG

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: C · O(d(n + k))

Why this is the answer

Each of the d passes is a counting sort costing O(n + k), so for fixed d and k the total is linear in n.

Answer

C · O(d(n + k))
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: D · A stack

Why this is the answer

Push each opening bracket and pop when a closing bracket appears; it must match the popped bracket and the stack must be empty at the end.

Answer

D · A stack
4.Data structures

Answer: B · Equal keys must have equal hash values

Why this is the answer

If two equal keys hashed differently they would be stored in different buckets and lookups would fail; unequal keys may still share a hash.

Answer

B · Equal keys must have equal hash values
5.Graph theory

Answer: k = 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.

Edges of a spanning tree

11 − 1 = 10

Edges to remove

k = 22 − 10 = 12

Answer

k = 12
6.Graph theory

Answer: d(F) = 20

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: 11, C: 1
C (1): E: 16, G: 14
B (11): D: 17, G: 12
G (12): E: 15
E (15)
D (17): F: 20
F (20)

Shortest path

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

Answer

d(F) = 20

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