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 does Prim's algorithm build a minimum spanning tree?

  1. AIt removes the most expensive edge until no cycles remain
  2. BIt grows one tree from a start vertex, adding the cheapest edge that leaves the tree
  3. CIt sorts all edges by weight and adds each one unless it would form a cycle in the forest
  4. DIt runs breadth-first search and keeps the BFS tree
2.Algorithms & complexityHard

How does the Bellman–Ford algorithm detect a negative-weight cycle reachable from the source?

  1. AIt runs Dijkstra's algorithm twice and compares the two distance results
  2. BIt counts the cycles with depth-first search
  3. CAfter V − 1 rounds, it checks whether any edge can still be relaxed
  4. DIt checks whether any edge has a negative weight
3.Data structuresMedium

Why can a binary heap be stored in an array without any pointers?

  1. AAll keys in a heap are equal
  2. BIt is a complete binary tree, so positions follow simple index formulas
  3. CHeaps never contain more than 100 elements
  4. DArrays automatically keep the keys in sorted order, so no pointers are needed
4.Data structuresHard

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

  1. AStore every visited node in a hash set
  2. BSort the list and look for duplicates
  3. CMove one pointer by one step and another by two steps and check whether they meet
  4. DCount the nodes until the count exceeds the list length field
5.Graph theoryMedium
ABCDEFEuler 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| = 6|E| = 7
  1. 1Euler circuit
  2. 2Euler path, no circuit
  3. 3neither
6.Graph theoryHard
411311138314ABCDEF

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: B · It grows one tree from a start vertex, adding the cheapest edge that leaves the tree

Why this is the answer

Prim's algorithm, with a priority queue of crossing edges, runs in O(E log V) with a binary heap.

Answer

B · It grows one tree from a start vertex, adding the cheapest edge that leaves the tree
2.Algorithms & complexity

Answer: C · After V − 1 rounds, it checks whether any edge can still be relaxed

Why this is the answer

All true shortest distances are found within V − 1 rounds; if an edge can still be improved, a negative cycle must exist.

Answer

C · After V − 1 rounds, it checks whether any edge can still be relaxed
3.Data structures

Answer: B · It is a complete binary tree, so positions follow simple index formulas

Why this is the answer

Completeness means there are no gaps, so the children of index i are always at 2i + 1 and 2i + 2.

Answer

B · It is a complete binary tree, so positions follow simple index formulas
4.Data structures

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

C · Move one pointer by one step and another by two steps and check whether they meet
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) = 2, deg(D) = 2, deg(E) = 2, deg(F) = 2

Odd vertices

0
Euler circuit

Answer

Euler circuit
6.Graph theory

Answer: d(F) = 18

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): C: 4
C (4): B: 5, E: 15
B (5): D: 18
E (15): F: 18
D (18)
F (18)

Shortest path

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

Answer

d(F) = 18

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