3.1 Fundamentals of Algorithms

Search Algorithm Selection (2 marks)

If you have a sorted list and you need to find a specific item, would you choose a linear search or a binary search? Explain your choice.

Identify the input in the following simple algorithm: OUTPUT ‘What is your name?’ name

Provide an example of decomposition by breaking down the task of organizing a school fête into at least three sub-tasks.

Decomposition is a crucial step in problem-solving. Explain why it is important to decompose complex problems.

In computer science, what is meant by ‘abstraction’? Give an example to illustrate your explanation.

Explain the difference between an algorithm and a computer program.

Explain what is meant by an ‘algorithm’ in the context of computer science.