Computational Thinking

Slides:



Advertisements
Similar presentations
Clint Chan Lynnwood High School
Advertisements

Computational Thinking: An Important Skill for All Students Joe Kmoch Milwaukee Public
A Digital Age Skill for All Joe Kmoch Milwaukee Washington HS of IT For WI Math Council, May 2012 was: CT: An Important Idea for All Students:
Is Computational Thinking a 21st Century Skill? Joe Kmoch Milwaukee Public Schools 1.
CSTA K-12 Computer Science Standards (rev 2011)
Could/Should CS be Counted for a Math Credit? Wisconsin Mathematics Council Annual Conference Green Lake, WI Friday, May 2, 2014 Joe Kmoch
Standards Alignment A study of alignment between state standards and the ACM K-12 Curriculum.
CMSC 104, Version 8/061L04Algorithms1.ppt Algorithms, Part 1 of 3 Topics Definition of an Algorithm Algorithm Examples Syntax versus Semantics Reading.
Computational Thinking 101 “Computational thinking is a fundamental skill for everybody, not just for computer.
PSAE Practice Session Science Mr. Johns Room 2012.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
Le Moyne College Summer Math Academy August 2007 Computational Thinking & Related Tools.
Computer Science 335 Data Compression.
DAST, Spring © L. Joskowicz 1 Data Structures – LECTURE 1 Introduction Motivation: algorithms and abstract data types Easy problems, hard problems.
Engineering H192 - Computer Programming The Ohio State University Gateway Engineering Education Coalition Lect 3P. 1Winter Quarter Structured Engineering.
Computer Science Unplugged Dr. Tom Cortina Carnegie Mellon University.
New Mexico Computer Science For All Introduction to Algorithms Maureen Psaila-Dombrowski.
Computational thinking. Hour of Code Prof Dr. Valentina Dagiene Ágnes Erdősné Németh Maria Gaiduk Bojan Kostadinov.
Management Information Systems Lection 06 Archiving information CLARK UNIVERSITY College of Professional and Continuing Education (COPACE)
COMP 1001: Introduction to Computers for Arts and Social Sciences.
Computer Science Unplugged Dr. Tom Cortina Carnegie Mellon University Sponsored by.
Girl Develop It Ottawa Introduction to Programming With Scratch Introduction.
Teaching Teaching Discrete Mathematics and Algorithms & Data Structures Online G.MirkowskaPJIIT.
Illuminating Computer Science CCIT 4-6Sep
A Digital Age Skill for All [space for presenters name, organization]
Technology and digital images. Objectives Describe how the characteristics and behaviors of white light allow us to see colored objects. Describe the.
Alan Turing In 1950 asked - Can Machines Think? Turing changed that into the Turing Test “Can Computers Understand Language?” would have been.
CSCI 4410 Introduction to Artificial Intelligence.
Overview of Computing. Computer Science What is computer science? The systematic study of computing systems and computation. Contains theories for understanding.
Data Representation CS280 – 09/13/05. Binary (from a Hacker’s dictionary) A base-2 numbering system with only two digits, 0 and 1, which is perfectly.
Suzanne Westbrook, PhD School of Information: Science, Technology, & Arts Computer Science Dept, UA.
Computational Thinking September 2006 Jeannette M. Wing President’s Professor of Computer Science and Department Head Computer Science Department Carnegie.
Computer Science Unplugged Dr. Tom Cortina Carnegie Mellon University.
Computer Science Unplugged Dr. Tom Cortina Carnegie Mellon University.
Logical Circuit Design Week 2,3: Fundamental Concepts in Computer Science, Binary Logic, Number Systems Mentor Hamiti, MSc Office: ,
Computational Thinking in K-12 and Scalable Game Design Michael Shuffett.
Discrete Structures for Computing
1 CSC 222: Computer Programming II Spring 2004 See online syllabus at: Course goals:
Algorithms, Part 1 of 3 Topics  Definition of an Algorithm  Algorithm Examples  Syntax versus Semantics Reading  Sections
Introduction to Problem Solving. Steps in Programming A Very Simplified Picture –Problem Definition & Analysis – High Level Strategy for a solution –Arriving.
CS 127 Introduction to Computer Science. What is a computer?  “A machine that stores and manipulates information under the control of a changeable program”
Engineering H192 - Computer Programming Gateway Engineering Education Coalition Lect 3P. 1Winter Quarter Structured Engineering Problem Solving and Logic.
CS404 Design and Analysis of Algorithms BBy DDr. M V S Peri Sastry BB.E, PhD(BITS-Pilani)
Computer Science Unplugged Dr. Tom Cortina Carnegie Mellon University Sponsored by.
1 UMBC CMSC 104, Section Fall 2002 Algorithms, Part 1 of 3 Topics Definition of an Algorithm Algorithm Examples Syntax versus Semantics Reading.
Onlinedeeneislam.blogspot.com1 Design and Analysis of Algorithms Slide # 1 Download From
Computer Science Unplugged Dr. Tom Cortina Carnegie Mellon University.
*Solution Fluency *Information Fluency *Collaboration Fluency *Creativity Fluency *Media Fluency *Digital Citizen By Tricia Cherek EDT 652.
Progression in KS3/4 Algorithms MONDAY 30 TH NOVEMBER SUE SENTANCE.
1Computational ThinkingJeannette M. Wing Biology - Algorithms for DNA sequencing of human genome Brain Science - Modeling the brain as a computer CT in.
INQUIRY: CODING IN BC MONTESSORI SCHOOLS. BACKGROUND CODING IN SCHOOLS MONTESSORI PRINCIPLES IMPLEMENTATION AGENDA.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
Design and Analysis of Algorithms Faculty Name : Ruhi Fatima Course Description This course provides techniques to prove.
CMSC 104, L041 Algorithms, Part 1 of 3 Topics Definition of an Algorithm Example: The Euclidean Algorithm Syntax versus Semantics Reading Sections 3.1.
1CT: 1.5 Years LaterJeannette M. Wing CT in Other Sciences, Math, and Engineering Biology - Shotgun algorithm expedites sequencing of human genome - DNA.
Coding Connections at the Interface of Algebra I and Physical World Concepts Improving Teacher Quality Grant Program Summer 2016.
Understanding Children’s Thinking Through Number Talks
Algorithms, Part 1 of 3 The First step in the programming process
Algorithms, Part 1 of 3 Topics Definition of an Algorithm
Computational Thinking Throughout the Curriculum
Algorithms I: An Introduction to Algorithms
Computational Thinking
A Digital Age Skill for All
2008/09/17: Lecture 4 CMSC 104, Section 0101 John Y. Park
UBC 2016 Why Coding?.
Computer Programming is not a Math Credit
Representing Images 2.6 – Data Representation.
Algorithms, Part 1 of 3 Topics Definition of an Algorithm
Introduction to Artificial Intelligence Instructor: Dr. Eduardo Urbina
Algorithms, Part 1 of 3 Topics Definition of an Algorithm
Presentation transcript:

