Can You Compute?
  • HOME
    • Class of 2017
    • COVER LESSON FB
    • Yr 10: Program of Study 2016
    • Yr 11:Coming soon
    • Student Showcase
  • KS3
    • Term 6: Databases
    • Term 5 Scratch
    • Term 4 Websites
    • Term 3 Spreadsheets
    • Term 2: Binary & Algorithms
    • Term 1: Basics and Hardware
  • Yr 9
    • Year End Examination
    • L13-15: School Brochure
    • L12: Building a Computer
    • L11: Buying a House
    • L10: Logic Gates
    • L9: Presentations
    • L8: Binary
    • L7: CS Alan Turing
    • L6: Spreadsheets
    • L5: JS in an Hour!
    • L4: Intro to Coding
    • L3: IT Review and Mail Merge
    • L2: IT Letter Writing
    • L1: CS Compression
  • J276/01
    • Unit 1 Overview
    • EPIC FAILS
    • 1.1 System Architecture >
      • L1: The CPU
      • L2: The CPU in action
      • L3: CPU Recap
      • L4: Intro to LMC
      • L5: Problem solving with LMC
      • L6: LMC Subtraction
      • L7: LMC Looping
      • L8: LMC Multiplication
      • L9: Embedded Systems
      • L10: End of Term Exam
    • 1.2 Memory >
      • L1: RAM, ROM & MEMORY
      • L2: What do you know?
    • 1.3 Storage >
      • L1: Storage part 1
      • L2: Storage part 2
      • L3: Storage recap
    • 1.4 Wired / Wireless Networks >
      • L1: Introduction
      • L2: P2P & CS
      • L3: Hardware
      • L4: The Internet
      • L5: Web Server TO DO
      • L5: End of Unit Test
    • 1.5 Network topologies, protocols and layers >
      • L1: Topologies
      • L2: Protocols
      • L3: Packets and Layers
      • L4: Packets Games
      • L5: Routing Game
      • L6: End of Unit Test
    • 1.6 System Security
    • 1.7 System Software >
      • L1: The Operating System
      • L2: Utility Software
      • L3: GUI and Games
      • L4: Unit Test
  • J276/02
    • Unit 2 Overview
    • 2.1 Algorithms >
      • L1: Intro to Algorithms
      • L2: The Knight's Tour
      • L3: Bresenham
      • L4: Searching Algorithms
      • L5: Bubble Sort
      • L6: Insertion Sort
      • L7: Merge
      • L8: Sorting Recap
      • L9: Creating Algorithms
      • L10: Pseudocode
      • L11: Interpreting Algorithms
      • L12: End of Unit Test
    • 2.2 Programming Techniques >
      • Coding Intro
      • L1: Programming Concepts
      • L2: Sequence, Selection & Iteration
      • L3: SSI Practice
      • L4: String Manipulation
      • L5: Secret Codes
      • L6: File Handling
      • L7: Use of records to store data
      • L8: SQL
      • L9: SQL Python
      • L10 ,11, 12: Arrays
      • L13: Functions
      • L14: Data Types
      • L15: Casting
      • L16 -17: Test and Code
    • 2.3 Robust Programs >
      • L1 : Defensive Design
      • L2 : Testing Programs
    • 2.4 Computational Logic >
      • L1: Comp. Logic 1
      • L2: Comp. Logic 2
      • L3: Operators (Python)
    • 2.5 Translators & Language >
      • L1: Types of Languages
      • L2: Translators
    • 2.6 Data Representation >
      • L1: Units
      • L2: Numbers Binary
      • L3: Binary Addition
      • L4: Hexadecimal
      • L5: Recap
      • L6: Characters
      • L7: Images
      • L8: SenseHAT images
      • L9: Sound & Sampling
      • L10: Code Sound
      • L11: Compression Part 1
      • L12: Compression Part 2 >
        • Compression
      • What do you know?
  • J276/03 NEA
    • Overview
    • Part One
    • Part Two
    • Analysis
    • Success Criteria
    • Design - Algorithms
    • Pseudocode
    • Testing
  • Py
    • Coding Concepts
    • Writing your first Program
    • Python Pages
    • Python Playground
    • Strings
    • Python Operators
    • Functions
    • Conditions
    • Try and Except
    • Break and Continue
    • Odd codes
  • Py +
    • Looping
    • Why does my code not work?
    • Errors
    • Validation
    • Lists
    • Lists again
    • Looking for data in String
    • Writing to Files
    • Read, Write & Sorting Data
  • CODING
    • Magic Python
    • Alan Turing
    • Brian the Turtle
    • Grade Calculator
    • Nested IF Hotels
    • Vending Machine
    • A Looping Menu
    • For
    • Christmas Coding
    • JS in an Hour!
    • CSS + HTML
    • Medical Claims
    • Hour of Code 2015
  • Contact
    • Dictionaries - coming soon
    • L2:

2.1 lesson 1:
introduction to algorithms


In this LESSON you will learn about:

Learning Objectives:


In this lesson you will learn about computational thinking such as abstraction, decomposition and algorithmic thinking

  1. Know what abstraction, decomposition and algorithmic thinking are.
  2. Identify the four elements / symbols of an algorithmic diagram​​​​
  3. Create diagrams to show algorithms 

Lesson Overview 

Resources


Starter:
Can you follow the simple programs, these are algorithms

Main:
  1. Watch the teacher presentation on Algorithms and take part in the activities and class discussions
  2. Use the Algorithm Ref sheet to help Minibot get home, create an algorithm of the required instructions.
  3. Swap and compare your answer with another student, peer assess
  4. Now think about the colours of the rainbow, can you remember the song?  Create an algorithm for sorting the colours into order.  Assume that the rainbow starts with a random colour and then another is added
  5. Share you ideas and improve your algorithm.

