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 is the base of a logarithm usually left out in Big O, as in O(log n)?

  1. AThe base only matters for small n
  2. BAll logarithms in computer science have base 10, so it is implied
  3. CLogarithms with different bases differ only by a constant factor
  4. DLogarithms are always rounded to integers
2.Algorithms & complexityHard

Which statement about P and NP is correct?

  1. ANP means "not polynomial"
  2. BEvery problem in P is also in NP
  3. CNP problems cannot be verified quickly
  4. DIt has been proven that P ≠ NP
3.Data structuresMedium

A trie (prefix tree) is especially efficient for:

  1. APrefix searches such as autocomplete
  2. BSorting numbers
  3. CStoring matrices
  4. DFinding shortest paths
4.Data structuresHard

How does a radix tree (compressed trie) improve on a plain trie?

  1. AIt keeps only the first letter of each word
  2. BIt sorts the children of each node by frequency
  3. CIt stores each word in a hash table at the root instead of in separate nodes
  4. DIt merges chains of single-child nodes into one edge labelled with a string
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
1202121115683ABCDEFG

Find the total weight W of a minimum spanning tree of the weighted graph.

|V| = 7|E| = 9
W =

3Solutions

1.Algorithms & complexity

Answer: C · Logarithms with different bases differ only by a constant factor

Why this is the answer

Changing the base multiplies the logarithm by a constant, and Big O ignores constant factors.

Answer

C · Logarithms with different bases differ only by a constant factor
2.Algorithms & complexity

Answer: B · Every problem in P is also in NP

Why this is the answer

P ⊆ NP: if you can solve a problem quickly you can verify a solution quickly. Whether P = NP is still open.

Answer

B · Every problem in P is also in NP
3.Data structures

Answer: A · Prefix searches such as autocomplete

Why this is the answer

Tries store strings by characters along paths, so lookups and prefix queries take time proportional to the key length.

Answer

A · Prefix searches such as autocomplete
4.Data structures

Answer: D · It merges chains of single-child nodes into one edge labelled with a string

Why this is the answer

Collapsing paths with no branching reduces the number of nodes and the memory used while keeping prefix search.

Answer

D · It merges chains of single-child nodes into one edge labelled with a string
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: W = 32

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

AB (1): take
BC (2): take
GE (3): take
EF (6): take
GC (8): take
CE (11): skip, closes a cycle
BD (12): take

Total weight

W = 1 + 2 + 3 + 6 + 8 + 12 = 32

Answer

W = 32

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