Computational Thinking What is it? Computer Science Unplugged

Computational Thinking (CT) (from Jeannette Wing’s website) Computational thinking will be a fundamental skill used by everyone in the world by the middle of the 21st Century. J.M. Wing, “Computational Thinking,” CACM Viewpoint, March 2006, pp. 33-35. http://www.cs.cmu.edu/~wing/

Examples of CT (from Jeannette Wing’s website) Determining how difficult a problem is to solve. Thinking recursively. Choosing an appropriate representation for data to simplify the solution to problems. Reformulating a seemingly difficult problem into one which we know how to solve. Using abstraction and decomposition in tackling a large complex task. Using the difficulty of solving hard AI problems to foil computing agents.

Examples of CT in daily life (from Jeannette Wing’s website) Sorting important documents. Choosing a line at the supermarket. (queuing and scheduling) Putting things in your child’s knapsack for the day. (caching) Running errands (Traveling salesperson) Cooking dinner or washing loads of laundry (parallel processing/pipelining)

CT in STEM (from Jeannette Wing’s website) Biology Shotgun algorithm expedites sequencing of human genome DNA sequences are strings in a language Brain Science Analyzing fMRI data with machine learning algorithms Chemistry Optimization and searching algorithms identify best chemicals for improving reaction conditions to improve yields

