CS Unplugged Techniques for Teaching Computer Science Concepts.

Slides:



Advertisements
Similar presentations
The people Look for some people. Write it down. By the water
Advertisements

Presentation on Artificial Intelligence
Teaching Sight Words To Your Child…. Remember, before you begin…. Make 2 copies of the words on index cards.
Spit-not-so Prof Paul Curzon Queen Mary University of London With support from Google, D of E.
Binary Trees CSC 220. Your Observations (so far data structures) Array –Unordered Add, delete, search –Ordered Linked List –??
22C:19 Discrete Structures Trees Spring 2014 Sukumar Ghosh.
Computer Science 101 Data Encryption And Computer Networks.
The Binary Numbering Systems
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.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
Solving Puzzles Solutions Puzzle 1: Word Search Sample Algorithm:
June 13, Introduction to CS II Data Structures Hongwei Xi Comp. Sci. Dept. Boston University.
CS 206 Introduction to Computer Science II 10 / 14 / 2009 Instructor: Michael Eckmann.
Binary Search Introduction to Trees. Binary searching & introduction to trees 2 CMPS 12B, UC Santa Cruz Last time: recursion In the last lecture, we learned.
Promising Practices in CS1: Panel Agenda This Short Introduction Barbara Ericson, Georgia Institute of Technology Deepak Kumar, Bryn Mawr College Wanda.
CS 206 Introduction to Computer Science II 04 / 29 / 2009 Instructor: Michael Eckmann.
CS 206 Introduction to Computer Science II 12 / 10 / 2008 Instructor: Michael Eckmann.
Computer Science Unplugged Dr. Tom Cortina Carnegie Mellon University.
Data Compression Gabriel Laden CS146 – Dr. Sin-Min Lee Spring 2004.
Algorithmically Adversarial Input Design “Making Mathematical Reasoning Fun” Workshop ACM SIGCSE, 2013 Brian C. Dean, Chad Waters School of Computing,
+ Intro to The Art of Computer Science Code.org. + Table of Contents Vocabulary Introduction to Computer Science Computer Scientist’s Responsibility Technology.
Computer Science Unplugged Dr. Tom Cortina Carnegie Mellon University Sponsored by.
Supporting Literacy and Numeracy 14 th November, 2011 How to Teach Children good numeracy skills.
Mr. Gifford’s 5 th Grade Math Lesson #6 Comparing and Ordering Decimals.
Talk, Read, Write … Skills for School Pre-Schoolers “Research shows that pre-school children who are exposed to plenty of language (books and conversation)
1 Introduction to Library Databases Basic Searching.
Foundations of Computer Science Computing …it is all about Data Representation, Storage, Processing, and Communication of Data 10/4/20151CS 112 – Foundations.
Error Detection and Correction
I am ready to test!________ I am ready to test!________
Teaching Mathematics Place Value Use of Manipulatives Presented by Dot Shea 2012.
Binary Code: The Language of Computers!
Computer Science Unplugged Dr. Tom Cortina Carnegie Mellon University.
COMP 1001: Introduction to Computers for Arts and Social Sciences Searching Algorithms Monday, May 30, 2011.
Computer Science Unplugged Dr. Tom Cortina Carnegie Mellon University.
Early Experiences Presented by Frank H. Osborne, Ph. D. © 2015 EMSE 3123 Math and Science in Education 1.
This material is made freely available at and is intended for the non-commercial use of students and teachers. These materials may not be.
Communication Technology in a Changing World Week 2.
Discrete Structures for Computing
2015 CSE/EGR Summer Camps 1 Computer Science Concepts 1. What is an algorithm? 2. Binary information coding 3. Programming concepts via Scratch Designed.
CS4HS Columbia University Injecting CS into High School Math and Science Classes Adam Cannon Department of Computer Science Columbia University.
Computational Thinking
1 COMS 161 Introduction to Computing Title: The Digital Domain Date: September 6, 2004 Lecture Number: 6.
UNIT 2 LESSON 3 CS PRINCIPLES. OBJECTIVES Students will be able to: Construct a binary communication protocol for playing Battleship using the Internet.
CS 111 – Sept. 13 Error detection Error correction Review/practice chapter 1 questions Commitment: –Please read sections 2.1 and 2.2.
Sight Words.
Computer Science Unplugged Dr. Tom Cortina Carnegie Mellon University Sponsored by.
Data Structures and Algorithms in Java AlaaEddin 2012.
BALANCING EQUATIONS NO2 - Balancing equations made easy.
Green Eggs and Ham By Dr.Seuss.
CS 101 – Sept. 11 Review linear vs. non-linear representations. Text representation Compression techniques Image representation –grayscale –File size issues.
Geometry (Basic Shapes) Created by Ms. Creasy. Line A line goes on “forever” in both directions. It never stops. You know it is a line if it has an arrow.
Mathematics in the Early Years Foundation Stage.  Count reliably with numbers from one to 20.  Recognise, read and write numbers to 20.  Place numbers.
Teaching Computer Science away from the Computer Kathy Olsson E2BN
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
High Frequency words Kindergarten review. red yellow.
COMPUTERSCIENCE High School Teacher's Workshop The University of Virginia July 9, 2008 And kinesthetic computer science activities Lynn Lambert Christopher.
Dr. Clincy Professor of CS
Tapestry Workshop The University of Virginia July 15, 2009
Lesson 5-15 AP Computer Science Principles
Representing characters
Vocabulary Algorithm - A precise sequence of instructions for processes that can be executed by a computer.
Computational Thinking in the Classroom
EXPLORING COMPUTER SCIENCE Journal Entries, Portfolio Entries, And Check Your Understanding Unit 2 – Strand 2 Problem Solving This unit focuses on.
Communication Technology in a Changing World
Communication Technology in a Changing World
Fundamentals of Data Representation
Huffman Encoding Huffman code is method for the compression for standard text documents. It makes use of a binary tree to develop codes of varying lengths.
Primary School Computing
Presentation transcript:

