GET READY SETTLER ACTIVITY

Slides:



Advertisements
Similar presentations
1 ICS102: Introduction To Computing King Fahd University of Petroleum & Minerals College of Computer Science & Engineering Information & Computer Science.
Advertisements

The LC-3 – Chapter 6 COMP 2620 Dr. James Money COMP
New Mexico Computer Science For All Decomposition in Computer Programming Maureen Psaila-Dombrowski.
Basics of Computer Programming Web Design Section 8-1.
An Introduction to Programming and Object Oriented Design using Java 2 nd Edition. May 2004 Jaime Niño Frederick Hosch Chapter 0 : Introduction to Object.
School of Computing Science CMT1000 © Ed Currie Middlesex University 1 CMT1000: Introduction to Programming Ed Currie Lecture 1B: Problem Solving.
New Mexico Computer Science For All Introduction to Algorithms Maureen Psaila-Dombrowski.
Computer Programming Basics. Computer programs are a detailed set of instructions given to the computer They tell the computer: 1. What actions you want.
Activity 1 - WBs 5 mins Go online and spend a moment trying to find out the difference between: HIGH LEVEL programming languages and LOW LEVEL programming.
Reality Show. In this unit, you have been asked to help a TV production company create a new exciting reality TV show! You are learning to: Understand.
GENERAL CONCEPTS OF OOPS INTRODUCTION With rapidly changing world and highly competitive and versatile nature of industry, the operations are becoming.
Top-Down Design and Modular Development
Top-Down Design and Modular Development. The process of developing methods for objects is mostly a process of developing algorithms; each method is an.
Computational Thinking – Lesson 3 Lesson Objective To be able to construct an algorithm and flowchart for a given problem.
Making Decisions uCode: October Review What are the differences between: o BlueJ o Java Computer objects represent some thing or idea in the real.
Chapter 1 Program design Objectives To describe the steps in the program development process To introduce the current program design methodology To introduce.
… Computer Science Inside… Algorithm Development.
2.1 Elements of Computational thinking
STAGE 10: DICE RACE What do you remember from the last class? What was your favorite part? What do you wish we had had time to do?
AP CSP: Creating Functions & Top-Down Design
The Need for Algorithms
Topic: Introduction to Computing Science and Programming + Algorithm
Functions and Top-Down Design
Superhero Transformations
UNIT 3 – LESSON 5 Creating Functions.
The Knight’s Tour Graphs, Algorithms, Abstraction and Decomposition
BTEC NCF Dip in Comp: Unit 01 Principles of Computer Science Lesson 01 – Computational Thinking Mr C Johnston.
Teaching design techniques to design efficient solutions to problems
Introduction to Programmng in Python
Yenka Portfolio Level for this topic: Student Name : My Levels
Completing the tasks for A452 with….
Computational Thinking
An introduction to decomposition: Tut, clap or Jive
Global Challenge Night Sensor Lesson 2.
Computational Thinking for KS3
Global Challenge Night Sensor Lesson 2.
Chapter 0 : Introduction to Object Oriented Design
GET READY SETTLER ACTIVITY
Global Challenge Night Sensor Lesson 2.
The Friendship Algorithm
Global Challenge Night Sensor Lesson 2.
Global Challenge Walking for Water Lesson 2.
Algorithms.
PAST, PRESENT & FUTURE OF COMPUTING End of Unit - Presentation
COMPUTATIONAL THINKING L1: PROBLEM SOLVING
Global Challenge Night Sensor Lesson 2.
Global Challenge Walking for Water Lesson 2.
Global Challenge Walking for Water Lesson 2.
COMPUTATIONAL THINKING END OF UNIT ASSESSMENT
Global Challenge Night Sensor Lesson 2.
Global Challenge Night Sensor Lesson 2.
Abstraction and Hierarchy
Global Challenge Night Sensor Lesson 2.
COMPUTATIONAL THINKING COMPUTATIONAL THINKING IN PROGRAMMING
Unit 1: Principles of Computer Science
Global Challenge Walking for Water Lesson 2.
Global Challenge Walking for Water Lesson 2.
Global Challenge Walking for Water Lesson 2.
Computational Thinking
Global Challenge Night Sensor Lesson 2.
Global Challenge Walking for Water Lesson 2.
Top-Down Design & JSP Skill Area Part D
Quiz: Computational Thinking
Computational Thinking
Global Challenge Walking for Water Lesson 2.
Global Challenge Walking for Water Lesson 2.
Global Challenge Walking for Water Lesson 2.
Computational Thinking (How to think like a computer scientist)
Computational Thinking (How to think like a computer scientist)
Understanding Computational Thinking
Presentation transcript:

