LH/LM-ALGC
Algorithms and Complexity
Stable matchingGreedy algorithmsDynamic programmingNetwork flowsLinear programmingNP-completenessApproximation algorithmsRandomised algorithms
Question bank
Questions by topic
12 questions from 3 papers. See which topics come up in which years.
Practice modeMembers only: sign in to practise
| Topic | 2022-23 | 2023-24 | 2024-25 | All |
|---|---|---|---|---|
| Stable matching | 1 | 1 | ||
| Greedy algorithms | 1 | 1 | 2 | |
| Dynamic programming | 1 | 1 | 2 | |
| Network flows | 0 | |||
| Linear programming | 0 | |||
| NP-completeness | 1 | 2 | 1 | 4 |
| Approximation algorithms | 1 | 1 | ||
| Randomised algorithms | 1 | 1 | 2 | |
| No topic | 2 | 1 | 1 | 4 |
| All questions | 4 | 4 | 4 | 12 |
Loading questions…