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

The time complexity of naive recursive Fibonacci (fib(n) = fib(n−1) + fib(n−2)) is:

  1. ALinear
  2. BExponential
  3. CConstant
  4. DLogarithmic
2.Algorithms & complexityHard

What is the difference between an undecidable problem and an intractable one?

  1. ABoth mean the problem has no algorithm at all
  2. BUndecidable problems are in NP, while intractable problems are in P
  3. CAn undecidable problem has no algorithm for all inputs; an intractable one has one, but it is too slow
  4. DIntractable problems cannot be solved by any algorithm, while undecidable ones only need exponential time
3.Data structuresMedium

AVL trees and red-black trees guarantee:

  1. AThat keys are stored in insertion order
  2. BConstant-time search in every case
  3. CThat no node has two children
  4. DO(log n) height through rebalancing
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. BStore every visited node in a hash set
  3. CSort the list and look for duplicates
  4. DMove one pointer by one step and another by two steps and check whether they meet
5.Graph theoryMedium
ABCDEEuler circuitEuler path, no circuitneither

Does the connected graph have an Euler circuit, an Euler path that is not a circuit, or neither? Click your answer.

|V| = 5|E| = 6
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
72598914ABCDEF

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: B · Exponential

Why this is the answer

The call tree grows roughly like φⁿ (about 1.618ⁿ). Memoisation reduces it to O(n).

Answer

B · Exponential
2.Algorithms & complexity

Answer: C · An undecidable problem has no algorithm for all inputs; an intractable one has one, but it is too slow

Why this is the answer

The halting problem has no algorithm at all; an NP-hard problem such as TSP can be solved by brute force, just not in known polynomial time.

Answer

C · An undecidable problem has no algorithm for all inputs; an intractable one has one, but it is too slow
3.Data structures

Answer: D · O(log n) height through rebalancing

Why this is the answer

Self-balancing trees keep height logarithmic, so search, insert and delete are O(log n) in the worst case.

Answer

D · O(log n) height through rebalancing
4.Data structures

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

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

Answer: Euler circuit

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.

Degrees

deg(A) = 2, deg(B) = 4, deg(C) = 2, deg(D) = 2, deg(E) = 2

Odd vertices

0
Euler circuit

Answer

Euler circuit
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: 7, C: 2
2. C (2): E: 10
3. B (7): D: 16
4. E (10): F: 11
5. F (11)
6. D (16)

round 3

B

Answer

B

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