​​Plenary:​​
​Write down a definition of abstraction, decomposition and algorithmic thinking in your books.

Teacher's Notes
File Size: 277 kb
File Type: pptx
Download File

2 Algorithm Ref
File Size: 109 kb
File Type: docx
Download File

2 Mini-Bot
File Size: 111 kb
File Type: docx
Download File

Rainbow Soultion
File Size: 268 kb
File Type: docx
Download File

extra_reading.pdf
File Size: 2301 kb
File Type: pdf
Download File


Home Study:


Complete the HW sheet for next lesson
Algorithm HW
File Size: 1183 kb
File Type: pdf
Download File

  • HOME
    • Class of 2017
    • COVER LESSON FB
    • Yr 10: Program of Study 2016
    • Yr 11:Coming soon
    • Student Showcase
  • KS3
    • Term 6: Databases
    • Term 5 Scratch
    • Term 4 Websites
    • Term 3 Spreadsheets
    • Term 2: Binary & Algorithms
    • Term 1: Basics and Hardware
  • Yr 9
    • Year End Examination
    • L13-15: School Brochure
    • L12: Building a Computer
    • L11: Buying a House
    • L10: Logic Gates
    • L9: Presentations
    • L8: Binary
    • L7: CS Alan Turing
    • L6: Spreadsheets
    • L5: JS in an Hour!
    • L4: Intro to Coding
    • L3: IT Review and Mail Merge
    • L2: IT Letter Writing
    • L1: CS Compression
  • J276/01
    • Unit 1 Overview
    • EPIC FAILS
    • 1.1 System Architecture >
      • L1: The CPU
      • L2: The CPU in action
      • L3: CPU Recap
      • L4: Intro to LMC
      • L5: Problem solving with LMC
      • L6: LMC Subtraction
      • L7: LMC Looping
      • L8: LMC Multiplication
      • L9: Embedded Systems
      • L10: End of Term Exam
    • 1.2 Memory >
      • L1: RAM, ROM & MEMORY
      • L2: What do you know?
    • 1.3 Storage >
      • L1: Storage part 1
      • L2: Storage part 2
      • L3: Storage recap
    • 1.4 Wired / Wireless Networks >
      • L1: Introduction
      • L2: P2P & CS
      • L3: Hardware
      • L4: The Internet
      • L5: Web Server TO DO
      • L5: End of Unit Test
    • 1.5 Network topologies, protocols and layers >
      • L1: Topologies
      • L2: Protocols
      • L3: Packets and Layers
      • L4: Packets Games
      • L5: Routing Game
      • L6: End of Unit Test
    • 1.6 System Security
    • 1.7 System Software >
      • L1: The Operating System
      • L2: Utility Software
      • L3: GUI and Games
      • L4: Unit Test
  • J276/02
    • Unit 2 Overview
    • 2.1 Algorithms >
      • L1: Intro to Algorithms
      • L2: The Knight's Tour
      • L3: Bresenham
      • L4: Searching Algorithms
      • L5: Bubble Sort
      • L6: Insertion Sort
      • L7: Merge
      • L8: Sorting Recap
      • L9: Creating Algorithms
      • L10: Pseudocode
      • L11: Interpreting Algorithms
      • L12: End of Unit Test
    • 2.2 Programming Techniques >
      • Coding Intro
      • L1: Programming Concepts
      • L2: Sequence, Selection & Iteration
      • L3: SSI Practice
      • L4: String Manipulation
      • L5: Secret Codes
      • L6: File Handling
      • L7: Use of records to store data
      • L8: SQL
      • L9: SQL Python
      • L10 ,11, 12: Arrays
      • L13: Functions
      • L14: Data Types
      • L15: Casting
      • L16 -17: Test and Code
    • 2.3 Robust Programs >
      • L1 : Defensive Design
      • L2 : Testing Programs
    • 2.4 Computational Logic >
      • L1: Comp. Logic 1
      • L2: Comp. Logic 2
      • L3: Operators (Python)
    • 2.5 Translators & Language >
      • L1: Types of Languages
      • L2: Translators
    • 2.6 Data Representation >
      • L1: Units
      • L2: Numbers Binary
      • L3: Binary Addition
      • L4: Hexadecimal
      • L5: Recap
      • L6: Characters
      • L7: Images
      • L8: SenseHAT images
      • L9: Sound & Sampling
      • L10: Code Sound
      • L11: Compression Part 1
      • L12: Compression Part 2 >
        • Compression
      • What do you know?
  • J276/03 NEA
    • Overview
    • Part One
    • Part Two
    • Analysis
    • Success Criteria
    • Design - Algorithms
    • Pseudocode
    • Testing
  • Py
    • Coding Concepts
    • Writing your first Program
    • Python Pages
    • Python Playground
    • Strings
    • Python Operators
    • Functions
    • Conditions
    • Try and Except
    • Break and Continue
    • Odd codes
  • Py +
    • Looping
    • Why does my code not work?
    • Errors
    • Validation
    • Lists
    • Lists again
    • Looking for data in String
    • Writing to Files
    • Read, Write & Sorting Data
  • CODING
    • Magic Python
    • Alan Turing
    • Brian the Turtle
    • Grade Calculator
    • Nested IF Hotels
    • Vending Machine
    • A Looping Menu
    • For
    • Christmas Coding
    • JS in an Hour!
    • CSS + HTML
    • Medical Claims
    • Hour of Code 2015
  • Contact
    • Dictionaries - coming soon
    • L2: