UUnizy

Imperial · COMP40008 · Computing

COMP40008 Graphs and Algorithms: exam practice questions, marked

Practise for COMP40008 Graphs and Algorithms at Imperial College London with 45 quick-recall questions, 18 exam-style questions and 9 first-class stretch questions, written from the module’s published description. Write an answer and get it marked against Imperial’s grade bands in about 30 seconds, with the exact sentences that lost marks and three changes to reach the next class.

Try one free, no sign-up Create a free account

Example COMP40008 question

(a) Define a tree and state three equivalent characterisations of a tree on n vertices. [4] (b) Prove that every tree with n ≥ 2 vertices has at least two leaves. [4] (c) A connected graph has 12 vertices and 11 edges. What can you conclude about it, and why? [2]

Topics covered

  1. Graph Fundamentals and Representations
  2. Graph Traversal: BFS and DFS
  3. Shortest Paths and Weighted Graphs
  4. Minimum Spanning Trees
  5. Algorithm Analysis and Asymptotic Notation
  6. Divide and Conquer
  7. Greedy Algorithms
  8. Dynamic Programming
  9. Network Flows and Complexity

Unizy is an independent revision tool and is not affiliated with or endorsed by Imperial College London. Marks are practice estimates, not official marks.