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 the Floyd–Warshall algorithm compute, and how fast?

  1. AShortest paths from one source vertex to all others in O(V + E)
  2. BShortest paths between all pairs of vertices in O(V³)
  3. CA topological order in O(V²)
  4. DA minimum spanning tree in O(E log V)
2.Algorithms & complexityHard

Topological sorting is possible only for:

  1. AComplete graphs
  2. BGraphs with negative weights
  3. CUndirected graphs
  4. DDirected acyclic graphs
3.Data structuresMedium

What is the cost of inserting an element in the middle of an array of n elements?

  1. AO(n), because later elements must shift
  2. BO(log n), because of binary search
  3. CO(n²), because each element moves n times
  4. DO(1), because the index is known
4.Data structuresHard

Which problem of linear probing does double hashing mainly reduce?

  1. AThe O(n) cost of reading a key's value
  2. BThe need to store keys in the table
  3. CPrimary clustering, where long runs of occupied slots form
  4. DThe need for a hash function
5.Graph theoryMedium

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

4 × deg 3
L =
6.Graph theoryHard
1317276119113158ABCDEFG

Kruskal’s algorithm builds a minimum spanning tree. Click the edge it adds as edge number 5; skipped edges do not count.

k = 5
  1. 1edge AB
  2. 2edge AC
  3. 3edge BC
  4. 4edge BD
  5. 5edge CE
  6. 6edge DE
  7. 7edge DF
  8. 8edge EF
  9. 9edge GB
  10. 10edge GC
  11. 11edge GD

3Solutions

1.Algorithms & complexity

Answer: B · Shortest paths between all pairs of vertices in O(V³)

Why this is the answer

Floyd–Warshall is a dynamic programming algorithm that allows each vertex in turn as an intermediate point, using O(V³) time.

Answer

B · Shortest paths between all pairs of vertices in O(V³)
2.Algorithms & complexity

Answer: D · Directed acyclic graphs

Why this is the answer

A topological order exists if and only if the directed graph has no cycles; it can be found in O(V + E) with DFS or Kahn's algorithm.

Answer

D · Directed acyclic graphs
3.Data structures

Answer: A · O(n), because later elements must shift

Why this is the answer

All elements after the insertion point move one position to the right, which takes time proportional to n.

Answer

A · O(n), because later elements must shift
4.Data structures

Answer: C · Primary clustering, where long runs of occupied slots form

Why this is the answer

Linear probing steps by 1, so occupied runs grow and merge; double hashing uses a second hash for the step size so different keys probe different sequences.

Answer

C · Primary clustering, where long runs of occupied slots form
5.Graph theory

Answer: L = 6

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 + 12 = 2(L + 4) − 2
L = 6

Answer

L = 6

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

6.Graph theory

Answer: edge EF

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

1. DE (1)
2. BC (2)
3. GB (3)
4. CE (6)
5. EF (11)
6. AB (13)

edge number 5

EF

Answer

edge EF

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