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

How does the Bellman–Ford algorithm detect a negative-weight cycle reachable from the source?

  1. AIt checks whether any edge has a negative weight
  2. BAfter V − 1 rounds, it checks whether any edge can still be relaxed
  3. CIt runs Dijkstra's algorithm twice and compares the two distance results
  4. DIt counts the cycles with depth-first search
3.Data structuresMedium

An in-order traversal of a binary search tree visits the keys in:

  1. AInsertion order
  2. BDescending order always
  3. CAscending sorted order
  4. DLevel order
4.Data structuresHard

What is the running time of breadth-first search on a graph with V vertices stored as an adjacency matrix?

  1. AO(V²)
  2. BO(V + E)
  3. CO(V)
  4. DO(E log V)
5.Graph theoryMedium

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

K7
H =
6.Graph theoryHard
111978141114ABCDEF

Use Dijkstra’s algorithm to find the length d(C) of the shortest path from A to C in the weighted graph.

start: Aend: C
d(C) =

3Solutions

1.Algorithms & complexity

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

C · O(n)
2.Algorithms & complexity

Answer: B · After V − 1 rounds, it checks whether any edge can still be relaxed

Why this is the answer

All true shortest distances are found within V − 1 rounds; if an edge can still be improved, a negative cycle must exist.

Answer

B · After V − 1 rounds, it checks whether any edge can still be relaxed
3.Data structures

Answer: C · Ascending sorted order

Why this is the answer

Visiting the left subtree, then the node, then the right subtree outputs BST keys in sorted order.

Answer

C · Ascending sorted order
4.Data structures

Answer: A · O(V²)

Why this is the answer

Each of the V vertices scans a row of V entries, giving O(V²); with adjacency lists BFS is O(V + E).

Answer

A · O(V²)
5.Graph theory

Answer: H = 360

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 = (7 − 1)!/2 = 720/2 = 360

Answer

H = 360
6.Graph theory

Answer: d(C) = 10

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: 1, C: 11
B (1): C: 10, D: 8, E: 15
D (8): F: 19
C (10)
E (15)
F (19)

Shortest path

A → B → C
d(C) = 10

Answer

d(C) = 10

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