Tapestry Workshop The University of Virginia July 15, 2009 And - - PowerPoint PPT Presentation

▶
tapestry workshop the university of virginia july 15 2009
SMART_READER_LITE
LIVE PREVIEW

Tapestry Workshop The University of Virginia July 15, 2009 And - - PowerPoint PPT Presentation

Oct 01, 2022 110 likes •598 views

Tapestry Workshop The University of Virginia July 15, 2009 And kinesthetic computer science activities Lynn Lambert Christopher Newport University Newport News, Virginia Author: Tim Bell (not pictured: Ian Witten and Mike Fellows) Tapestry

slide-1
SLIDE 1

Tapestry Workshop The University of Virginia July 15, 2009 And kinesthetic computer science activities Lynn Lambert Christopher Newport University Newport News, Virginia

slide-2
SLIDE 2

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

Author: Tim Bell (not pictured: Ian Witten and Mike Fellows)

slide-3
SLIDE 3

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

Global project

New Zealand Sweden United Kingdom Korea Japan China Haiti Even USA (CSTA, Peter

Denning, Carnegie- Mellon, SIGCSE, AP Reading, NECC)

slide-4
SLIDE 4

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

What is Unplugged

How to teach important computer topics without using computers at all! Have Fun! www.csunplugged.org

slide-5
SLIDE 5

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

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

slide-6
SLIDE 6

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

Magic Trick

Make a 5x5 grid with colored squares, some with one color, some the other.

Magic

slide-7
SLIDE 7

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

Even parity Can detect a bit that was corrupt ISBN detects adjacent swapped digits or a single incorrect digit X10 = (1x1 + 2x2 + 3x3 + 4x4 + 5x5 + 6x6 + 7x7 + 8x8 + 9x9) mod 11 Harry Potter and The Deathly Hallows: 0-545-01022-5 (0*1 + 5*2 + 4*3 + 5*4 + 0*5 + 1*6 + 0*7 + 2*8 + 2*9 ) (0 + 10 + 12 + 20 + 0 + 6 + 0 + 16 + 18) = 82 82 mod 11 = 5

Parity Checking

slide-8
SLIDE 8

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

Sorting network

< >

Right

Left

slide-9
SLIDE 9

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

Have you used Unplugged? How?

slide-10
SLIDE 10

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

Binary Digits

slide-11
SLIDE 11

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

Characters in Binary

00101 01100 01000 01100 01111 H E L L O

1 2 3 4

A B C D

5

E E

6 7 8 9

F G H I

10

E J

11 12 13 14

L M N

15

E O

16 17 18 19

P Q R S

20

E T

21 22 23 24

U V W X

25

E Y K

26

E Z

slide-12
SLIDE 12

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

Characters and Sound Represented in Binary

“ASCII” Modem

slide-13
SLIDE 13

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

Each pixel is a bit

Image Representation (black and white)

1440 * 900 = 1,296,000 pixels/bits

slide-14
SLIDE 14

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

Each pixel is a bit 00001111111111100 for first row etc.

Image Representation (black and white)

slide-15
SLIDE 15

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

Image Compression Run Length Encoding

4, 11, 2 4, 9, 2, 1, 1 4, 9, 2, 1, 1 4, 11, 2 4, 9, 4 4, 9, 4 5, 7, 5 0, 17 1, 15, 1

slide-16
SLIDE 16

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

slide-17
SLIDE 17

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

slide-18
SLIDE 18

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

Each pixel is a bit Still 1,296,000 pixels Now, each pixel is

Image Representation (Color)

32 bits

slide-19
SLIDE 19

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

Color Images

RGB color

0 0 255 for blue 00000000 00000000 11111111

Microsoft Office Color

slide-20
SLIDE 20

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

slide-21
SLIDE 21

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

slide-22
SLIDE 22

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

slide-23
SLIDE 23

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

