4.3.6 Optimisation Algorithms Flashcards
What is the purpose of an optimisation algorithm?
To find the best possible solution to the problem posed.
What is the purpose of Dijkstra’s algorithm.
To find the shortest path between two nodes one being the root within a weighted graph.
Which of the following is not an example of where Dijkstra’s Algorithm is used:
1. Satellite navigation
2. Binary Tree Search
3. Packet routing
Binary Tree Search
What is heuristic technique?
Heuristic Technique is a method employed to solve a problem quickly when typical methods are too slow.
What is meant by an intractable problem?
A problem where there exists an algorithm to solve it but it cannot do so in a polynomial time. This often means useing a brute-force approach.