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

With coins of 1, 3 and 4 and an amount of 6, how many coins does the greedy "largest coin first" method use, compared to the optimum?

  1. AGreedy uses 2 coins; the optimum is 2
  2. BGreedy uses 3 coins; the optimum is 3
  3. CGreedy uses 3 coins; the optimum is 2
  4. DGreedy uses 4 coins; the optimum is 3
2.Algorithms & complexityHard

The Held–Karp dynamic programming algorithm solves the travelling salesman problem exactly. What is its running time for n cities?

  1. AO(2n²)
  2. BO(n³)
  3. CO(n² 2ⁿ)
  4. DO(n!)
3.Data structuresMedium

How do you find the minimum key in a binary search tree?

  1. AVisit every leaf and compare them
  2. BFollow left children from the root until there is no left child
  3. CLook at the root only
  4. DFollow right children from the root until there is no right child
4.Data structuresHard

What are the time and extra space costs of reversing a singly linked list in place?

  1. AO(n) time and O(1) extra space
  2. BO(n log n) time and O(1) extra space
  3. CO(1) time and O(1) extra space
  4. DO(n) time and O(n) extra space
5.Graph theoryMedium

A tree has 3 vertices of degree 3, 4 vertices of degree 4, and all its other vertices are leaves (degree 1). How many leaves L does it have?

3 × deg 34 × deg 4
L =
6.Graph theoryHard
1091461261593ABCDEF

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

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

3Solutions

1.Algorithms & complexity

Answer: C · Greedy uses 3 coins; the optimum is 2

Why this is the answer

Greedy takes 4 + 1 + 1 = 3 coins, but 3 + 3 uses only 2, so greedy is not optimal for this coin system; dynamic programming is.

Answer

C · Greedy uses 3 coins; the optimum is 2
2.Algorithms & complexity

Answer: C · O(n² 2ⁿ)

Why this is the answer

There are about n 2ⁿ states, each computed in O(n); this is exponential but far faster than trying all (n − 1)! tours.

Answer

C · O(n² 2ⁿ)
3.Data structures

Answer: B · Follow left children from the root until there is no left child

Why this is the answer

The leftmost node has no smaller key in the tree, so it is the minimum; the cost is proportional to the height.

Answer

B · Follow left children from the root until there is no left child
4.Data structures

Answer: A · O(n) time and O(1) extra space

Why this is the answer

Keeping three pointers (previous, current, next) lets you reverse each link in one pass without allocating new nodes.

Answer

A · O(n) time and O(1) extra space
5.Graph theory

Answer: L = 13

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.

Handshake lemma for a tree

L + 25 = 2(L + 7) − 2
L = 13

Answer

L = 13

Shortcut: L = 2 + Σ (d − 2) over the vertices with degree d ≥ 3.

6.Graph theory

Answer: B

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: 10, C: 9
2. C (9): E: 21
3. B (10): D: 16, E: 13
4. E (13): F: 22
5. D (16)
6. F (22)

round 3

B

Answer

B

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