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 runs breadth-first search and keeps the BFS tree
  3. CIt grows one tree from a start vertex, adding the cheapest edge that leaves the tree
  4. DIt removes the most expensive edge until no cycles remain
2.Algorithms & complexityHard

Why does binary search not give O(log n) time on a singly linked list?

  1. ALinked lists cannot be sorted
  2. BReaching the middle element takes O(n) steps, since there is no direct index access
  3. CBinary search needs at least twice the memory
  4. DComparisons on linked list nodes are slower
3.Data structuresMedium

A node in a binary search tree has a right subtree. Where is its in-order successor?

  1. AThe leftmost node of its right subtree
  2. BIts right child, always
  3. CThe rightmost node of its left subtree
  4. DIts parent, always
4.Data structuresHard

Which problem of linear probing does double hashing mainly reduce?

  1. APrimary clustering, where long runs of occupied slots form
  2. BThe O(n) cost of reading a key's value
  3. CThe need to store keys in the table
  4. DThe need for a hash function
5.Graph theoryMedium
ABCDEFGEuler 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| = 7|E| = 9
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
1512171118139615ABCDEFG

Kruskal’s algorithm builds a minimum spanning tree. Click the edge it adds as edge number 2; skipped edges do not count.

k = 2
  1. 1edge AB
  2. 2edge AC
  3. 3edge BD
  4. 4edge CE
  5. 5edge DE
  6. 6edge DF
  7. 7edge GB
  8. 8edge GC
  9. 9edge GD
  10. 10edge GE

3Solutions

1.Algorithms & complexity

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

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

Answer: B · Reaching the middle element takes O(n) steps, since there is no direct index access

Why this is the answer

Binary search needs O(1) access to the middle; on a linked list walking there costs linear time, so the total is O(n).

Answer

B · Reaching the middle element takes O(n) steps, since there is no direct index access
3.Data structures

Answer: A · The leftmost node of its right subtree

Why this is the answer

All larger keys close to the node are in its right subtree, and the smallest of those is the leftmost node there.

Answer

A · The leftmost node of its right subtree
4.Data structures

Answer: A · Primary clustering, where long runs of occupied slots form

Why this is the answer

Linear probing steps by 1, so occupied runs grow and merge; double hashing uses a second hash for the step size so different keys probe different sequences.

Answer

A · Primary clustering, where long runs of occupied slots form
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) = 4, deg(E) = 2, deg(F) = 2, deg(G) = 2

Odd vertices

0
Euler circuit

Answer

Euler circuit
6.Graph theory

Answer: edge AC

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

1. AB (1)
2. AC (5)
3. GD (6)
4. GC (9)
5. DE (11)
6. DF (18)

edge number 2

AC

Answer

edge AC

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