1. The question “What can be (efficiently) automated?” is one of the most inspiring philosophical and practical questions. The goal of optimisation is to make all algorithms equal.

2. Optimization is the process of finding the most efficient algorithm for a given task. A good algorithm is one that produces _______________________

3. An algorithm could be described as a series of steps for a computer uses to carry out a particular task

4. Optimisation Algorithms examine large volumes of data and look _________________________

5. Djikstra’s shortest path algorithm is designed to find the______________ between a start node and every other node in a weighted graph

6. A problem is defined as being ________________ if there is an algorithm that can solve every instance of it in a finite number of steps

7. All computational problems are computable

8. Some problems may be theoretically solvable by a computer but if they take millions of years to solve, they are, __________________________

9. There are limits to computation. These limits are imposed by algorithmic complexity and _________________

10. The following excerpt describes the famous 'travelling salesman problem'. The TSP is a well known _________________ problem.

11. In the TSP it is possible to use the b_____ f______ method to solve the problem.

12. To solve the TSP, we can use a solution where all possible routes are tested. With five cities, there would be _____________________________

13. The TSP problem quickly becomes __________________________. Even with only 10 cities, there are more than three million possible routes

14. In the TSP, with 50 cities, the number of possible routes becomes a whopping 65-digit number. This is an example of _________________________

15. The TSP is said to have a time complexity of:

16. A problem that has a ____________________ solution or better is called a tractable problem

17. Algorithms with time complexities O(n), O(n2), O(nk) are all considered very ‘inefficient’ algorithms for solving problems

18. An example of a tractable problem is “Sort n numbers into ascending numerical sequence”

19. An intractable problem is one that does not have a polynomial time solution

20. Algorithms of time complexity O(2n) and O(n!) are examples of highly efficient and easy to calculate algorithms

21. A ___________ approach is one which tries to find a solution which may not be perfect but which is adequate for its purpose

22. Decide whether the following excerpt is true or false

23. Can you fill in the blanks for number 2 in the following excerpt

24. Dijkstra’s algorithm is a special case of a more general path-finding algorithm called the __________________

25. Decide whether the following excerpt is true or false