Computer Science Unplugged
Marching Orders—Programming Languages
Computers need precise directions to complete a task. Class members experience what it is like to program a computer with an activity that asks one pupil to describe an image while classmates follow the directions to duplicate the picture.
Computer Science Unplugged
Treasure Hunt—Finite-State Automata
Introduce your class to the concept of finite-state automata with an activity that asks individuals to try to map their way to Treasure Island by taking different routes though an island chain. Each island has two ship sailing to...
Computer Science Unplugged
Divide and Conquer—Santa’s Dirty Socks
The story "Santa's Dirty Socks" provides learners an example of a search algorithm that uses a divide and conquer system similar to a binary search algorithm. The included questions expand upon the concepts that follow the story.
Computer Science Unplugged
The Orange Game–Routing and Deadlock in Networks
How is data able to move in a congested network? Groups simulate moving data around a congested network by passing fruit around a circle, following specific rules, until everyone ends up with their own fruit. Extension activities include...
Computer Science Unplugged
Card Flip Magic—Error Detection and Correction
I can find the error in an array of cards? After watching a demonstration class members search for the error is the provided cards. The resource provides a real-life example of using ISBN numbers in error detection and using check sums.
Computer Science Unplugged
Colour by Numbers–Image Representation
How do computers store and send images? Here's an activity that explains one way a computer can compress image information. Pupils decode run-length coding to produce a black and white image. Pairs then work together to code and decode...
Computer Science Unplugged
Tablets of Stone—Network Communication Protocols
Show your learners that the game of Telephone isn't the only way messages get mixed up. Pairs transform into the sender and receiver of a message sent in packets. At least one pupil is the messenger who either delivers, delays, or fails...
Computer Science Unplugged
Codes in a Song—Modems
Let's listen to some codes. To understand how a modem sends binary numbers over a phone line, class member listen to the codes included in the provided mp3 files, translates the tones to binary numbers and then convert the binary numbers...
Computer Science Unplugged
Tourist Town—Dominating Sets
As an introduction to using a network to determine the fewest number of nodes that meet a given condition, small groups work together to determine the fewest number of ice cream vans, and their locations, to be able to serve the people...
Computer Science Unplugged
The Poor Cartographer—Graph Coloring
Color the town red. Demonstrate the concept of graph theory with a task that involves determining the least number of colors needed to color a map so that neighboring countries are not represented by the same color. Pupils make...
Computer Science Unplugged
The Intelligent Piece of Paper
How smart is that piece of paper? The activity introduces the idea of computer programming as a list of instructions written by computer programmers. Two individuals play a game of Tic-Tac-Toe in which one follows the commands written on...
Computer Science Unplugged
Conversations with Computers—The Turing Test
Will the real computer please stand up? The premise of this activity is for the class to ask questions to a human and to a computer and to determine which is which. The class asks a given set of questions, and the person playing the role...
Computer Science Unplugged
Kid Krypto–Public-Key Encryption
Class members have an opportunity to experience how to use a public key to encrypt information and a private key to decrypt it. Groups create their own public key and encrypt information then develop private keys to decrypt this...
Computer Science Unplugged
Ice Roads–Steiner Trees
As an introduction to Steiner Trees, class members are challenged to find the shortest paths to connect multiple points. The teacher introduces the problem by showing how to connect three points. Groups then go outside and construct a...
Computer Science Unplugged
The Chocolate Factory–Human Interface Design
What is this? What is it for? How does it work? Challenge the class to think about to how to design a new chocolate factory for the Oompa-Loompas to make it easy to use. The activity is the first of a three-part series on computer-human...
Computer Science Unplugged
The Peruvian Coin Flip–Cryptographic Protocols
A digital flip. Introduce your classes to cryptographic protocols using and, or, and not gates. Groups create a complete circuit to convert a binary number into another one. This type of one-way function allows pupils to verify the...
Computer Science Unplugged
The Muddy City—Minimal Spanning Trees
What is the most efficient way to ensure everyone is connected? Individual pupils determine the least expensive route to pave roads in a fictional city. In doing so, they learn to find the minimal spanning tree for the situation. They...
Computer Science Unplugged
Twenty Guesses—Information Theory
How do we determine how much information to include and what can be left out? By playing a game of 20 questions, the class generates the best strategies for finding a number. They then move on to guessing the next letter in a short...
Computer Science Unplugged
Battleships—Searching Algorithms
How does a computer perform a search in order to find data? The lesson begins with a demonstration on finding one number out of 15. Pairs then play three games of Battleship by using different search techniques. The lesson plan finishes...
Computer Science Unplugged
Computing: Databases Unplugged
How do databases store and retrieve information? The activities in the resource provide fundamental concepts of databases by introducing an approach that teaches the basics without using computers. The pupils act as the actual data that...
Computer Science Unplugged
Beat the Clock—Sorting Networks
Can multiple computers sort a list faster than one? Using a network drawn with chalk outside, groups move through the decision network to sort numbers. A series of extension questions come with the lesson and can be used in the same...
Computer Science Unplugged
Lightest and Heaviest—Sorting Algorithms
How do computers sort data lists? Using eight unknown weights and a balance scale, groups determine the order of the weights from lightest to heaviest. A second worksheet provides the groups with other methods to order the weights. The...
Computer Science Unplugged
Count the Dots – Binary Numbers
Did you know you can send a message using only zeroes and ones? This interactive resource presents an introduction to binary numbers. Through code cards, pupils learn to convert binary numbers to decimal numbers.
Computer Science Unplugged
Harold the Robot — Thinking About Programming Languages
Get young programmers thinking about programming languages with an activity that asks class members to craft directions for one person (teacher, another adult, or a class mate) acting as a robot. Participants direct the robot to...