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

In the activity selection problem, which greedy rule always gives a maximum number of non-overlapping activities?

  1. APick the shortest activity first
  2. BPick the activity that finishes earliest, then repeat with the compatible ones
  3. CPick the activity with the fewest overlaps first, then repeat with the compatible ones
  4. DPick the activity that starts earliest
2.Algorithms & complexityHard

For which knapsack variant does the greedy rule "take items in order of value per weight" always give an optimal answer?

  1. AThe 0/1 knapsack, where items must always be taken whole
  2. BNeither variant
  3. CBoth variants
  4. DThe fractional knapsack, where items may be split
3.Data structuresMedium

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

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

Which structure lets you compute the maximum of every window of size k in an array in O(n) total?

  1. AA singly linked list of the window's elements
  2. BA sorted array updated by shifting
  3. CA deque holding indices in decreasing order of value
  4. DA min-heap rebuilt for every window
5.Graph theoryMedium

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

K4
H =
6.Graph theoryHard
28318941117ABCDEF

Find the total weight W of a minimum spanning tree of the weighted graph.

|V| = 6|E| = 8
W =

3Solutions

1.Algorithms & complexity

Answer: B · Pick the activity that finishes earliest, then repeat with the compatible ones

Why this is the answer

Choosing the earliest finishing time can be proven optimal by an exchange argument; the other rules have counterexamples.

Answer

B · Pick the activity that finishes earliest, then repeat with the compatible ones
2.Algorithms & complexity

Answer: D · The fractional knapsack, where items may be split

Why this is the answer

When items can be split, the best ratio first is optimal; in 0/1 knapsack a high-ratio item can block a better combination, so dynamic programming is needed.

Answer

D · The fractional knapsack, where items may be split
3.Data structures

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

B · The call stack
4.Data structures

Answer: C · A deque holding indices in decreasing order of value

Why this is the answer

The front of the deque is always the window's maximum; each index enters and leaves the deque once, so the work is linear.

Answer

C · A deque holding indices in decreasing order of value
5.Graph theory

Answer: H = 3

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 = (4 − 1)!/2 = 6/2 = 3

Answer

H = 3
6.Graph theory

Answer: W = 35

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.

Kruskal’s algorithm

AB (2): take
BC (3): take
DF (4): take
AC (8): skip, closes a cycle
DE (9): take
EF (11): skip, closes a cycle
BE (17): take

Total weight

W = 2 + 3 + 4 + 9 + 17 = 35

Answer

W = 35

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