COMPUTERSCIENCE High School Teacher's Workshop The University of Virginia July 9, 2008 And kinesthetic computer science activities Lynn Lambert Christopher.

Slides:



Advertisements
Similar presentations
Maths and the making of the modern world The maths behind Google and the Ipod Chris Budd.
Advertisements

Spelling Correction for Search Engine Queries Bruno Martins, Mario J. Silva In Proceedings of EsTAL-04, España for Natural Language Processing Presenter:
Applied Algorithmics - week7
Michael Alves, Patrick Dugan, Robert Daniels, Carlos Vicuna
Huffman code and ID3 Prof. Sin-Min Lee Department of Computer Science.
University of York Department of Health Sciences Presentation Skills By Ian Cole Lecturer in C&IT.
Computer Science 101 Data Encryption And Computer Networks.
The Binary Numbering Systems
SIMS-201 Compressing Information. 2  Overview Chapter 7: Compression Introduction Entropy Huffman coding Universal coding.
Tools for Text Review. Algorithms The heart of computer science Definition: A finite sequence of instructions with the properties that –Each instruction.
Connecting with Computer Science, 2e
Promising Practices in CS1: Panel Agenda This Short Introduction Barbara Ericson, Georgia Institute of Technology Deepak Kumar, Bryn Mawr College Wanda.
CS Unplugged Techniques for Teaching Computer Science Concepts.
Last time 3 main components to a computer system Types of computers Talked about software – task oriented What are some kinds of data that a computer works.
HumanAUT Secure Human Identification Protocols Adam Bender Avrim Blum Manuel Blum Nick Hopper The ALADDIN Center Carnegie Mellon University.
Information Theory and Security
Computer Science Unplugged Dr. Tom Cortina Carnegie Mellon University.
Spring 2015 Mathematics in Management Science Binary Linear Codes Two Examples.
Connecting with Computer Science 2 Objectives Learn why numbering systems are important to understand Refresh your knowledge of powers of numbers Learn.
Computer Science Unplugged Dr. Tom Cortina Carnegie Mellon University Sponsored by.
Section 2.1 Compare the Internet and the Web Identify Web browser components Compare Web sites and Web pages Describe types of Web sites Section 2.2 Identify.
Copyright Vision Literacy Welcome to Super Tutor Saturday! July 21, 2012 Sobrato Center for NonProfits Milpitas, CA.
Robert Copestake About Me Unit 13 Website Microsoft office Photo editing/ Photography Video editing.
Illuminating Computer Science CCIT 4-6Sep
Center for Embedded Networked Sensing University of California, Los Angeles CS4HS Workshop July 23, 2009 And kinesthetic computer science activities Lynn.
Lecture # 3 HTML and Arrays. Today Questions: From notes/reading/life? From Lab # 2 – Preview of Lab # 2 1.Introduce: How do you make a Web Page?: HTML.
--Caesar Cai TEXT RECOGNITION SENIOR CAPSTONE 2012.
Computer Science Unplugged Dr. Tom Cortina Carnegie Mellon University.
Computer Science Unplugged Dr. Tom Cortina Carnegie Mellon University.
(Important to algorithm analysis )
Introduction to web development and HTML MGMT 230 LAB.
Image Representation. Objectives  Bitmaps: resolution, colour depth and simple bitmap file calculations.  Vector graphics: drawing list – objects and.
Centra Basics and Games Presented by Julia Parra
Test Environment Algorithm Program Requirements/ Enhancements Analyze the Problem and Design a Solution Programming Software Translates the Source Code.
Agenda Last class: Memory, Digitizing Numbers Today: Digitizing: Text
CS4HS Columbia University Injecting CS into High School Math and Science Classes Adam Cannon Department of Computer Science Columbia University.
Computational Thinking
Codes & the Hat Game Troy Lynn Bullock John H. Reagan High School, Houston ISD Shalini Kapoor McArthur High School, Aldine ISD Faculty Mentor: Dr. Tie.
3 semesters teaching CS1 with Java using BlueJ with BlueJ book (CS2 is Eclipse) I have taught 6 sections; 4 taught by others CS0 now has 3 weeks if/while/objects/BlueJ.
UNIT 2 LESSON 3 CS PRINCIPLES. OBJECTIVES Students will be able to: Construct a binary communication protocol for playing Battleship using the Internet.
SBD: Information Design
Computer Science Unplugged Dr. Tom Cortina Carnegie Mellon University Sponsored by.
Great Theoretical Ideas in Computer Science for Some.
Computer Science Unplugged Dr. Tom Cortina Carnegie Mellon University.
More Digital Representation Discrete information is represented in binary (PandA), and “continuous” information is made discrete.
introductionwhyexamples What is a Web site? A web site is: a presentation tool; a way to communicate; a learning tool; a teaching tool; a marketing important.
What do you think this lesson is all about? Write your answer on a sticky note.
Securing number facts, relationships and calculating.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
Phase 3: Game Creation. Phase 3: Game Creation Outcomes (Slide 1) I can create a flowchart to solve a problem, for example to make a cup of tea. I can.
Tapestry Workshop: Mentoring for Connections to Computing Activities Karen C. Davis Professor, Electrical & Computer Engineering.
Computer Science Outreach and Study: Difference in interest and ability raised in elementary students through “Computer Science Unplugged” supplemented.
AP CSP: The Need for Addressing
Vocabulary byte - The technical term for 8 bits of data.
Tapestry Workshop The University of Virginia July 15, 2009
Student- Centered Activities For the Secondary Classroom
Everything is a number Everything in a computer memory and on storages is a number. Number  Number Characters  Number by ASCII code Sounds  Number.
Introduction to Randomized Algorithms and the Probabilistic Method
Binary Representation in Audio and Images
Coopersale Theydon Garnon Maths Workshop
“Link All Together” – Linktile 2D game programming
BTEC NCF Dip in Comp - Unit 02 Fundamentals of Computer Systems Lesson 10 - Text & Image Representation Mr C Johnston.
Intermediate 2 Computing
Representing characters
Sphero CPD 9.30 – 11am Introduction to Sphero 11 – 11.15am
Representing Images 2.6 – Data Representation.
Fundamentals of Data Representation
Colors Computers build colors from Red, Green, and Blue; not Red, Blue, and Yellow. RGB = Red Green Blue Creating Colors Red + Blue = Purple No Red, No.
Unit 1: Days
Error Detection Learning Objectives:
Presentation transcript:

