pptx, 13.25 MB
pptx, 13.25 MB
pptx, 13.27 MB
pptx, 13.27 MB

Within this unit of work, your students will learn to:

  • To understand different methods of searching data within an array:
  • Linear search
  • Binary search
  • Explain how both methods work.
  • To identify advantages and disadvantages of using both techniques.

Students will learn about how both searching methods work through clearly presented explanations, pseudocode, diagrams and animations. Students will develop and consolidate their understanding through a range of tasks and activities including the creation of searching algorithms using Python.

Although this unit of work has been created following the AQA GCSE 9-1 Computer Science specification, it is applicable to anyone who wants to learn about searching algorithms.

Recommended prior learning:

KS4 Algorithm Design (Sequencing, Selection & Iteration): https://www.tes.com/teaching-resource/gcse-9-1-computer-science-ks4-algorithm-design-12044669
Data Types: https://www.tes.com/teaching-resource/gcse-9-1-computer-science-algorithm-design-data-types-12047021
Arrays: https://www.tes.com/teaching-resource/gcse-9-1-computer-science-algorithm-design-arrays-12044694
Subroutines: https://www.tes.com/teaching-resource/gcse-9-1-computer-science-algorithm-design-subroutines-12047070

Get this resource as part of a bundle and save up to 25%

A bundle is a package of resources grouped together to teach a particular topic, or a series of lessons, in one place.

Reviews

Something went wrong, please try again later.

This resource hasn't been reviewed yet

To ensure quality for our reviews, only customers who have purchased this resource can review it

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.