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

What does it mean that a problem has optimal substructure?

  1. AThe problem can be solved in constant time
  2. BThe problem has exactly one optimal solution, which every subproblem shares
  3. CAn optimal solution can be built from optimal solutions of its subproblems
  4. DEvery subproblem has the same size
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. BBinary search needs at least twice the memory
  3. CReaching the middle element takes O(n) steps, since there is no direct index access
  4. DComparisons on linked list nodes are slower
3.Data structuresMedium

What balance condition does an AVL tree maintain at every node?

  1. AThe heights of the left and right subtrees differ by at most 1
  2. BBoth subtrees of every node contain exactly the same number of nodes
  3. CEvery node is coloured red or black
  4. DAll leaves are at exactly the same depth
4.Data structuresHard

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

  1. AMove one pointer by one step and another by two steps and check whether they meet
  2. BSort the list and look for duplicates
  3. CStore every visited node in a hash set
  4. DCount the nodes until the count exceeds the list length field
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| = 10
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
131714583191ABCDEF

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

|V| = 6|E| = 8
W =

3Solutions

1.Algorithms & complexity

Answer: C · An optimal solution can be built from optimal solutions of its subproblems

Why this is the answer

Optimal substructure is required for both greedy algorithms and dynamic programming to produce correct answers.

Answer

C · An optimal solution can be built from optimal solutions of its subproblems
2.Algorithms & complexity

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

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

Answer: A · The heights of the left and right subtrees differ by at most 1

Why this is the answer

The balance factor (height left − height right) must be −1, 0 or 1; rotations restore it after inserts and deletes.

Answer

A · The heights of the left and right subtrees differ by at most 1
4.Data structures

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

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

Odd vertices

B, D, F, G → 4
neither

Answer

neither
6.Graph theory

Answer: W = 44

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

BE (1): take
DE (3): take
BD (5): skip, closes a cycle
CE (8): take
AB (13): take
BC (14): skip, closes a cycle
AC (17): skip, closes a cycle
EF (19): take

Total weight

W = 1 + 3 + 8 + 13 + 19 = 44

Answer

W = 44

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