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. ADynamic programming only works on graph problems, not on arrays
  2. BMerge sort is already O(n)
  3. CIts subproblems do not overlap, so there is nothing to reuse
  4. DMerge sort has no recursive structure
2.Algorithms & complexityHard

Shortest simple paths can be found in polynomial time. What is known about finding the longest simple path between two vertices in a general graph?

  1. AIt is NP-hard
  2. BIt can be solved by Dijkstra's algorithm with negated weights
  3. CIt is undecidable
  4. DIt is always solvable in O(V + E)
3.Data structuresMedium

How long does a search for a word of length L take in a trie with a fixed alphabet?

  1. AO(log n), where n is the number of words
  2. BO(n), where n is the number of words
  3. CO(L), independent of how many words are stored
  4. DO(L × n)
4.Data structuresHard

For each element of an array you want the next greater element to its right, in O(n) total time. Which structure helps?

  1. AA stack that keeps elements waiting for their answer
  2. BA hash table of all elements
  3. CA queue that holds every pair of elements
  4. DA binary search tree rebuilt for each element
5.Graph theoryMedium
ABCDEFGEuler 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| = 7|E| = 9
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
1021311144713913ABCDEFG

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

3Solutions

1.Algorithms & complexity

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

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

Answer: A · It is NP-hard

Why this is the answer

A longest simple path of length V − 1 is a Hamiltonian path, an NP-complete problem; on directed acyclic graphs, however, it is solvable in linear time.

Answer

A · It is NP-hard
3.Data structures

Answer: C · O(L), independent of how many words are stored

Why this is the answer

Each character selects one child, so a lookup takes L steps no matter how many words the trie contains.

Answer

C · O(L), independent of how many words are stored
4.Data structures

Answer: A · A stack that keeps elements waiting for their answer

Why this is the answer

Scanning left to right, pop every stacked element smaller than the current one (the current element is their answer), then push it; each element moves at most twice.

Answer

A · A stack that keeps elements waiting for their answer
5.Graph theory

Answer: neither

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) = 1, deg(B) = 3, deg(C) = 3, deg(D) = 3, deg(E) = 3, deg(F) = 1, deg(G) = 4

Odd vertices

A, B, C, D, E, F → 6
neither

Answer

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

round 3

B

Answer

B

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