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: for i = 1 to n: (j = 1; while j < n: j = j × 2)?

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

Which definition of the class P is correct?

  1. AProblems that can be solved in parallel
  2. BProblems whose solutions can be checked but never found in polynomial time
  3. CDecision problems solvable by a deterministic algorithm in polynomial time
  4. DProblems that need exponential time on every computer
3.Data structuresMedium

How is a new element inserted into a binary heap?

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

Which property must a red-black tree satisfy?

  1. AThe root must be red
  2. BEvery node must be red
  3. CEvery path from a node to its descendant leaves has the same number of black nodes
  4. DEvery red node must have red children, so red nodes always form unbroken chains to the leaves
5.Graph theoryMedium

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

K5
H =
6.Graph theoryHard
413114415122ABCDEF

Dijkstra’s algorithm runs from A. Click the vertex that is settled (made permanent) in round 4; A itself is round 1.

start: Around 4
  1. 1A
  2. 2B
  3. 3C
  4. 4D
  5. 5E
  6. 6F

3Solutions

1.Algorithms & complexity

Answer: C · O(n log n)

Why this is the answer

The inner loop runs about log₂ n times for each of the n outer iterations, giving O(n log n).

Answer

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

Answer: C · Decision problems solvable by a deterministic algorithm in polynomial time

Why this is the answer

P contains decision problems with a deterministic polynomial-time algorithm, such as checking whether a graph is connected.

Answer

C · Decision problems solvable by a deterministic algorithm in polynomial time
3.Data structures

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

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

Answer: C · Every path from a node to its descendant leaves has the same number of black nodes

Why this is the answer

Red-black rules: nodes are red or black, root is black, red nodes have black children, and all paths have equal black-height, keeping height ≤ 2 log₂(n + 1).

Answer

C · Every path from a node to its descendant leaves has the same number of black nodes
5.Graph theory

Answer: H = 12

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 = (5 − 1)!/2 = 24/2 = 12

Answer

H = 12
6.Graph theory

Answer: D

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

1. A (0): B: 4, C: 13
2. B (4): D: 8, E: 6
3. E (6): C: 10
4. D (8): F: 20
5. C (10)
6. F (20)

round 4

D

Answer

D

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