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

Which statement about a recursive function without a reachable base case is correct?

  1. AThe compiler always turns it into a loop that ends safely
  2. BIt keeps calling itself until the call stack overflows
  3. CIt runs in O(1) time
  4. DIt returns 0 automatically
2.Algorithms & complexityHard

What is the time complexity of building a binary heap from n unsorted elements with the bottom-up method?

  1. AO(n)
  2. BO(n log n)
  3. CO(n²)
  4. DO(log n)
3.Data structuresMedium

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

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

A Bloom filter can answer "is this element in the set?" with:

  1. APossible false positives but no false negatives
  2. BPossible false negatives but no false positives
  3. CExact answers always
  4. DAnswers only for numbers
5.Graph theoryMedium
ABCDEFEuler 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| = 6|E| = 7
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
14142151214978ABCDEF

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 · It keeps calling itself until the call stack overflows

Why this is the answer

Without a base case the recursion never stops; in practice memory for stack frames runs out and the program crashes.

Answer

B · It keeps calling itself until the call stack overflows
2.Algorithms & complexity

Answer: A · O(n)

Why this is the answer

Summing sift-down costs over the levels gives a convergent series, so heapify runs in linear time.

Answer

A · O(n)
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: A · Possible false positives but no false negatives

Why this is the answer

If any bit for an item is 0, it is definitely absent; if all are 1 it is probably present. Bloom filters trade accuracy for very little memory.

Answer

A · Possible false positives but no false negatives
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, deg(F) = 2

Odd vertices

0
Euler circuit

Answer

Euler circuit
6.Graph theory

Answer: d(F) = 29

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: 14, C: 14
B (14): D: 29, E: 22
C (14)
E (22): F: 29
D (29)
F (29)

Shortest path

A → B → E → F
d(F) = 29

Answer

d(F) = 29

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