LearnITWithMrC

Searching

Lesson Video

7

Lesson Tasks

Watch the Lesson video
Make notes if needed.
Open your Learning Journal
Complete Task 1 in your Learning Journal
Complete the learning activities
Make sure you complete the book tasks in your Unit Booklet
Complete End of Task Assessment
Update your learning objectives

What do I need to Learn?

0 results forGuest

I need to learn how to understand that more than one algorithm can be used to solve the same problem.

I need to learn how to understand and explain how the linear search algorithm works.

I need to learn how to understand and explain how the binary search algorithm works.

I need to learn how to compare and contrast linear and binary search algorithms.

Key Terms

Algorithm Efficiency Searching

Task 1 - Getting organised Click to see more

Task: Learning Journal

Open your Learning Journal by clicking on the image below

Good notes will help you organise and process data and information

Task : Fill out your learning Journal.

Open your Learning Journal and complete the task below .

Task 2 - Searching - Linear Click to see more

Searching

Searching for information is one of the main tasks of any computer system. The speed at which information can be found is also very important, especially in real time systems where the data has to be found and updated very quickly.

Linear Search

A linear search checks each item in a list one at a time, without jumping over item, or to any item.

Linear Search to find an element "K" in a sorted list.

Linear search

Time taken to search elements keep increasing as the number of elements are increased.
The worst case complexity is O(n), sometimes known an O(n) search

Task: Linear Search

Open your student workbook at page 38 read through the notes and then complete Task 27.

Task : Fill out your learning Journal.

Open your Learning Journal and complete the task below .

Task 3 - Searching - Binary Click to see more

Binary Search

In computer science, binary search, also known as half-interval search or logarithmic search, is a search algorithm that finds the position of a target value within a sorted array. It compares the target value to the middle element of the array; if they are unequal, the half in which the target cannot lie is eliminated and the search continues on the remaining half until it is successful.

Binary search runs in at worst logarithmic time, making O(log n) comparisons, where n is the number of elements in the array and log is the binary logarithm.

Creating a binary search tree

Searching for the number 27

Task: Binary Search

Open your student workbook at page 41 read through the notes and then complete Task 28.

Task : Fill out your learning Journal.

Open your Learning Journal and complete the task below .

Task 4 - Comparing Linear and Binary Searches Click to see more

Searching - Comparing a linear and binary search

Task: Comparing Searches

Open your student workbook at page 43 and then complete Tasks 29 and 30.

Task : Fill out your learning Journal.

Open your Learning Journal and complete the task below .

Task 5 - Creating a linear search Algorithm Click to see more

Task: Searching Algorithm - linear

Create an algorithm in pseudocode or using a flowchart for a linear search.

Extension Task: Searching Algorithm - binary

Using your algorithm, create a linear search using python.

Task : Fill out your learning Journal.

Open your Learning Journal and complete the task below .

Task 6 - Lesson Review Click to see more

Summing it all up

Lets look at the learning outcomes and decide which one best describes our current level of understanding :

Tick the one you feel is closest to your level

Learning Outcomes I need to learn how to understand that more than one algorithm can be used to solve the same problem.

I have a basic understanding of how I can understand that more than one algorithm can be used to solve the same problem. with a little help from my teacher
I can show my teacher that I can understand that more than one algorithm can be used to solve the same problem. without their help.
I can understand that more than one algorithm can be used to solve the same problem. independently and I can also explain it to others and can complete any extension tasks I am given.