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 is the time complexity of the standard dynamic programming algorithm for the longest common subsequence of strings of lengths m and n?

  1. AO(mn)
  2. BO(m + n)
  3. CO(2m+n)
  4. DO(mn log n)
2.Algorithms & complexityHard

How does the Bellman–Ford algorithm detect a negative-weight cycle reachable from the source?

  1. AAfter V − 1 rounds, it checks whether any edge can still be relaxed
  2. BIt counts the cycles with depth-first search
  3. CIt runs Dijkstra's algorithm twice and compares the two distance results
  4. DIt checks whether any edge has a negative weight
3.Data structuresMedium

You have a reference to a node in the middle of a list. In which list can you remove it in O(1)?

  1. AA dynamic array
  2. BA sorted array
  3. CA doubly linked list
  4. DA singly linked list
4.Data structuresHard

The time complexity of decrease-key in a binary heap (given the element's position) is:

  1. AO(1)
  2. BO(n)
  3. CO(log n)
  4. DO(n log n)
5.Graph theoryMedium

How many different Hamilton circuits H does the complete graph K6 have? Circuits that differ only in the starting vertex or the direction count as the same.

K6
H =
6.Graph theoryHard
7112394310105ABCDEFG

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 · O(mn)

Why this is the answer

The table has (m + 1)(n + 1) cells and each is computed in O(1) from its neighbours.

Answer

A · O(mn)
2.Algorithms & complexity

Answer: A · After V − 1 rounds, it checks whether any edge can still be relaxed

Why this is the answer

All true shortest distances are found within V − 1 rounds; if an edge can still be improved, a negative cycle must exist.

Answer

A · After V − 1 rounds, it checks whether any edge can still be relaxed
3.Data structures

Answer: C · A doubly linked list

Why this is the answer

A doubly linked node knows its predecessor, so you can relink prev and next directly; a singly linked list must search for the predecessor.

Answer

C · A doubly linked list
4.Data structures

Answer: C · O(log n)

Why this is the answer

After decreasing the key, the element sifts up at most the height of the heap. Fibonacci heaps achieve O(1) amortised decrease-key.

Answer

C · O(log n)
5.Graph theory

Answer: H = 60

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.

Count

H = (6 − 1)!/2 = 120/2 = 60

Answer

H = 60
6.Graph theory

Answer: F

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

round 4

F

Answer

F

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