1. You could think of an algorithm as a ____________________ that are necessary to follow in order to solve a problem.

2. The word algorithm itself derives from the 9th Century mathematician Muhammad bin Musa al-Khwarizmi

3. In computer science, an algorithm is devised to help a programmer or computer accomplish a certain task. A _____ or pseudocode can be used to devise an algorithm.

4. Babylonian clay tablets described and employed algorithmic procedures to compute the time and place of significant astronomical events.

5. Interesting trivia question: How does Google Hangouts transmit live video across the Internet so quickly? And how does Google Maps figure out a route from x to y?

6. Not all algorithms are created equal - so which of the following is important for making a 'good' algorithm?

7. In Computer science ____________________ is used to handle the issues that arise in analysing and comparing algorithms.

8. In Asymptotic Analysis, we evaluate the performance of an algorithm in terms of _____________ (we donâ€™t measure the actual running time).

9. Read the categorisation of algorithms below and fill in the blanks for the third category.

10. Because an algorithm is a precise list of precise steps, the ____ of computation is always crucial to the functioning of the algorithm

11. Algorithms can be expressed in many kinds of notation, including natural languages, pseudocode, flowcharts, drakon-charts, programming languages or control tables

12. One of the most important aspects of algorithm design is creating an algorithm that has an efficient run-time, also known as its _____

13. Decide whether the following excerpt on algorithms is true or false

14. ___________may be used to compare before/after potential improvements to an algorithm after program optimization

15. This refers to the amount of data that the algorithm will manipulate.

16. Some problems cannot be solved in a time which is practical with current processing power and they are called ________ problems.

17. This is a problem that tries to identify whether a program will eventually halt or whether it will run forever.

18. In any given problem, as the input size increases, there will be more resources required in terms of processor power and storage. This means:

19. Many applications are _________ which means that they have to react instantly. Any delay caused by an inefficient algorithm could prevent the system from working properly

20. BigO is, simply put, a measure of ___________________. In a best case scenario, even the worst algorithm may be finished in one operation/iteration