COMPUTERSCIENCE High School Teacher's Workshop The University of Virginia July 9, 2008 And kinesthetic computer science activities Lynn Lambert Christopher Newport University Newport News, Va 23606

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Popularizing science topics Not interesting:  Physics

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Popularizing science topics Not interesting:  Physics Interesting:  Explosions

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Popularizing science topics

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Popularising science topics Not interesting:  Computer Science

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Popularising science topics Not interesting:  Computer Science Interesting:  ???

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Author: Tim Bell (not pictured: Ian Witten and Mike Fellows) Solution:

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Global project New Zealand Sweden United Kingdom Korea Japan China Haiti Even USA (CSTA, Peter Denning, Carnegie- Mellon, SIGCSE, AP Reading, NECC)

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 What is Unplugged How to teach important computer topics without using computers at all!computer topics Have Fun!

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Like? Binary Numbers Image Representation Text Compression Error Detection and Correction Searching Algorithms Sorting Algorithms Sorting Networks Minimal Spanning Trees Routing and Deadlock Finite-state Automata Programming Languages Information Theory

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Magic Trick Make a 5x5 grid with colored squares, some with one color, some the other. Magic

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Even parity (column and row to make each color even) Can correct a bit that was corrupt ISBN: from Wikipedia checks for adjacent swapped digits or a single incorrect digit Parity Checking

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Sorting network

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Have you used Unplugged? How?

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Binary Digits

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Characters and Sound Represented in Binary “ASCII” Modem

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Each pixel is a bit Image Representation (black and white) 1280 * 800 = 1,024,000 pixels/bits

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Each pixel is a bit for first row etc. Image Representation (black and white)

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Image Compression Run Length Encoding 4, 11, 2 4, 9, 2, 1, 1 4, 11, 2 4, 9, 4 5, 7, 5 0, 17 1, 15, 1

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Each pixel is a bit Still 1,024,000 pixels Now, each pixel is Image Representation (Color) 32 bits

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Color Images RGB color for blue Microsoft Office Color

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, /102/0 226/113/0 196/198/0 226/113/0180/90/0 141/105/ /240/255230/206/ /102/38 141/105/ /238/228218/218/200217/187/63

Lempel-Ziv (LZ) Compression (Lyrics by ColdFusion) Ge ou Get out t t heart me Get Out, Get Out, Get Out Ahhh-ohhhh Myingis break My head is tell ing me Ahhh-ohhhh

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 CS Unplugged in High School (by Scott Fletcher) Perfect: Binary Numbers, Programming Languages ("first day exercise“). Image Representation to introduce computer graphics to the students. Text Compression (used a popular song that the kids would recognize) Used briefly to introduce a topic: Twenty Guesses or the Card Flip Trick Sorting Networks Algorithm, Minimal Spanning Trees, Treasure Hunt could have been more challenging Did not use:  Battleships (pretty involved),  Lightest and Heaviest (too much equipment)  Orange Game (but should have)

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Non CSUnplugged Activities Andy Begel, KLA (Kinesthetic Learning Activities), /07/ aspxhttp://ws.cs.ubc.ca/~kla/  Binary Tree  Recursion  cons, car, cdr AP Reading Toy Night with Robert Duvall Internet, Sorting, Searching AP list, CSTA

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Your Turn Break up into groups Use an activity we're talked about Or, come up with one (or several) of your own Discuss how to teach it, and how to present it to us

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Example mappings Cards  two sides, choice, combinations, permutations Cups, containers, buckets  hidden information, two states, variable, limited contents Stickers, marker pen  commit, label, colour, user input Chalk on pavement/ tape on floor  transitions, paths, target Board game  paths, chance, rules Food  competition, humour, colour, sharing, size String  Connection, communication, length, network

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Your Turn Reporting

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Human-Computer Interaction ≠

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Stop the computer...

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Stop the computer...

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 HCI Works sheets  Affordances for doors  Layout of ovens Dumb interfaces System is machine plus user

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Shannon theory Twenty questions Guess a number

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Shannon theory Guess a letter Guess a sentence Probability and information

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Cryptography Public/Private Key One Way Functions  Send Information

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Peruvian coin toss Fair coin toss over the phone

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 One way function Both have the same telephone book Pick a function  Odd/even length of name  Name begins with H/T

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Audience member selects name

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Give number to presenter

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Presenter guesses: H or T?

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Presenter tries to find name

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Presenter gives up and tosses coin

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Correct? Prove it…

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 CS Unplugged wants your ideas: Designing an activity What are the key elements? e.g. bits, states, compare, relationships What games/puzzles/toys use similar elements? Turn it into a challenge To find (best) solution Compare speed (of groups or methods) Team? Impediments? Evaluate Simplicity, engagement, cost, novelty Refine Show to lots of kids/teachers/profs Publish

Tapestry 2008 Workshop The University of Virginia Lynn Lambert July 9, 2008 Questions?