End of Year 8 (EOY8) Computer Science Practice Exam

An algorithm is a precise, finite sequence of instructions that tells you exactly how to complete a task or solve a problem. It should be clear enough that anyone following the steps can reproduce the result, regardless of who does them or when they’re done. That step-by-step nature is what makes it a method for turning a goal into actions.

This is why the best description is a set of step-by-step instructions to describe a task or process. It’s not about storing data, which is what data storage is for. It’s not a programming language, which is the tool used to write and run instructions. It’s not a Boolean operator, which are simple logical checks used inside decisions. An algorithm can be written in plain language or expressed as code, but its essence is the ordered sequence of actions that leads to a solution. For example, a recipe for making tea outlines the exact steps to reach the final drink.