Back to marketplace
Section 8 Chapter 48 - Optimisation Algorithms
No description yet. This curated deck is ready for daily study.
Total cards: 3•Content version: v4•Public deck•Updated: 8/1/2026
Card preview (3)
#1
Front (Question)
Examples of optimisation problems (4)
Back (Answer)
• Scheduling • Finding the best move in a chess problem • Timetabling • Finding the shortest path
#2
Front (Question)
Application of shortest path algorithm (2)
Back (Answer)
Finding the shortest route by road Navigating a maze
#3
Front (Question)
Djikstra’s algorithm
Back (Answer)
Finds the shortest path between two nodes in a graph. It is a breadth first search, but uses a priority queue rather than a FIFO queue