In this investigation we will look at how we can use algorithms to solve problems, including:
• problem solving methods: trial and error, analytical, reverse engineering, intuition, and evaluation
• the types of problems that are suitable for computer solution
• how an algorithm is different to heuristics
• properties of an algorithm: unambiguous, finite, and general
• using pseudocode to represent algorithms
• the elements of an algorithm: assignment, call, and skip
• debugging
• the types of error that can occur in a computer program: syntax, runtime, logic, and intent
• challenge questions
• pseudocode syntax.
This unit of work contains 4 classroom-tested activities to reinforce the concepts developed.
• problem solving methods: trial and error, analytical, reverse engineering, intuition, and evaluation
• the types of problems that are suitable for computer solution
• how an algorithm is different to heuristics
• properties of an algorithm: unambiguous, finite, and general
• using pseudocode to represent algorithms
• the elements of an algorithm: assignment, call, and skip
• debugging
• the types of error that can occur in a computer program: syntax, runtime, logic, and intent
• challenge questions
• pseudocode syntax.
This unit of work contains 4 classroom-tested activities to reinforce the concepts developed.
Get this resource as part of a bundle and save up to 29%
A bundle is a package of resources grouped together to teach a particular topic, or a series of lessons, in one place.
Something went wrong, please try again later.
Thank you for publishing your resource. This resource has been recommended for teachers by the Tes Resources Team.
Report this resourceto let us know if it violates our terms and conditions.
Our customer service team will review your report and will be in touch.
£5.00