Skip to content
MathsGenie logo
Open app

Course home

x

What is being optimised?

What is being optimised?

Weighted graph with vertices A to F, labelled edge weights, and shortest path A to C to B to D to E to F highlighted with total cost 13

Optimisation algorithms are step-by-step methods for finding the best valid answer according to a chosen measure, such as minimum distance, cost, or time. In this lesson, the key example is Dijkstra's algorithm for finding shortest paths.

Optimisation algorithms Lesson

  1. A Level
  2. /Computer Science
  3. /Optimisation algorithms

Step-by-step lessons covering AQA A Level Computer Science Optimisation algorithms for A Level Computer Science. Each lesson works through exam-style questions.

Lessons