CT in STEM (from Jeannette Wing’s website) Earth Science Modeling the earth or the sun: inner core, surface, atmosphere Astronomy Sloan Digital Sky Server brings a telescope to every child Mathematics Discovering E8 Lie Group: Profound implications for physics (string theory) Engineering Boeing 777 tested via computer simulation alone, not in a wind tunnel

Computational Thinking An Operational Definition for K-12 Computational thinking (CT) is a problem-solving process that includes (but is not limited to) the following characteristics: Formulating problems in a way that enables us to use a computer and other tools to help solve them. Logically organizing and analyzing data Representing data through abstractions such as models and simulations Automating solutions through algorithmic thinking (a series of ordered steps) Identifying, analyzing, and implementing possible solutions with the goal of achieving the most efficient and effective combination of steps and resources Generalizing and transferring this problem solving process to a wide variety of problems

Computational Thinking An Operational Definition for K-12 These skills are supported and enhanced by a number of dispositions or attitudes that are essential dimensions of CT. These dispositions or attitudes include: Confidence in dealing with complexity Persistence in working with difficult problems Tolerance for ambiguity The ability to deal with open ended problems The ability to communicate and work with others to achieve a common goal or solution

Computer Science Unplugged

Count The Dots Data in computers is stored and transmitted as a series of zeros and ones. How can we represent words and numbers using just these two symbols?

Count The Dots Letters are represented in computers in binary also. Blank 0 000002 A 1 000012 B 2 000102 C 3 000112 ... Z 26 110102

Count The Dots blank 0 A 1 B 2 C 3 D 4 E 5 F 6 G 7 H 8 I 9 J 10 K 11 L 12 M 13 N 14 O 15 P 16 Q 17 R 18 S 19 T 20 U 21 V 22 W 23 X 24 Y 25 Z 26 01001 00011 00101 00000 10010 00001 01101 I C E _ R A M

Color By Numbers Computer screens are divided up into a grid of small dots called pixels (picture elements). In a black and white picture, each pixel is either black or white. Computers store drawings, photographs and other pictures using only numbers. The following activity demonstrates how a computer image can be stored efficiently.

Color By Numbers The letter a has been magnified to show the pixels. When a computer stores a picture, all that it needs to store is which dots are black and which are white. 1,3 4,1 1,4 0,1,3,1

Color By Numbers 6,5,2,3 4,2,5,2,3,1 3,1,9,1,2,1 3,1,9,1,1,1 2,1,11,1 2,1,10,2 2,1,9,1,1,1 2,1,8,1,2,1 2,1,7,1,3,1 1,1,1,1,4,2,3,1 0,1,2,1,2,2,5,1 0,1,3,2,5,2 1,3,2,5

Color By Numbers This technique is called run-length encoding. Fax transmission Compression of images Color encoding Use two numbers per run First number is how many pixels as before Second number is what color (1=red, 2=green, ...)

Information Theory Can you read the following sentence? How much information is there in a book? Is there more information in a telephone book, or in Harry Potter and the Deathly Hallows? If we can measure this, we can estimate how much space is needed to store the information. Can you read the following sentence? Ths sntnc hs th vwls mssng.

Twenty Guesses I am thinking of a number between 0 and 127. You may only ask questions that have a "yes" or "no" answer. For each question, you will lose one piece of candy. Once you guess the number correctly, you can keep whatever candy remains.

Twenty Guesses To pick a number between 0 and 127, you only need 7 guesses. Always shoot for the middle number of the range and eliminate half the possibilities! This concept is called binary search. If the number was between 0 and 1,023, you would only need 3 additional guesses. You can guess a number between 0 and 1,048,575 in only 20 guesses!

Beat The Clock