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

Breadth-first search on an unweighted graph finds:

  1. AA topological order in all graphs
  2. BThe minimum spanning tree
  3. CShortest paths in graphs that contain negative edge weights
  4. DShortest paths in number of edges from the start node
2.Algorithms & complexityHard

The halting problem shows that:

  1. ALoops should be avoided
  2. BEvery program eventually halts
  3. CSome programs run faster on faster computers, so halting depends on hardware
  4. DNo algorithm can decide for every program and input whether it halts
3.Data structuresMedium

How long does a search for a word of length L take in a trie with a fixed alphabet?

  1. AO(n), where n is the number of words
  2. BO(log n), where n is the number of words
  3. CO(L × n)
  4. DO(L), independent of how many words are stored
4.Data structuresHard

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

  1. AEqual hash values imply equal keys
  2. BHash values must be prime numbers
  3. CDifferent keys must have different hash values
  4. DEqual keys must have equal hash values
5.Graph theoryMedium
ABCDEEuler circuitEuler path, no circuitneither

Does the connected graph have an Euler circuit, an Euler path that is not a circuit, or neither? Click your answer.

|V| = 5|E| = 6
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
212571014361ABCDEFG

Dijkstra’s algorithm runs from A. Click the vertex that is settled (made permanent) in round 3; A itself is round 1.

start: Around 3
  1. 1A
  2. 2B
  3. 3C
  4. 4D
  5. 5E
  6. 6F
  7. 7G

3Solutions

1.Algorithms & complexity

Answer: D · Shortest paths in number of edges from the start node

Why this is the answer

BFS visits nodes in order of distance (edges) from the source, so it finds shortest unweighted paths in O(V + E).

Answer

D · Shortest paths in number of edges from the start node
2.Algorithms & complexity

Answer: D · No algorithm can decide for every program and input whether it halts

Why this is the answer

Turing showed the halting problem is undecidable: assuming a decider exists leads to a contradiction with a program that does the opposite.

Answer

D · No algorithm can decide for every program and input whether it halts
3.Data structures

Answer: D · O(L), independent of how many words are stored

Why this is the answer

Each character selects one child, so a lookup takes L steps no matter how many words the trie contains.

Answer

D · O(L), independent of how many words are stored
4.Data structures

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

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

Answer: Euler circuit

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.

Degrees

deg(A) = 2, deg(B) = 4, deg(C) = 2, deg(D) = 2, deg(E) = 2

Odd vertices

0
Euler circuit

Answer

Euler circuit
6.Graph theory

Answer: C

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

1. A (0): B: 2, C: 12
2. B (2): C: 7, D: 9
3. C (7): E: 17
4. D (9): G: 15
5. G (15): E: 16
6. E (16): F: 19
7. F (19)

round 3

C

Answer

C

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