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

Which algorithm finds the shortest paths from one source in a graph with non-negative edge weights?

  1. ADijkstra's algorithm
  2. BBellman–Ford is required in all cases
  3. CDepth-first search
  4. DKruskal's algorithm
2.Algorithms & complexityHard

Which statement about P and NP is correct?

  1. AIt has been proven that P ≠ NP
  2. BNP means "not polynomial"
  3. CNP problems cannot be verified quickly
  4. DEvery problem in P is also in NP
3.Data structuresMedium

What is the time complexity of searching for a key in a balanced binary search tree?

  1. AO(log n)
  2. BO(n log n)
  3. CO(1)
  4. DO(n)
4.Data structuresHard

Kahn's algorithm for topological sorting repeatedly removes vertices with in-degree 0. Which structure holds those vertices?

  1. AAn adjacency matrix recording which vertices have already been removed
  2. BA stack of all visited edges
  3. CA queue (or any collection) of vertices whose in-degree is 0
  4. DA max-heap ordered by out-degree
5.Graph theoryMedium

A connected graph has 19 vertices and 26 edges. How many edges k must be removed to leave a spanning tree?

|V| = 19|E| = 26
k =
6.Graph theoryHard
272121312510715ABCDEFG

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
  7. 7G

3Solutions

1.Algorithms & complexity

Answer: A · Dijkstra's algorithm

Why this is the answer

Dijkstra's algorithm works with non-negative weights; Bellman–Ford handles negative weights; Kruskal builds minimum spanning trees.

Answer

A · Dijkstra's algorithm
2.Algorithms & complexity

Answer: D · Every problem in P is also in NP

Why this is the answer

P ⊆ NP: if you can solve a problem quickly you can verify a solution quickly. Whether P = NP is still open.

Answer

D · Every problem in P is also in NP
3.Data structures

Answer: A · O(log n)

Why this is the answer

A balanced tree has height about log₂ n, so a search follows one path from root to leaf.

Answer

A · O(log n)
4.Data structures

Answer: C · A queue (or any collection) of vertices whose in-degree is 0

Why this is the answer

Ready vertices are kept in a queue; removing one lowers its neighbours' in-degrees, and any that reach 0 are added, giving O(V + E) time.

Answer

C · A queue (or any collection) of vertices whose in-degree is 0
5.Graph theory

Answer: k = 8

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.

Edges of a spanning tree

19 − 1 = 18

Edges to remove

k = 26 − 18 = 8

Answer

k = 8
6.Graph theory

Answer: C

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: 2
2. B (2): C: 9, D: 4, G: 12
3. D (4): E: 17, F: 16, G: 11
4. C (9)
5. G (11)
6. F (16)
7. E (17)

round 4

C

Answer

C

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