GET READY SETTLER ACTIVITY Get ready for the lesson: Login Computer Go to rother-net.co.uk Password Mrc_1672 Go to KS3 > 8.1 Computational Thinking Download 8.1.3 Worksheet ___ Can you remember what the following keywords mean? DECOMPOSITION ABSTRACTION Can you think of an example? GET READY SETTLER ACTIVITY

COMPUTATIONAL THINKING L3: PATTERN RECOGNITION & ALGORITHM DESIGN YEAR 8 COMPUTER SCIENCE @MRC-ACADEMY

LEARNING OBJECTIVES In this lesson you will: Further your UNDERSTANDING of what is meant by Computational Thinking. UNDERSTAND what is meant by pattern recognition and algorithm design. So that you can: USE these methods to solve complex problems.

LAST LESSON We introduced the method of computational thinking which was designed to help solve complex problems. How many stages are there? What are the stages called? Can you explain the first two stages?

4 STAGES OF COMPUTATIONAL THINKING STAGE 1: DECOMPOSITION Breaking a problem down into smaller, more manageable parts which are easier to solve. STAGE 2: ABSTRACTION Removing unnecessary details so that only the main, important points remain. STAGE 3: PATTERN RECOGNITION Finding similarities among small problems that could help fix the larger problem efficiently. STAGE 4: ALGORITHM Step-by-step instructions to solve the problem.

PATTERN RECOGNITION The third stage to solving a complex problem is pattern recognition. When we decompose a complex problem we often find patterns among the smaller problems we create. The patterns are similarities or characteristics that some of the problems share. By finding these patterns it will allow us to solve the complex problem more efficiently.

TASK 1: CATS On a piece of paper sketch 3 to 5 different cats. Reflect on the activity: Are there any common characteristics in your cats? What are they? Did this make drawing more than one cat easier or harder?

CATS & PATTERN RECOGNITION All cats share common characteristics. Among other things they all have eyes, tails and fur. They also like to eat fish and make meowing sounds. Because we know that all cats have eyes, tails and fur, we can make a good attempt at drawing a cat, simply by including these common characteristics. In computational thinking, these characteristics are known as patterns. Once we know how to describe one cat we can describe others, simply by following this pattern. The only things that are different are the specifics.

PROBLEM SOLVE: HOTEL TYCOON Remember our hotel? We have already used decomposition and abstraction to help solve our complex problem of arranging a sightseeing tour around London. It’s now time to use pattern recognition to get one step closer to putting a plan in place.

TASK 2: PATTERN RECOGNITION --- 10min task 2 Player Complete in Worksheet If the tour is to run every weekday (Mon to Fri), what are the necessary properties that never change for our route planning to each landmark? What are the specifics that do change? WRITE your ideas in the worksheet. EXTENSION: Research how Google uses pattern recognition and consider the advantages this brings.

TASK REVIEW What are the common characteristics in our route planning? What are the specifics that would change for each location? How do you think this helps us put a plan together?

PATTERN SPECIFICS HOTEL TUBE STOP TUBE LINE LANDMARK HOTEL GREEN PARK JUBILEE LINE WESTMINSTER BIG BEN DISTRICT LINE MONUMENT ST PAUL’S

ALGORITHM DESIGN An algorithm is a plan, a set of step- by-step instructions to solve a problem. It is important to plan out the solution to a problem to make sure that it will be correct. In an algorithm, each instruction is identified and the order in which they should be carried out is planned. An algorithm must be clear. It must have a starting point, a finishing point and a set of clear instructions in between.

TASK 3: ALGORITHM DESIGN --- 10min task 1 Player Complete in Worksheet It is now time to put the plan together. Have a look at the map and work out the route. Create a step-by-step plan for the tour route. EXTENSION: How would you describe computational thinking to an alien? How would you convince the alien it is important?

TASK REVIEW Did you find creating the algorithm easy? Do you think it would be this easy if you didn’t decompose or abstract the problem?

PROBLEM SOLVE: HOTEL TYCOON Congratulations! You have organised the sightseeing tour around London. It will not be long before you start making some profit.

ALGORITHM DESIGN Algorithms are often used as a starting point for creating a computer program, and they are sometimes written as a flowchart or in pseudocode. If we want to tell a computer to do something, we have to write a computer program that will tell the computer, step-by-step, exactly what we want it to do and how we want it to do it. Computers are only as good as the algorithms they are given. If you give a computer a poor algorithm, you will get a poor result – hence the phrase: ‘Garbage in, garbage out.’

NEXT LESSON Disaster at the hotel has broken out. You need to apply COMPUTATIONAL THINKING to get the guests to safety.