Computer Science Unplugged Dr. Tom Cortina Carnegie Mellon University.

Slides:



Advertisements
Similar presentations
Content 15.1 Basic features Types of database Data structures 15.2 Creating a database Screen layout Entering data Editing data 15.3 Displaying data Searching.
Advertisements

The scientific method Standard 9.
101.  Take a look at this code and tell me what generation of programming language is used here. It is important that you can EXPLAIN how you came up.
Scientific Method.
Chair of Software Engineering Einführung in die Programmierung Introduction to Programming Prof. Dr. Bertrand Meyer Exercise Session 10.
(CS1301) Introduction to Computer Programming City Univ of HK / Dept of CS / Helena Wong 0. Course Introduction - 1
SASE Contextualised group work – teaching a broader mathematics curriculum to first year science students: Case study – Problem solving Jo-ann Larkins.
Information from Samples Alliance Class January 17, 2012 Math Alliance Project.
Classroom language & Giving instructions
Computer Science Unplugged Dr. Tom Cortina Carnegie Mellon University.
Search Lesson CS1313 Spring Search Lesson Outline 1.Searching Lesson Outline 2.How to Find a Value in an Array? 3.Linear Search 4.Linear Search.
Computer Science Unplugged Dr. Tom Cortina Carnegie Mellon University Sponsored by.
Twenty Questions Information Theory Girls Engaged in Math and Science, June 2012.
Balance that beam Ricky Martinez. Stage 1- Desired Results Established Goals: The student demonstrates an understanding of the processes of science by:
Christiana Ibanga EDIT 271 Spring This web-based module provides information to educators and learners on how to create a WebQuest. The main audience.
Critical Thinking Primary Mathematics. Views of Mathematics The way in which we teach mathematics is likely to be influenced by what we think mathematics.
CSCI 200 Introduction To Programming with Visual Basic Bob Bradley.
Illuminating Computer Science CCIT 4-6Sep
By Edward Lim 8.7.  What?  Today we started the Cornerstone Piece and we were given a few tasks to complete. The tasks were to watch the Kurt Fearnly.
Science Fair Research Paper
Room 10 Lisa Wilson. Contact Information   (phones do not ring during the school day)  Check out my.
Center for Embedded Networked Sensing University of California, Los Angeles CS4HS Workshop July 23, 2009 And kinesthetic computer science activities Lynn.
Name:___________________ Room #_____________. Science Fair Contract By signing below I realize I am responsible for: Paying Attention in Class Asking.
Computing Fundamentals Module Lesson 19 — Using Technology to Solve Problems Computer Literacy BASICS.
By Professor Dr Anne Bamford, Director of the International Research Agency The 3D in Education.
Unit 2 A Flat World.  Objectives Objectives  FocusFocus  Warming up Warming up  7.1 Asking people to do things 7.1 Asking people to do things  7.2.
Presented by : SALWA RAGAB SAWSAN HABEEB OLA abo hasanen :To Dr. Nazmi Al masri.
Computer Science Unplugged Dr. Tom Cortina Carnegie Mellon University.
Computer Science Unplugged Dr. Tom Cortina Carnegie Mellon University.
CLASSROOM PROCEDURES Ms. Blake’s Classroom Whitmore-Bolles Elementary Dearborn, Michigan.
A PowerPoint about Algorithm’s. What is an algorithm? A list Of cammands / instructions to do a tasks.
Ch-4 Reading Fluency Presentation By: Kartavya Parmar Guided By: Lect. Rahul Chav.
Building a Robot Exploring Computer Science Lesson 6-4.
ABC FUN MARIA RIVERA. Main Curriculum Tie: 1st Grade - Content Standard 1 Objective 2 Develop and demonstrate skills in gross and fine motor movement.
Computational Thinking
ONENOTE ST CENTURY LEARNING TOOLS Tips and tools for working with OneNote in the Classroom.
1:1 Computing at Fremont High School. Fremont High School Background -3 computer labs Leo PC’s in each -The time that I was there half did not work.
Physics 2a – Motion and Forces Accuracy and precision Prior learning Know ways accuracy and precision can be improved In an experiment. Key words –Accuracy,
Strategies for Taking Standardized Tests This year is the first year you will take a test called the EOG. EOG stands for End of Grade test. You will.
Lecture on Binary Search and Sorting. Another Algorithm Example SEARCHING: a common problem in computer science involves storing and maintaining large.
Computing Fundamentals Module Lesson 6 — Using Technology to Solve Problems Computer Literacy BASICS.
Sorting.
CS Class 22 Today  A word from the Real World What happens when software goes bad…  Binary Search Announcements  Exam 3 – Nov. 25 th in class.
Packages Available for Purchase: Subject Area:  Math  Language arts  Science  Math (Spanish version)  ELL Grade Level:  Pre-Kindergarten  K-2 nd.
Word Processing Word processing packages such as Microsoft Word are text based. When text is entered via a keyboard, the characters are displayed on screen.
ICT and Health & Safety Lesson 5. Starter – 5 minutes write Lessons Aims in space provided in booklet Lesson Aims: To begin to collect information for.
Searching & Sorting. Algorithms Step by step recipe to do a task…
Computer Science Unplugged Dr. Tom Cortina Carnegie Mellon University Sponsored by.
Lesson 3.5. ACT Practice Questions 1)Get out a piece of paper, and put your name on it. 2)I am going to show you 3 practice ACT math questions, and I.
Unit 2 Day 11 FOCS – Human Computer Interaction. Tower Building Presentation Explain your solution.
DRILL: Look at the image below. Write down what it is, AND how you know using complete sentences.
ACT Prep: Lesson 3 Get out a piece of paper and put your name on it!
By: Krista Hass. You don’t have to be Einstein to pass this test. Just follow these simple steps and you’ll be on your way to great success on the ACT.
Lists and Sorting Algorithms
Reading Comprehension. 7/3/ A Fact !  A large section of any examination paper is usually based on comprehension passages  The importance of reading?
Introduction to Eclipse
An Unplugged Introduction
IGCSE 6 Cambridge Effectiveness of algorithms Computer Science
Foundation Stage Maths Workshop
3 5 Math is Fun
Sorting by Tammy Bailey
Introduction to Programmng in Python
Year 2 (National Numeracy Strategy) (Based on DFEE Sample Lessons)
Binary Search and Intro to Sorting
Intro to Computer Science CS1510 Dr. Sarah Diesburg
Lesson Objectives By the end of the lesson you will:
Year 2 Spring Term Week 5 Lesson 4
Year 2 Spring Term Week 5 Lesson 4
Year 2 Spring Term Week 5 Lesson 3
Presentation transcript:

Computer Science Unplugged Dr. Tom Cortina Carnegie Mellon University

Computer Science Unplugged CS Unplugged is a book of activities that illustrate computer science principles without using a computer. Activities are short and are designed to be easily integrated into classes and include exercises and lesson plans for teachers.

CS UNPLUGGED The basic edition of Computer Science Unplugged has 12 classroom exercises for you to use with your students. Each exercise has a number of extensions, activities and background information. All activities can be done without the use of computers, but they all demonstrate fundamental principles used in computers today.

TWENTY GUESSES How much information is there in a 1000-page book? Is there more information in a 1000-page telephone book, or in Tolkien's Lord of the Rings?  If we can measure this, we can estimate how much space is needed to store the information. This activity introduces a way of measuring information content.

TWENTY GUESSES Can you read the following sentence? Ths sntnc hs th vwls mssng. You probably can, because there is not much "information" in the vowels.

TWENTY GUESSES I am thinking of a number between 1 and 100. I will start you off with 20 pieces of candy. You may only ask questions that have a "yes" or "no" answer. For each incorrect guess, you will lose one piece of candy. Once you guess correctly, you can keep whatever candy remains.

TWENTY GUESSES To pick a number between 0 and 100, 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 1000, you would only need 3 additional guesses. You can guess a number between 0 and 1 million in only 20 guesses!

LIGHTEST & HEAVIEST Computers are often used to put lists into some sort of order (e.g. names into alphabetical order, appointments or by date, etc.)  If you use the wrong method, it can take a long time to sort a large list into order, even on a fast computer. In this activity children will discover different methods for sorting, and see how a clever method can perform the task much more quickly than a simple one.

LIGHTEST & HEAVIEST Start with 8 containers with different amounts of sand or water inside. Seal tightly. Children are only allowed to use the scales to compare the relative weights of two containers. Only two containers can be compared at a time.

LIGHTEST & HEAVIEST METHOD 1 is called Selection Sort. METHOD 2 is called Quick Sort. Generally, quick sort is a lot faster than selection sort is.

BEAT THE CLOCK

This activity illustrates structures used in parallel sorting networks. Kids sort data by walking through a sorting network laid out on the floor. The network simulates how a parallel network would sort data.  Kids find out that data can be sorted a lot faster in parallel!