Teaching computing to ks3
Download
1 / 17

Teaching Computing to KS3 - PowerPoint PPT Presentation


  • 173 Views
  • Uploaded on

Teaching Computing to KS3. Sue Sentance [email protected] Sophie Baker [email protected] Course outline. What is computational thinking?.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' Teaching Computing to KS3' - giulia


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
Teaching computing to ks3

Teaching Computing to KS3

Sue Sentance

[email protected]

Sophie Baker

[email protected]



What is computational thinking
What is computational thinking?

Computational thinking is recognised as a key skill set for all 21st-century learners – whether they intend to continue with computing science or not. It involves viewing the world through the thinking practices that software developers use to write programs.

5 main areas:

  • seeing a problem and its solution at many levels of detail (abstraction)

  • thinking about tasks as a series of steps (algorithms)

  • understanding that solving a large problem will involve breaking it down into a set of smaller problems (decomposition)

  • appreciating that a new problem is likely to be related to other problems the learner has already solved (pattern recognition)

  • realising that a solution to a problem may be made to solve a whole range of related problems (generalisation).


Key features of computers
Key features of computers

  • Computers are deterministic: they do what you tell them to do. This is news to many, who think of them as pure magic.

  • Computers are precise: they do exactly what you tell them to do.

  • Computers can therefore be understood; they are just machines with logical working.

    See CAS Computing Curriculum document (KS3) for what we are looking at in these sessions.


Algorithms
Algorithms

An algorithm is a sequence of instructions

Solving a problem involves breaking it down into tasks and being able to describe steps to solve each aspect of the task.

The following 4 slides have been taken from the CS Inside website: http://csi.dcs.gla.ac.uk


What is the similarity between these
What is the similarity between these?

  • Cooking recipe

  • Downloading software or music

  • Car repair manual

  • Setting up a music playlist

  • Knitting pattern

  • Calling a friend on the phone

  • Sheet music


What written instructions have you followed
What written instructions have you followed…?

  • …to complete a task?

    • Can you give an example?

  • Were the instructions easy or difficult to follow?

    • Why? What made them easy/ hard?

      • They made sense?

      • You couldn’t understand them?

      • They didn’t give you enough information?


Why discuss lists of instructions here
Why discuss lists of instructions here??

  • Computer programs are lists of instructions

    • with very particular characteristics

    • known as algorithms

  • How many of you know of a famous computer error/mistake?

  • These are caused by the wrong instructions in the program

    • the instructions were interpreted by the computer in a way not intended by the program designer

  • We are going to explore how these errors come about


Algorithm exercise follow exactly
Algorithm exercise – follow exactly!!

  • Draw a diagonal line

  • Draw another diagonal line connected to the top of the first one

  • Draw a straight line from the point where the diagonal lines meet

  • Draw a horizontal line over the straight line

  • At the bottom of the straight line, draw a curvy line

  • Draw a diagonal line from the bottom of the first diagonal to the straight line

  • Draw a diagonal line from the bottom of the second diagonal to the straight line


How did the pictures turn out
How did the pictures turn out?

  • Compare your picture with others' pictures…

    • Were they different?

    • Why?

    • What was difficult about following the instructions

    • What was missing from the instructions?

      Can you improve on these instructions?


Another algorithm
Another algorithm

Swap puzzle

http://www.cs4fn.org/algorithms/swappuzzle/


An algorithm for noughts and crosses
An algorithm for noughts and crosses

In pairs, play noughts and crosses with one player using the algorithm on the handout exactly.

Does the person with the algorithm win?


A design an algorithm
(a) Design an algorithm

  • The task/problem:

    • make a shape out of paper – one sheet of A4

  • Write the algorithm

    • Write a set of instructions that explains how to make a paper shape from 1 sheet of A4 paper

  • Test it

    • Try out your algorithm – does it work?

    • Note: follow your instructions as closely as possible

    • Adjust the instructions if necessary


B following an algorithm
(b) Following an algorithm

  • Hide your shape

  • Get into pairs

    • by teaming up with someone on the opposite side of the room

    • move to sit together

    • Do notshow them your paper shape – hide it!!

  • Swap algorithm/instructions with your partner

  • Follow your partner's instructions to create their paper shape

  • Compare shapes

    • how similar is each 'pair' of shapes?

    • what advice can you give on how to improve the instructions?


What do we know about algorithms
What do we know about algorithms?

  • What are the key characteristics of a “good” algorithm? Why are they hard to develop?

    • Must be unambiguous

    • Must be correct

    • Must be at the right level of detail

  • Also, what did we learn about problems we pick?

    • too large sometimes?


Conclusions
Conclusions

  • Algorithm

    • step-by-step method for accomplishing a task

  • Following an algorithm

    • relatively easy

  • Finding/designing Algorithms

    • difficult but exciting and fulfilling

    • the designed algorithm contains the intelligence of its developer

  • Algorithms are a fundamental part of Computer Programming and of Computing Science


Programming and algorithms
Programming and algorithms

In order to be a successful programmer, in Scratch, Python or any environment, students need to be able to develop algorithms that they then can automate in a program.

Cue Sophie!!


ad