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 does Prim's algorithm build a minimum spanning tree?

  1. AIt sorts all edges by weight and adds each one unless it would form a cycle in the forest
  2. BIt grows one tree from a start vertex, adding the cheapest edge that leaves the tree
  3. CIt runs breadth-first search and keeps the BFS tree
  4. DIt removes the most expensive edge until no cycles remain
2.Algorithms & complexityHard

Which technique gives an expected O(n log n) running time for quicksort on any input?

  1. AAlways choosing the first element
  2. BUsing recursion only on the left side
  3. CSorting the input before running quicksort
  4. DChoosing the pivot uniformly at random
3.Data structuresMedium

An adjacency matrix for a graph with V vertices uses how much memory?

  1. AO(E)
  2. BO(V²)
  3. CO(log V)
  4. DO(V + E)
4.Data structuresHard

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

  1. ASort the list and look for duplicates
  2. BStore every visited node in a hash set
  3. CCount the nodes until the count exceeds the list length field
  4. DMove one pointer by one step and another by two steps and check whether they meet
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
21441711712131510ABCDEFG

Find the total weight W of a minimum spanning tree of the weighted graph.

|V| = 7|E| = 10
W =

3Solutions

1.Algorithms & complexity

Answer: B · It grows one tree from a start vertex, adding the cheapest edge that leaves the tree

Why this is the answer

Prim's algorithm, with a priority queue of crossing edges, runs in O(E log V) with a binary heap.

Answer

B · It grows one tree from a start vertex, adding the cheapest edge that leaves the tree
2.Algorithms & complexity

Answer: D · Choosing the pivot uniformly at random

Why this is the answer

With a random pivot, the expected running time is O(n log n) for every input; bad cases still exist but are very unlikely.

Answer

D · Choosing the pivot uniformly at random
3.Data structures

Answer: B · O(V²)

Why this is the answer

An adjacency matrix stores V × V entries, efficient for dense graphs; adjacency lists use O(V + E), better for sparse graphs.

Answer

B · O(V²)
4.Data structures

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

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

Answer: neither

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) = 1, deg(B) = 3, deg(C) = 3, deg(D) = 2, deg(E) = 3

Odd vertices

A, B, C, E → 4
neither

Answer

neither
6.Graph theory

Answer: W = 47

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.

Kruskal’s algorithm

AC (2): take
BD (4): take
EF (7): take
GE (10): take
DE (11): take
GB (12): skip, closes a cycle
GC (13): take

Total weight

W = 2 + 4 + 7 + 10 + 11 + 13 = 47

Answer

W = 47

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