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 much stack space does a simple recursive factorial function fact(n) = n × fact(n − 1) use?

  1. AO(log n)
  2. BO(1)
  3. CO(n²)
  4. DO(n)
2.Algorithms & complexityHard

Which definition of the class P is correct?

  1. AProblems that need exponential time on every computer
  2. BProblems that can be solved in parallel
  3. CProblems whose solutions can be checked but never found in polynomial time
  4. DDecision problems solvable by a deterministic algorithm in polynomial time
3.Data structuresMedium

How does extract-min work in a binary min-heap?

  1. ASearch all leaves for the new minimum
  2. BRemove the last element of the array
  3. CRemove the root and shift all elements one place left
  4. DMove the last element to the root and sift it down
4.Data structuresHard

How can you detect whether a singly linked list contains a cycle using O(1) extra memory?

  1. AStore every visited node in a hash set
  2. BCount the nodes until the count exceeds the list length field
  3. CMove one pointer by one step and another by two steps and check whether they meet
  4. DSort the list and look for duplicates
5.Graph theoryMedium

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

|V| = 14|E| = 16
k =
6.Graph theoryHard
1521101212113ABCDEF

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

Why this is the answer

The recursion is n calls deep before any returns, and each call needs a stack frame, so it uses O(n) space.

Answer

D · O(n)
2.Algorithms & complexity

Answer: D · Decision problems solvable by a deterministic algorithm in polynomial time

Why this is the answer

P contains decision problems with a deterministic polynomial-time algorithm, such as checking whether a graph is connected.

Answer

D · Decision problems solvable by a deterministic algorithm in polynomial time
3.Data structures

Answer: D · Move the last element to the root and sift it down

Why this is the answer

The last element fills the hole at the root and is swapped with its smaller child until the heap property holds, taking O(log n).

Answer

D · Move the last element to the root and sift it down
4.Data structures

Answer: C · Move one pointer by one step and another by two steps and check whether they meet

Why this is the answer

In Floyd's algorithm, if there is a cycle the fast pointer eventually catches up with the slow one; otherwise the fast pointer reaches null.

Answer

C · Move one pointer by one step and another by two steps and check whether they meet
5.Graph theory

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

Edges of a spanning tree

14 − 1 = 13

Edges to remove

k = 16 − 13 = 3

Answer

k = 3
6.Graph theory

Answer: d(F) = 26

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): C: 15
C (15): B: 17, E: 25
B (17): D: 18
D (18): F: 30
E (25): F: 26
F (26)

Shortest path

A → C → E → F
d(F) = 26

Answer

d(F) = 26

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