CS Unplugged Techniques for Teaching Computer Science Concepts.

First Bytes TeachersCS Unplugged2 Most first courses in computer science are very ambitious. Try to teach how to program in a particular language as well as broader concepts. Very easy to get caught up in teaching the programming. –Certainly a necessary thing for later topics in CS. –How do you study operating systems without being able to program parts of them. (Or all of them.)

First Bytes TeachersCS Unplugged3 Designed by New Zealander educators for teaching primary age children Good for older students as well Free from Google – –

First Bytes TeachersCS Unplugged4 Dots Dots. –dots on the next card –make numbers –count –how many numbers –how many numbers if we add a card –what happens when count to limit –secret messages –add a 0 to the end

First Bytes TeachersCS Unplugged5 Pictures using dots for other things why the 0 what kind of pictures require the largest amount of numbers to represent them test it with a real fax machine

First Bytes TeachersCS Unplugged6 0

First Bytes TeachersCS Unplugged7 0

First Bytes TeachersCS Unplugged8 0

First Bytes TeachersCS Unplugged9 Text Compression intro, boxes and arrows decompress this a harder problem numbers instead of boxes and arrows compress this

First Bytes TeachersCS Unplugged10 I am Sam. Sam I am. That Sam-I-am! I do not like that Sam-I-am! Do you like green eggs and ham?

First Bytes TeachersCS Unplugged11 But our fish said, “No! No! Make that cat go away! Tell that Cat in the Hat you do not want to play. He should not be here. He should not be about. He should not be here when your mother is out!”

First Bytes TeachersCS Unplugged12 Error Detection and Correction if letters encoded using bits, what happens if a bit is wrong 5 x 5 cards more cards to make it harder flip flip 2 real life example, ISBN

First Bytes TeachersCS Unplugged13 Searching Cards in random order –each look requires payment of a treat out of a jar –if any left, keep them Cards in sorted order –same rules battleship –each ship has a letter and a number –I pick a number –you want the location of that number –you guess the letter of the ship I picked linear search battleship binary search battleship hashing battleship

First Bytes TeachersCS Unplugged14 Sorting Networks grid on the ground start on left hand side when at a circle wait for another member to arrive compare cards low goes left, high goes right tie? same way you came in

First Bytes TeachersCS Unplugged15 Minimum Spanning Trees the Muddy City connect houses with paving stones goal use the fewest stones can get from one house to any other house, although not always directly

First Bytes TeachersCS Unplugged16 Dragon Stories David Touretzky, Professor at CMU – Common Lisp: A Gentle Introduction to Symbolic Computation – Martin and the Dragon backed up with traces and recursion templates

First Bytes TeachersCS Unplugged17 Problem Solving The Puzzling Adventures of Dr. Ecco Dr. Ecco: Mathematical Detective (Codes, Puzzles, and Conspiracy) Dr. Ecco's Cyberpuzzles: 36 Puzzles for Hackers and Other Mathematical Detective Crossing the River with Dogs

First Bytes TeachersCS Unplugged18 And One Plugged In Activity Google Image Labeler ESP Game, Louis von Alm