This task should take approximately 1 week
|
This task should take approximately 3 weeks
|
This task should take approximately 2 weeks
|
Task 1: Algorithms
Task SummaryWhat you will learn: During this task you will learn the importance of using algorithms to a computer scientist. You will learn about breaking tasks down to small elements and how to construct an algorithm for a given task.
How you will be accessed: Written Assessment task 1 can be done for your homework. |
Key terminologyPattern Recognition
Algorithm Abstraction Decomposition |
Activities
Activity 1: Naughts and Crosses
If you want to win a game of naughts and crosses every time there is a simple algorithm you can follow.
Try it with a friend: Click here
- Move 1: Go in a corner.
- Move 2: If the other player did not go there then go in the opposite corner to move 1. Otherwise go in a free corner.
- Move 3: If there are two Xs and a space in a line (in any order) then go in that space. Otherwise if there are two Os and a space in a line then go in that space. Otherwise go in a free corner.
- Move 4: If there are two Xs and a space in a line (in any order) then go in that space. Otherwise if there are two Os and a space in a line then go in that space. Otherwise go in a free corner.
- Move 5: Go in the free space.
Try it with a friend: Click here
Activity 2: Pattern Recognition
Another skill that computer scientist often use is pattern recognition. All people use pattern recognition in their daily lives. For example recognising faces and recognising if you get to lunch early or late then you miss the queue.
By recognising patterns and being able to write an algorithm suitable for a computer to follow we are able to get computers to do lengthy and problem solving. For example predicting the weather or computerised traffic management systems.
Below is one way that Google use pattern recognision with google street maps to ensure the Peg Man is always dropped in an interesting place.
By recognising patterns and being able to write an algorithm suitable for a computer to follow we are able to get computers to do lengthy and problem solving. For example predicting the weather or computerised traffic management systems.
Below is one way that Google use pattern recognision with google street maps to ensure the Peg Man is always dropped in an interesting place.
Activity 3: Decomposition
Decomposition is the process of breaking tasks down into small parts. You do this everyday in many of your daily tasks. For example when you draw the naughts and crosses game you break the task down by drawing each line separate, you break it down to 4 small parts. Another example of decomposition could be if you needed to count the number of students in Year 7, you would probably divide the students in to registration groups, count the registration groups separate then add the totals, again breaking the task down into three easy steps.
For further reading on decomposition Click Here
Activity: Try this quick online test to check your knowledge: BBC Bitesize Decomposition test
For further reading on decomposition Click Here
Activity: Try this quick online test to check your knowledge: BBC Bitesize Decomposition test
Assessment Task 1
Make your own Algorithm
You are thinking of building a robot to help you to do some jobs, some of the jobs you would like to robot to do are
Choose one of these tasks: Firstly decompose the task and note each stage. Produce an algorithm for the task you choose. You may display your algorithm in writing or in the form of a flow chart. If you show your algorithm in writing then you should format it step by step, for example: Step 1 - Pick up toothbrush. |
Going for Gold
Going for Gold Activity 1: Computational Thinking Riddle
The Bridge Riddle
Rules of bridge crossing:
Question:
What is the shortest time you can get all men safely across the bridge? Note down your process.
Rules of bridge crossing:
- The bridge can only hold 2 men at a time
- There is only one torch and it must be used for every crossing
- Each man cross at different speeds, when 2 men cross they can only travel at the speed of the slowest man.
- The bridge is too long to throw the torch back over.
Question:
What is the shortest time you can get all men safely across the bridge? Note down your process.
Going for Gold Activity 2: Find the medium
Imaging you had the following numbers and wanted to write an algorithm for younger students to follow to find the medium (3.5).
Numbers: 12, 2, 3, 8, 2, 4
Your steps or algorithm need to work for any given set of numbers. Write the algorithm and illustrate it working on the numbers given above.
Numbers: 12, 2, 3, 8, 2, 4
Your steps or algorithm need to work for any given set of numbers. Write the algorithm and illustrate it working on the numbers given above.