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

A function runs one loop of n iterations and then, separately, another loop of n iterations. What is its time complexity?

  1. AO(2ⁿ)
  2. BO(n)
  3. CO(log n)
  4. DO(n²)
2.Algorithms & complexityHard

Which definition of the class NP is correct?

  1. AProblems that no algorithm can solve
  2. BProblems that are not polynomial
  3. CDecision problems whose yes-answers can be verified in polynomial time given a certificate
  4. DProblems that cannot be solved in polynomial time
3.Data structuresMedium

How is a new element inserted into a binary heap?

  1. ARebuild the whole heap from scratch
  2. BPlace it at the root and sift it down
  3. CInsert it at its sorted position by shifting all of the larger elements one place right
  4. DPlace it at the end of the array and sift it up while it violates the heap property
4.Data structuresHard

You must keep the k smallest values from a stream of n numbers using O(k) memory. Which approach works in O(n log k) time?

  1. AA sorted array of all n values
  2. BA max-heap of size k, replacing its root when a smaller value arrives
  3. CA FIFO queue of the last k values
  4. DA min-heap holding all n values, from which the k smallest are popped at the end
5.Graph theoryMedium

A tree has 3 vertices of degree 3, 2 vertices of degree 4, 2 vertices of degree 5, 2 vertices of degree 2, and all its other vertices are leaves (degree 1). How many leaves L does it have?

3 × deg 32 × deg 42 × deg 52 × deg 2
L =
6.Graph theoryHard
16114191031319ABCDEFG

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

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

3Solutions

1.Algorithms & complexity

Answer: B · O(n)

Why this is the answer

n + n = 2n, and constant factors are dropped, so the function is O(n).

Answer

B · O(n)
2.Algorithms & complexity

Answer: C · Decision problems whose yes-answers can be verified in polynomial time given a certificate

Why this is the answer

For an NP problem, a proposed solution (certificate) can be checked quickly, for example verifying a given assignment satisfies a Boolean formula.

Answer

C · Decision problems whose yes-answers can be verified in polynomial time given a certificate
3.Data structures

Answer: D · Place it at the end of the array and sift it up while it violates the heap property

Why this is the answer

Adding at the end keeps the tree complete; swapping with the parent restores the order in O(log n) steps.

Answer

D · Place it at the end of the array and sift it up while it violates the heap property
4.Data structures

Answer: B · A max-heap of size k, replacing its root when a smaller value arrives

Why this is the answer

The max-heap's root is the largest kept value; any smaller new value replaces it in O(log k), so the heap always holds the k smallest so far.

Answer

B · A max-heap of size k, replacing its root when a smaller value arrives
5.Graph theory

Answer: L = 15

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.

Handshake lemma for a tree

L + 31 = 2(L + 9) − 2
L = 15

Answer

L = 15

Shortcut: L = 2 + Σ (d − 2) over the vertices with degree d ≥ 3.

6.Graph theory

Answer: W = 47

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

GD (1): take
DF (3): take
BC (4): take
GE (9): take
DE (10): skip, closes a cycle
AC (11): take
EF (13): skip, closes a cycle
AB (16): skip, closes a cycle
CE (19): take

Total weight

W = 1 + 3 + 4 + 9 + 11 + 19 = 47

Answer

W = 47

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