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 many levels does the recursion of merge sort have for an array of n elements?

  1. AAbout n
  2. BAbout n / 2
  3. CAbout log₂ n
  4. DAbout √n
2.Algorithms & complexityHard

Which of these satisfiability problems is known to be solvable in polynomial time?

  1. ACircuit satisfiability
  2. BGeneral SAT on formulas in conjunctive normal form
  3. C2-SAT, where each clause has at most two literals
  4. D3-SAT, where each clause has exactly three literals
3.Data structuresMedium

Which data structure is used by depth-first search (iterative version)?

  1. AA stack
  2. BA queue
  3. CA hash table only
  4. DA heap
4.Data structuresHard

Why do databases often use B+ trees rather than plain B-trees for indexes?

  1. AB+ trees do not need to be balanced
  2. BB+ trees store data only in the root
  3. CB+ trees use binary internal nodes, which reduces the number of disk reads
  4. DAll records are in linked leaves, which makes range scans efficient
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
97131111111015ABCDEF

Dijkstra’s algorithm runs from A. Click the vertex that is settled (made permanent) in round 3; A itself is round 1.

start: Around 3
  1. 1A
  2. 2B
  3. 3C
  4. 4D
  5. 5E
  6. 6F

3Solutions

1.Algorithms & complexity

Answer: C · About log₂ n

Why this is the answer

Halving from n down to 1 takes about log₂ n levels, and each level does O(n) merging work, giving O(n log n).

Answer

C · About log₂ n
2.Algorithms & complexity

Answer: C · 2-SAT, where each clause has at most two literals

Why this is the answer

2-SAT is in P (linear time via strongly connected components), while 3-SAT is NP-complete.

Answer

C · 2-SAT, where each clause has at most two literals
3.Data structures

Answer: A · A stack

Why this is the answer

DFS explores as deep as possible, naturally using a stack (or recursion's call stack); BFS uses a queue.

Answer

A · A stack
4.Data structures

Answer: D · All records are in linked leaves, which makes range scans efficient

Why this is the answer

In a B+ tree internal nodes only guide the search and the leaves are linked in key order, so a range query finds the first key and then walks along the leaves.

Answer

D · All records are in linked leaves, which makes range scans efficient
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: B

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

1. A (0): B: 9, C: 7
2. C (7): E: 18
3. B (9): D: 20
4. E (18)
5. D (20): F: 30
6. F (30)

round 3

B

Answer

B

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