1. To quote Google itself, “Algorithms are the computer processes and formulas that take your questions and turn them into answers.” Decide whether the following 'fun fact' is true or false

2. In terms of the purpose of an algorithm, we can broadly divide algorithms into three categories. Select the most appropriate answer from the options.

3. That is the amount of (memory) space the algorithm will take up before it terminates with the correct solution

4. This is the amount of time it takes for the algorithm to terminate with the correct solution.

5. The following excerpt lists the different types of algorithms by implementation. Can you fill in the blanks for the first?

6. This kind of algorithm repeatedly reduces an instance of a problem to one or more smaller instances of the same problem (usually recursively), until the instances are small enough to solve easily.

7. These algorithms are based on a depth-first recursive search

8. These algorithms simply try all possibilities until a satisfactory solution is found

9. Often, brute force algorithms require exponential time. Various heuristics and optimizations can be used. A ________ is a rule of thumb that helps you decide which possibilities to look at first

10. Traditionally, an algorithm is only called “divide and conquer” if it contains at least two recursive calls

11. Read the following excerpt on 'greedy algorithms' and fill in the blanks

12. Algorithms can be classified in different ways. Which of the following are not likely to be valid classification methods?

13. An expensive algorithm is one that requires the equivalent of _______, that is --> (O(2n)) time.

14. A ________________ algorithm remembers past results and uses them to find new results

15. A randomized algorithm uses a random number at least once during the computation to make a decision. An example is: