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

About how many comparisons does binary search need in the worst case on a sorted array of 1,000,000 elements?

  1. AAbout 1,000
  2. BAbout 500,000
  3. CAbout 20
  4. DAbout 100
2.Algorithms & complexityHard

Which statement about P and NP is correct?

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

Which data structure does a running program use to keep track of active function calls and their local variables?

  1. AThe heap memory queue
  2. BA binary search tree of frames
  3. CThe call stack
  4. DA hash table of functions
4.Data structuresHard

Which problem of linear probing does double hashing mainly reduce?

  1. AThe need to store keys in the table
  2. BThe O(n) cost of reading a key's value
  3. CThe need for a hash function
  4. DPrimary clustering, where long runs of occupied slots form
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| = 12
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
12117107434129ABCDEFG

Use Dijkstra’s algorithm to find the length d(F) of the shortest path from A to F in the weighted graph.

start: Aend: F
d(F) =

3Solutions

1.Algorithms & complexity

Answer: C · About 20

Why this is the answer

220 ≈ 1,048,576, so after about 20 halvings only one element remains.

Answer

C · About 20
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: C · The call stack

Why this is the answer

Each call pushes a stack frame and each return pops it, which is why the most recent call finishes first.

Answer

C · The call stack
4.Data structures

Answer: D · Primary clustering, where long runs of occupied slots form

Why this is the answer

Linear probing steps by 1, so occupied runs grow and merge; double hashing uses a second hash for the step size so different keys probe different sequences.

Answer

D · Primary clustering, where long runs of occupied slots form
5.Graph theory

Answer: Euler 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) = 4, deg(C) = 4, deg(D) = 4, deg(E) = 4, deg(F) = 2, deg(G) = 4

Odd vertices

0
Euler circuit

Answer

Euler circuit
6.Graph theory

Answer: d(F) = 22

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

Each line: the vertex settled, its final distance, and the neighbours whose distance improves.

A (0): B: 12, C: 11
C (11): E: 18, G: 15
B (12)
G (15): D: 27
E (18): F: 22
F (22)
D (27)

Shortest path

A → C → E → F
d(F) = 22

Answer

d(F) = 22

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