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

How much stack space does a simple recursive factorial function fact(n) = n × fact(n − 1) use?

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

Which two things must be shown to prove that a decision problem X is NP-complete?

  1. AX has no polynomial algorithm, and X is decidable
  2. BX is in NP, and a known NP-complete problem reduces to X in polynomial time
  3. CX reduces to a problem in P, and X is in NP
  4. DX is in P, and X reduces to SAT
3.Data structuresMedium

An adjacency matrix for a graph with V vertices uses how much memory?

  1. AO(V + E)
  2. BO(V²)
  3. CO(log V)
  4. DO(E)
4.Data structuresHard

Why might a server choose its hash function at random from a universal family?

  1. ATo make it very unlikely that an attacker can pick many keys that all collide
  2. BTo remove the need to resize the table
  3. CTo make the hash table sorted
  4. DTo guarantee that no two keys can ever collide, whatever keys an attacker sends
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| = 5
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
ABCDEF

How many closed walks of length 2 start and end at F? A walk may repeat vertices and edges. Call the number N.

M = adjacency matrixL = 2
N =

3Solutions

1.Algorithms & complexity

Answer: B · O(n)

Why this is the answer

The recursion is n calls deep before any returns, and each call needs a stack frame, so it uses O(n) space.

Answer

B · O(n)
2.Algorithms & complexity

Answer: B · X is in NP, and a known NP-complete problem reduces to X in polynomial time

Why this is the answer

Membership in NP shows X is not harder than NP; the reduction from a known NP-complete problem shows X is at least as hard as all of NP.

Answer

B · X is in NP, and a known NP-complete problem reduces to X in polynomial time
3.Data structures

Answer: B · O(V²)

Why this is the answer

An adjacency matrix stores V × V entries, efficient for dense graphs; adjacency lists use O(V + E), better for sparse graphs.

Answer

B · O(V²)
4.Data structures

Answer: A · To make it very unlikely that an attacker can pick many keys that all collide

Why this is the answer

With universal hashing the expected number of collisions is small for any set of keys, since the attacker does not know which function was chosen.

Answer

A · To make it very unlikely that an attacker can pick many keys that all collide
5.Graph theory

Answer: Euler path, no 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) = 3, deg(C) = 2, deg(D) = 2, deg(E) = 1

Odd vertices

B, E → 2
Euler path, no circuit

Answer

Euler path, no circuit

The Euler path starts at one odd vertex and ends at the other.

6.Graph theory

Answer: N = 1

Degrees: the degree of a vertex is the number of edges that meet it. Every edge has two ends, so the degrees add up to twice the number of edges: Σ deg(v) = 2|E| (the handshake lemma). The number of vertices with odd degree is therefore even. Kn has n(n − 1)/2 edges, a k-regular graph on n vertices has nk/2, and a tree on n vertices has n − 1 edges.

Adjacency matrix

A: 0 1 1 0 0 0
B: 1 0 1 1 0 0
C: 1 1 0 0 1 0
D: 0 1 0 0 1 0
E: 0 0 1 1 0 1
F: 0 0 0 0 1 0

Common neighbours

(M²)FF = 0·0 + 0·0 + 0·0 + 0·0 + 1·1 + 0·0 = 1

Answer

N = 1

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