Subjects · Leaving Cert Applied Maths
Leaving Cert Applied Maths: Greedy vs dynamic algorithms
How often Greedy vs dynamic algorithms comes up on the Applied Maths papers, every year it was asked, and questions to try.
HL Asked on 1 of the last 3 Higher Level papers, most recently in 2024.
Quick ones on Greedy vs dynamic algorithms.
- It works backwards from the final stage
- It takes the best-looking choice at each step
- It checks every possible route in turn
- Kruskal's (spanning tree)
- Dijkstra's (shortest path)
- Bellman's (dynamic programming)
- Always gives the best possible solution
- Runs in the fewest possible steps
- Always gives a valid, workable solution
Show the answers
(a) It takes the best-looking choice at each step
(b) Bellman's (dynamic programming)
(c) Always gives the best possible solution
Higher Level
Asked on 1 of the last 3 Higher Level papers, most recently in 2024.
Every paper, year by year
| Year | Where it came up |
|---|---|
| 2025 | Not asked |
| 2024 | Q8 |
| 2023 | Not asked |
Links open the State Examinations Commission’s paper for that year.
More Greedy vs dynamic algorithms questions
Greedy vs dynamic algorithms, 3 marks
Justifying an algorithm by correctness means showing that it…?
- Always gives the cheapest possible solution
- Uses the fewest possible steps
- Always ends with a valid solution of the right type
Show the answer
Always ends with a valid solution of the right type
Correctness: the output is a genuine answer, e.g. Kruskal always ends with a spanning tree. Optimality is the separate claim that no valid answer is better.
Other Applied Maths topics
- Calculus & variable acceleration
- Connected particles & pulleys
- Constant acceleration (suvat)
- Dijkstra's algorithm
- Displacement & velocity graphs
- First-order difference equations
- Forces & Newton's laws
- Friction & inclined planes
- Graphs & network terminology
- Horizontal circular motion
- Loans, savings & finance models
- Matrices & adjacency
- Minimum spanning trees
- Momentum & direct collisions
- Oblique collisions
- Projectile motion
- Recurrence relations & differences
- Reducing second-order DEs
- Resisted motion & drag
- Second-order difference equations
- Separable differential equations
- The modelling cycle & assumptions
- Vectors & the dot product
- Vertical circular motion
- Dimensional analysis
- Dynamic programming & Bellman
- Project scheduling & critical path
- Work, energy & conservation
- Hooke's law & elastic energy