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

Why does dynamic programming give no real speed-up for merge sort?

  1. AIts subproblems do not overlap, so there is nothing to reuse
  2. BDynamic programming only works on graph problems, not on arrays
  3. CMerge sort is already O(n)
  4. DMerge sort has no recursive structure
2.Algorithms & complexityHard

Which of these satisfiability problems is known to be solvable in polynomial time?

  1. AGeneral SAT on formulas in conjunctive normal form
  2. BCircuit satisfiability
  3. C3-SAT, where each clause has exactly three literals
  4. D2-SAT, where each clause has at most two literals
3.Data structuresMedium

How long does it take to check whether the edge (u, v) exists using an adjacency matrix?

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

How can you detect whether a singly linked list contains a cycle using O(1) extra memory?

  1. ACount the nodes until the count exceeds the list length field
  2. BMove one pointer by one step and another by two steps and check whether they meet
  3. CStore every visited node in a hash set
  4. DSort the list and look for duplicates
5.Graph theoryMedium

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

|V| = 8|E| = 14
k =
6.Graph theoryHard
1721961085ABCDE

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

k = 3
  1. 1edge AB
  2. 2edge AC
  3. 3edge BC
  4. 4edge BD
  5. 5edge CE
  6. 6edge DE
  7. 7edge BE

3Solutions

1.Algorithms & complexity

Answer: A · Its subproblems do not overlap, so there is nothing to reuse

Why this is the answer

Merge sort's halves are disjoint and each is solved once; DP helps only when subproblems recur, as in Fibonacci.

Answer

A · Its subproblems do not overlap, so there is nothing to reuse
2.Algorithms & complexity

Answer: D · 2-SAT, where each clause has at most two literals

Why this is the answer

2-SAT is in P (linear time via strongly connected components), while 3-SAT is NP-complete.

Answer

D · 2-SAT, where each clause has at most two literals
3.Data structures

Answer: D · O(1)

Why this is the answer

The matrix entry at row u, column v tells you immediately whether the edge exists; an adjacency list may need to scan u's neighbours.

Answer

D · O(1)
4.Data structures

Answer: B · Move one pointer by one step and another by two steps and check whether they meet

Why this is the answer

In Floyd's algorithm, if there is a cycle the fast pointer eventually catches up with the slow one; otherwise the fast pointer reaches null.

Answer

B · Move one pointer by one step and another by two steps and check whether they meet
5.Graph theory

Answer: k = 7

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

8 − 1 = 7

Edges to remove

k = 14 − 7 = 7

Answer

k = 7
6.Graph theory

Answer: edge BD

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. AC (2)
2. BE (5)
3. BD (6)
4. CE (10)

edge number 3

BD

Answer

edge BD

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