Can You Compute?
  • HOME
    • Class of 2017
    • COVER LESSON FB
    • Yr 10: Program of Study 2016
    • Yr 11:Coming soon
    • Student Showcase
  • KS3
    • 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
  • 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:

analysis

This lesson looks at "Analysis", an essential skill you will need in order to plan and develop a solution to computational challenges and problems.

Analysis is about:
  • problems rather than solutions, why rather than how, discovery rather than invention
  • structure rather than disorder, justification rather than assertion, questions rather than answers, fact rather than opinion

Task 1:What did the graph say?
  • Look at the graph below, analyse it, what does it tell you, what questions do you have?
Picture
The graph is about CPU or processor speed (shown on the left) and the year it was made.

  1. Write down three facts
  2. What else can you tell from the graph
  3. Write down three questions you have
  4. Write down three predictions based on this graph
  5. Can you find any evidence to support your findings
  6. Check out Moore's Law, what does it say?
  7. Does Moore's Law support your findings / the graph, why
  8. Any other points you would like to make

  • Each of these points can be disucssed in groups
Task 2: Look at your example task:
  1. In groups use your skills of analysis to pull out the facts / questions, uncertainties, predictions that you have.
  2. You could write these down in a table with some thoughts on a solution.
  3. Did I mention, talk to other students about their ideas too.
  4. Create a Mindmap of your ideas and thoughts
  • MindMup
  • Text Mindmap 
  • Bubble
  • HOME
    • Class of 2017
    • COVER LESSON FB
    • Yr 10: Program of Study 2016
    • Yr 11:Coming soon
    • Student Showcase
  • KS3
    • 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
  • 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:
✕