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 is the time complexity of multiplying two n × n matrices with the standard triple loop?

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

To show that a new problem X is NP-hard, what must you do?

  1. AReduce X to a known NP-hard problem in polynomial time
  2. BShow that X has no polynomial algorithm for small inputs
  3. CReduce a known NP-hard problem to X in polynomial time
  4. DShow that X can be verified in polynomial time
3.Data structuresMedium

How is a new element inserted into a binary heap?

  1. AInsert it at its sorted position by shifting all of the larger elements one place right
  2. BPlace it at the end of the array and sift it up while it violates the heap property
  3. CRebuild the whole heap from scratch
  4. DPlace it at the root and sift it down
4.Data structuresHard

In Kruskal's minimum spanning tree algorithm, what is the union-find structure used for?

  1. AChecking whether an edge's two endpoints are already connected
  2. BChoosing the starting vertex
  3. CSorting the edges by weight
  4. DStoring each vertex's current distance from the source during the search
5.Graph theoryMedium
ABCDEFEuler 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| = 6|E| = 7
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
4979128813ABCDEF

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

Why this is the answer

There are n² entries and each needs n multiplications, giving n³ operations.

Answer

C · O(n³)
2.Algorithms & complexity

Answer: C · Reduce a known NP-hard problem to X in polynomial time

Why this is the answer

If a known hard problem can be transformed into X efficiently, a fast algorithm for X would solve the known problem too.

Answer

C · Reduce a known NP-hard problem to X in polynomial time
3.Data structures

Answer: B · Place it at the end of the array and sift it up while it violates the heap property

Why this is the answer

Adding at the end keeps the tree complete; swapping with the parent restores the order in O(log n) steps.

Answer

B · Place it at the end of the array and sift it up while it violates the heap property
4.Data structures

Answer: A · Checking whether an edge's two endpoints are already connected

Why this is the answer

Find tells whether both endpoints are in the same component; if not, the edge is added and union merges the components.

Answer

A · Checking whether an edge's two endpoints are already connected
5.Graph theory

Answer: Euler path, no 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) = 1, deg(B) = 4, deg(C) = 2, deg(D) = 2, deg(E) = 3, deg(F) = 2

Odd vertices

A, E → 2
Euler path, no circuit

Answer

Euler path, no circuit

The Euler path starts at one odd vertex and ends at the other.

6.Graph theory

Answer: d(F) = 21

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: 4
C (4): B: 13, E: 13
B (13): D: 20
E (13): F: 21
D (20)
F (21)

Shortest path

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

Answer

d(F) = 21

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