Topic 2 Year 8 Computing
| Computing | |||
| Topic | Searching and Sorting Algorithms | ||
| No of lessons | 6 | ||
| When is it happening | Year 8 Term 1/2 | ||
| What will students learn | Students will gain an insight into how algorithms play a role in our everyday lives, such as play games, searching the internet. Students will be learning two search algorithms: Linear Search and Binary Search. Students will also be learning three sort algorithms: Bubble Sort, Insertion Sort and Merge Sort. | ||
| Key Knowledge that students should know at the end of 'Topic' | This is the knowledge that students will meet for the first time in this topic | Students will know how algorithms play a role in our everyday lives, such as play games, searching the internet. For Linear Search, Binary Search, Bubble Sort, Insertion Sort and Merge Sort, students will: define the search/sort, identify the steps to perform the search/sort on a data set, and identify and describe the advantages and disadvantages for each search/sort | |
| This is knowledge that students may have met before but will need to deepen their understanding | Students will be able to define what an algorithm is. | ||
| Key Skills that students should be able to demonstrate at the end of 'Topic' | This is the skills that students will meet for the first time in this topic | For algorithms, students will be able to create a flow chart for 3 to 5 instructions, Students will be able to put 6 or more instruction into sequence, Students will be able to create multiple sequences for the same instructions and students will be able to create a flow chart for 6 or more instruction. For Linear Search, Binary Search, Bubble Sort, Insertion Sort and Merge Sort, students will perform the search/sort on a data set | |
| This is skills that students may have met before but will need to develop | NA | ||
| Key vocabulary that students should know and understand |
Linear Search, Binary Search, Bubble Sort, Insertion Sort, Merge Sort, Data, List, Sub List, Ascending, Descending, Efficient, Inefficient, Pass, Linear, Insert, Merge, Compare. Algorithm, Search, Sort, Unordered, Ordered, Swap, Split |
||
| The Big Question | How do computer systems / programs search and sort data? | ||
|
Key questions that students should be able to answer at the end of the 'Topic' |
What are algorithms and what role do they play in our lives? | ||
| How do I do a Linear Search to find a piece of data? | |||
| How do I do a Binary Search to find a piece of data? | |||
| How do I do a Bubble Sort to sort data? | |||
| How do I do an Insertion Sort to sort data? | |||
| How do I do a Merge Sort to sort data? | |||