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 does the recurrence T(n) = T(n − 1) + O(1) solve to?

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

Which algorithm finds a minimum spanning tree by repeatedly adding the cheapest edge that does not form a cycle?

  1. AKruskal's algorithm
  2. BFloyd–Warshall
  3. CPrim's algorithm starting from one node
  4. DDijkstra's algorithm
3.Data structuresMedium

In a hash table using open addressing, what is the maximum possible load factor?

  1. A0.5
  2. B1
  3. C2
  4. DThere is no maximum
4.Data structuresHard

How can you detect whether a singly linked list contains a cycle using O(1) extra memory?

  1. ACount the nodes until the count exceeds the list length field
  2. BStore every visited node in a hash set
  3. CSort the list and look for duplicates
  4. DMove one pointer by one step and another by two steps and check whether they meet
5.Graph theoryMedium

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

K7
H =
6.Graph theoryHard
ABCDE

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

M = adjacency matrixL = 3
N =

3Solutions

1.Algorithms & complexity

Answer: C · O(n)

Why this is the answer

There are n levels with constant work each, as in a recursive sum of an array.

Answer

C · O(n)
2.Algorithms & complexity

Answer: A · Kruskal's algorithm

Why this is the answer

Kruskal sorts edges by weight and adds them if they connect different components; Prim grows one tree from a start vertex.

Answer

A · Kruskal's algorithm
3.Data structures

Answer: B · 1

Why this is the answer

With open addressing all keys are stored in the table itself, so n cannot exceed m; separate chaining can have a load factor above 1.

Answer

B · 1
4.Data structures

Answer: D · Move one pointer by one step and another by two steps and check whether they meet

Why this is the answer

In Floyd's algorithm, if there is a cycle the fast pointer eventually catches up with the slow one; otherwise the fast pointer reaches null.

Answer

D · Move one pointer by one step and another by two steps and check whether they meet
5.Graph theory

Answer: H = 360

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 = (7 − 1)!/2 = 720/2 = 360

Answer

H = 360
6.Graph theory

Answer: N = 6

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
B: 1 0 1 1 1
C: 1 1 0 0 1
D: 0 1 0 0 1
E: 0 1 1 1 0

One more step

(M³)BB = 1·1 + 4·0 + 2·1 + 1·1 + 2·1 = 6

Answer

N = 6

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