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

Why does dynamic programming give no real speed-up for merge sort?

  1. AMerge sort is already O(n)
  2. BMerge sort has no recursive structure
  3. CDynamic programming only works on graph problems, not on arrays
  4. DIts subproblems do not overlap, so there is nothing to reuse
2.Algorithms & complexityHard

Why does binary search not give O(log n) time on a singly linked list?

  1. AReaching the middle element takes O(n) steps, since there is no direct index access
  2. BComparisons on linked list nodes are slower
  3. CLinked lists cannot be sorted
  4. DBinary search needs at least twice the memory
3.Data structuresMedium

How is a new element inserted into a binary heap?

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

Which property keeps every B-tree perfectly balanced?

  1. AEach node stores one key
  2. BAll leaves are at the same depth
  3. CThe keys are stored only in the root
  4. DEvery node has exactly two children
5.Graph theoryMedium

A connected graph has 8 vertices and 17 edges. How many edges k must be removed to leave a spanning tree?

|V| = 8|E| = 17
k =
6.Graph theoryHard
5156157278ABCDEF

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: D · Its subproblems do not overlap, so there is nothing to reuse

Why this is the answer

Merge sort's halves are disjoint and each is solved once; DP helps only when subproblems recur, as in Fibonacci.

Answer

D · Its subproblems do not overlap, so there is nothing to reuse
2.Algorithms & complexity

Answer: A · Reaching the middle element takes O(n) steps, since there is no direct index access

Why this is the answer

Binary search needs O(1) access to the middle; on a linked list walking there costs linear time, so the total is O(n).

Answer

A · Reaching the middle element takes O(n) steps, since there is no direct index access
3.Data structures

Answer: A · 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

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

Answer: B · All leaves are at the same depth

Why this is the answer

Nodes split upwards when full and the tree only gets taller when the root splits, so all leaves always stay on the same level.

Answer

B · All leaves are at the same depth
5.Graph theory

Answer: k = 10

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.

Edges of a spanning tree

8 − 1 = 7

Edges to remove

k = 17 − 7 = 10

Answer

k = 10
6.Graph theory

Answer: d(F) = 20

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: 5, C: 15
B (5): C: 11, D: 20, E: 13
C (11)
E (13): F: 20
D (20)
F (20)

Shortest path

A → B → E → F
d(F) = 20

Answer

d(F) = 20

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