204/102/0 204/102/0 204/102/0 226/113/0 226/113/0 196/198/0 226/113/0 180/90/0 141/105/101 240/240/255 230/206/158 179/102/38 141/105/101 232/238/228 218/218/200 217/187/63

slide-24
SLIDE 24

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

“Yesterday” by The Beatles, L-Z Compression

Yesterday love was such an easy game to play Now I need a place to hide away Oh, I believe in yesterday. Why she had to go I don’t know, she wouldn’t say. I said something wrong Now I long for yesterday.

slide-25
SLIDE 25

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

Routing and Deadlock

Orange Game

slide-26
SLIDE 26

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

TREASURE HUNT: Finite State Automata (FSA)

FSA are theoretical state models Unplugged uses a treasure hunt. Others:

letters to accept particular words a metro map for getting to a particular location

slide-27
SLIDE 27

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

TREASURE HUNT

Goal: Find Treasure Island Start: from Pirates' Island Friendly pirate ships sail along fixed routes between islands offering rides to travelers. Each island has two departing ships, A and B. Determine all possible sequences of ships that a traveler can take to arrive at Treasure Island. Use your map to record all the ship routes.

slide-28
SLIDE 28

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

TREASURE HUNT Pirate’s Island

A B

slide-29
SLIDE 29

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

TREASURE HUNT Dead Man’s Island

A B

slide-30
SLIDE 30

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

TREASURE HUNT Shipwreck Bay

A B

slide-31
SLIDE 31

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

TREASURE HUNT Mutineers’ Island

A B

slide-32
SLIDE 32

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

TREASURE HUNT: Smugglers’ Cove

A B

slide-33
SLIDE 33

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

TREASURE HUNT: Musket Hill

A B

slide-34
SLIDE 34

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

TREASURE HUNT: Treasure Island

PLAY AGAIN

slide-35
SLIDE 35

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

TREASURE HUNT

What is the quickest route? Finite State Automata

slide-36
SLIDE 36

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

Non CSUnplugged Activities

Andy Begel, Steve Wolfman, Dan Garcia KLA (Kinesthetic Learning Activities), http://ws.cs.ubc.ca/~kla/,

Binary Tree Recursion cons, car, cdr

AP Reading Toy Night with Robert Duvall AP list, CSTA

slide-37
SLIDE 37

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

Your Turn

Break up into groups, and answer at least one of the following:

  • 1. What unplugged or unplugged-like activities

have you done in your classroom? What worked/didn’t work?

  • 2. Based on the ideas that we’ve talked about,

how would you expand/modify these in your classroom?

  • 3. What topics do you think would benefit from a

kinesthetic learning activity?

slide-38
SLIDE 38

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

Your Turn Reporting

slide-39
SLIDE 39

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

Non CSUnplugged Activities

Andy Begel, Steve Wolfman, Dan Garcia KLA (Kinesthetic Learning Activities), http://ws.cs.ubc.ca/~kla/,

Binary Tree Recursion cons, car, cdr

AP Reading Toy Night with Robert Duvall AP list, CSTA Internet, Sorting, Searching

slide-40
SLIDE 40

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

CSTA Membership

The Southeastern Virginia Chapter of Computer Science Teachers Association Web Page for SEV-CSTA:

http://www.cs.nsu.edu/csta/ Web Page for CSTA: http://www.csta.acm.org/ Membership to both is FREE!!!

slide-41
SLIDE 41

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

Peruvian coin toss

Fair coin toss over the phone

slide-42
SLIDE 42

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

One way function

Both have the same telephone book Pick a function

Odd/even length of name Name begins with H/ T

slide-43
SLIDE 43

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

Select name

slide-44
SLIDE 44

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

Record phone number

332-6308

slide-45
SLIDE 45

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

Presenter guesses: H

  • r T?

332-6308

slide-46
SLIDE 46

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

Presenter tries to find name

332-6308

slide-47
SLIDE 47

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

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

slide-48
SLIDE 48

Tapestry 2009 Workshop The University of Virginia Lynn Lambert July 15, 2009

Questions?