How do you think a digital device stores information?
Accept and record all answers to revisit at the end of the lesson.
See teaching this in action
Note from the authors
We’ve noticed that when we teach the binary number system to students ages 5 - 7 we are focusing on number knowledge and number identification rather than how the binary number system works. We also support students to learn to count by one to one matching, because they are counting the dots. Students are motivated to learn because they are learning how computers store information. Students may ask you questions and be excited to explore the concepts outlined in this lesson further. We’ve added a lot of information into this lesson, however, it is not our intention that you will teach and cover all the concepts, but that you have at your fingertips the information you need when your students express an interest in learning more.
Notes on resources
There is also an online interactive version of the binary cards available (4 card version, corresponding to this activity, or 5 card version if students are comfortable with numbers up to 31), from the Computer Science Field Guide. However, we strongly recommend using physical cards to start with.
Did you know that right in the inside of any computer there are billions (that’s a really really big number) of little tiny things that can be turned on or off, like a light switch, and that when you have lots of these things together they can display a number or a letter or a movie or make up your favourite game on your device?
So let’s look at how they work.
Now we need to pretend that we are so incredibly small that we are now inside a computer and we are making the computer show a number.
Are you ready?
First of all here’s a card that is the tiny thing that can be turned on or off.
The technical word for that is a “bit”.
Hold the 4 cards (1, 2, 4, and 8 dots), but don't let students see the dots.
Ask for 4 students to volunteer to be “bits”, and have them stand in a line in front of the class.
Hand out the 1-dot card to the person on the right.
Explain that they are one "bit" (binary digit), and can be on or off, black or white, 0 or 1 dots.
The only rule is that their card is either completely visible, or not visible (i.e. flipped over).
Hand out the second card so that the first card is on the far right.
Point out that this card has either 2 dots, or none.
Ask the class what the number of dots on the next card will be.
Get them to explain why they think that.
Students will usually suggest it should be three.
If they suggest 4, they may have done the activity before (or have seen the cards you are holding!), or they may have very good pattern recognition skills!
If they suggest the wrong number, don't correct them, but continue without comment, so that they can construct the rule for themselves.
Silently give out the 4-dot card, and let them try to see the pattern.
This will be dependent on their level of number knowledge.
Mention that each number is doubling (or that if you had two of a card, that would give you the card beside it), and move onto the next step.
Usually some students will point out that you've missed out the three, but simply indicate that you haven't made a mistake, something is happening to the numbers and we will be able to make three by using the cards.
Ask what the next card is, and why.
At this point it is common for students to guess that it is 6 (since it follows the numbers 2 and 4).
However, if you let them think about it a little more, some will usually come up with 8, and those students should be able to convince the others that they are correct.
There are several ways a student could explain this e.g. that each card is double the previous one, or that if you take two of a card, you get the next one. Some may recite the pattern 1+1=2, 2+2=4, 4+4=8.
If your class are learning to count then show all the cards and count how many dots are on each one.
Look for the patterns of doubling and count the dots to prove this.
Show the 4th card and hand it out:
Background information for those who are curious!
If we kept handing out cards then once we got to 8 cards we would have 256 dots in total if we added up all the cards.
This is 8 bits, which is commonly referred to as a byte.
It may be distracting to bring this up at this point, but some students may already be familiar with the idea that 8 bits is a byte, and make that observation.
However, in the meantime, we'll work with a 4-bit representation, which isn't as useful as a whole byte, but a good size for teaching younger students.
4 bits is actually called a nibble (sometimes spelt nybble)!
This is a fun extra piece of information for interested students.
A common mistake is to hand out the cards from left to right, but it's convention in number representation that the least significant value is on the right, and this is an important idea for students to take away from this activity.
Tell the students that the rule is that a card either has the dots showing, or hiding.
If we can turn cards on (showing) and off (hiding) by showing the front and back of the card, how would we show 3 dots?
Begin by asking: how many dots are on the left-most card?
Count together that there are 8 dots.
Let’s look at the number line.
Is 8 bigger than 3?
Let’s hide it because it’s too big.
Now let’s look at the next card, how many dots can we see? Let’s count them.
There are 4, is 4 bigger than 3?
Yes, so we need to hide the card.
If we didn’t hide the 4 card what would happen?
(There would be too many dots).
How many dots are on the next card? Let’s count them.
There are 2 dots.
Let’s look at the number 3, (show it with materials and show that 2 fits into 3, with how many left over?)
We need one more dot to make the number 3.
So we will leave that card visible.
Without being given any rules other than each card being visible or not, students will usually come up with the following representation.
At a junior level we are focusing on using this counting system to represent numbers and making the association that with these “bits” you can make any number.
We’re not going to focus on further knowledge about number base systems.
The information below is extra information for you.
For teachers: Base 10 (our normal counting system) has 10 digits, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9.
When we count in base 10, we count from 0 to 9 and then run out of digits.
So we need to add another column; we put a 1 in that column and start counting again from 0.
This makes the number 10, we then repeat that process until the tens column is 9 and the ones column is 9 (making 99); from there we then add another column.
Hence we have the familiar place value system that can be shown something like this:
100,000s | 10,000s | 1,000s | 100s |10s | 1
Note: Use the appropriate place value example based on what you have already taught in your class; this is an extended example.
Base 2 (binary) follows the same logic, except it moves a lot quicker to the “next” place value, because there are only two digits, 0 and 1.
The binary place values look like this:
32 | 16 | 8 | 4 | 2 | 1 |
Sometimes students confuse the order of digits in a binary representation.
To support students to understand the correct ordering of binary digits, ask the question: If I was going to give you $435.00 which number are you most interested in? Is it the 4 or the 5? Why is that?
It’s the same for binary code, the lowest value (least significant digit) is on the far right, whereas the most significant digit is on the far left.
Base 16 is also commonly used on computers - it's called hexadecimal, and has 16 digits.
While this is far beyond the scope of this lesson, we wanted to point out that one hexadecimal digit is the equivalent of 4 binary digits (bits), because both can represent 16 different values (from 0 to 15).
So this exercise that the students are doing provides a great basis for later understanding another common representation that they will encounter on digital devices.
Now ask "How would you make the number 6?" (Again, start by asking if they want the 8 card, and so on from left to right).
The process we have been following to make these numbers is an algorithm, which converts our normal counting numbers to a binary representation.
Together let’s think through the steps we followed to do this.
We'll do this by using the earlier example of representing the number 3 again.
a. Start with all the numbers switched to on (all the dots visible).
You could start to introduce abstract representations, like varying the description of the cards (visible/hidden; dots/no-dots; white/black if the backing is black; yes/no; or on/off)
b. Does 8 fit into 3? No - so turn it off
c. Does 4 fit into 3? No - so turn it off
d. Does 2 fit into 3? Yes - so keep it on. How many are left over? (1)
e. Does 1 fit into 1? Yes - so keep it on. How many are left over? (none)
Applying what we have just learnt
Group students into pairs
Give each pair a set of the smaller binary cards
Have them practise the algorithm for numbers below 10.
Explain to students that we're working with just two digits, so they are called binary digits. (You could explore the meaning of the "bi" prefix with words like bicycle, biennial, bilingual and bicultural.)
Binary digits are so common that we have a short name for them: write "binary digit" on a piece of paper, then rip off the "bi" at the start, and the "t" at the end, put it together and ask what the combined word ("bit") spells.
This is the short name for a binary digit, which is why we've been referring to the cards as bits; the 4 cards that they have are actually 4 bits.
Now let’s count from the smallest number that we can make, up to the highest number
a. What is the smallest number? (they may suggest 1, then realise that it’s actually 0).
Get the number 0 displayed on the cards (i.e. no dots showing)
Now count up 1, 2, 3, 4 …. (each pair should work out these numbers between them)
Once they start to get into a routine, ask: how often are we seeing the 1-dot card? (every second time, every odd number)
a. What other patterns are we seeing? (the 2-dot card flips on every second count, the 4-dot on every 4th and so on; the 8 dot card doesn't do much; this may be challenging for some students to recognise, and the main goal is that they are aware that the 1-dot card flips every time, and that every second number is an odd number).
Continue until all the cards are switched to “on” and have counted to 15.
What happens next? (We have to add a new card.)
How many dots on it? (16) What do we have to do to the other 4 cards when we get to 16? (we have to turn them all off)
Extension ideas ...
a. So when I have two bits I can make a maximum of? (3)
b. I add another bit and that has how many dots on it? (4)
c. I turn off the first two bits to make 4 right?
d. Now let’s turn on all three bits, so now we have how many? (7)
e. I add another bit and that has how many dots on it? (8)
f. Repeat until a pattern is recognised that the number on the next card is one more than the total number of dots on all the cards to the right (e.g. there are 7 dots on the 4, 2 and 1 cards, so the next card to the left is 8).
This makes it easy to work out the number if all the bits are switched on - double the left-hand card, and subtract 1.
g. How many different numbers can I make with two bits? (4; often students will say 3 because they haven’t counted 0).
h. Let’s add the next bit; how many different numbers can we make now? (8, again 7 will often be given as an answer first).
i. Repeat until a pattern is recognised that each time we add another bit we can now represent twice as many numbers.
A concept that students may struggle with here is that the number of values is one more than the maximum value (e.g. from 0 to 7, there are 8 different numbers).
The same observation occurs with the number of digits in conventional decimal numbers; the largest digit is 9, but there are 10 possible digits (counting 0).
This is sometimes called the fencepost problem (the number of fence posts is one more than the number of gaps between them), and it comes up a lot in computing and in maths.
Would this activity work if we used white and cream cards? Why? Why not?
In principle you could use these, but it wouldn’t be a good idea.
We are looking for the answer that they are not contrasting colours, therefore it would be difficult to see if it is actually on or off.
Computers are easier to build and break less often when we just use two contrasting values.
What are some other ways we could physically show that each of the bits are on or off?
Ideas could include holding the cards up high, or down low; simply holding up a hand; sitting down or standing up; or using a different representation such as lights that are on or off.
What else could we use to represent two opposites, like on and off, in writing?
Perhaps a cross or tick; happy or sad face; or any other pair of symbols.
Seeing the Computational Thinking connections
Throughout the lessons there are links to computational thinking. Below we've noted some general links that apply to this content.
Teaching computational thinking through CSUnplugged activities supports students to learn how to describe a problem, identify what are the important details they need to solve this problem, and break it down into small, logical steps so that they can then create a process which solves the problem, and then evaluate this process. These skills are transferable to any other curriculum area, but are particularly relevant to developing digital systems and solving problems using the capabilities of computers.
These Computational Thinking concepts are all connected to each other and support each other, but it’s important to note that not all aspects of Computational Thinking happen in every unit or lesson. We’ve highlighted the important connections for you to observe your students in action. For more background information on what our definition of Computational Thinking is see our notes about computational thinking.
We used an algorithm in this lesson to convert a decimal number to a binary one.
This is an algorithm because it is a step-by-step process that will always give the right solution for any input you give it as long as the process is followed exactly.
Here’s an algorithm for working out which dot cards should be showing, written in text:
Find out the number of dots that is to be displayed.
(We'll refer to this as the "number of dots remaining", which initially is the total number to be displayed.)
For each card, from the left to the right (i.e. 8, 4, 2 then 1):
If the number of dots on the card is more than the number of dots remaining:
Hide the card
Show the card
Subtract the number of dots on the card from the number of dots remaining
Examples of what you could look for:
Which students are methodical when they convert between decimal and binary?
Which ones start with the leftmost card and move one card at a time to the right, rather than choosing cards at random and flipping them on and off until they get the right number?
Abstraction and abstract thinking is generally difficult for young students so only a small amount of this section is likely to be applicable for them.
We have included the information here however because it is useful background knowledge for teaching this topic.
Abstraction helps us simplify things because we can ignore the details we don’t currently need to know.
Binary number representation is an abstraction that hides the complexity of the electronics and hardware inside a computer that store data.
In this case the details we can ignore include: Computers use physical devices like electronic circuits and voltages in circuits to store and move data, and there are many complex physics and mathematical theories that make this work.
We don’t need to understand how these circuits work because we can use the abstraction of binary, as numbers made up of bits (0s and 1s), to understand data and work out problems, without having to think about what is happening ‘underneath the hood’ of the computer.
Another use of abstraction is considering what is needed to represent any given digit in binary. The answer is all you need are two different things.
These things can be anything! Two different colours, two animals, two symbols etc.
As long as there are two of them, and they are different, you can use these to represent any number, using binary, the same way a computer uses electricity to represent data.
Examples of what you could look for:
Who are the students that can demonstrate converting and representing binary numbers using things other than “1’s and 0’s”, “black and white”, and “off and on” (for example using :] and :[, or using people standing up or sitting down).
If you are able to interchange terms like "black" and "white" with 0 and 1 without students being concerned about the difference, they are exercising abstraction.
An example of decomposition is breaking the conversion of the number to binary into one bit at a time.
The questions "Should this be 1 or 0" for each of the dot cards is decomposing the problem to a series of questions.
Examples of what you could look for:
Which students recognise that it is important to start with the leftmost card and only consider one bit at a time?
Which students focus on each individual bit at a time, rather than being overwhelmed by trying to work them all out in one go?
Generalising and patterns
Recognising patterns in the way the binary number system works helps give us a deeper understanding of the concepts involved, and assists us in generalising these concepts and patterns so that we can apply them to other problems.
Generalising these patterns may be more difficult for junior students, but recognising the patterns is a good exercise.
At a simple level, we started with the numbers 1, 2, and 4, and students generalised that to doubling values.
In these exercises we converted to 4-bit numbers, but students (who are able to count high enough) may be able to generalise that to more 8-bit numbers, or larger.
The algorithm for converting a decimal number to a binary one follows a pattern that can be generalised to solve the problem of giving change when someone pays by cash.
For binary numbers you start with the largest bit and turn it on if it is needed or off if it is not, just like when you’re giving change you start with the largest denomination and then always take a coin (or note) whenever you need it.
Jargon note: This is called a greedy algorithm.
Ask students what is special about the decimal to binary conversion, in contrast with the general change giving algorithm, and have them observe that in the general case, you may need to give more than one coin of the same denomination, whereas in the binary conversion there is always one (or none) of each.
When counting upwards in binary, there is a pattern for how often particular cards flip.
The first bit (with 1 dot) turns over every time we count up by one, the 2nd (with 2 dots) turns for every second number, the 3rd (with 4 dots) turns for every fourth… Is there a pattern like this when we count in decimal numbers?
If you have 4 of the cards and all are visible, you will have the number 15, which is 1 less than the value of the next card, 16. Is this pattern always true?
The amount of numbers you can represent with a certain number of bits is the same as the value of the next bit that can be added.
For example, using 4 cards (1, 2, 4, 8) you can represent 16 different numbers (0-15), and the next card in the sequence is the number 16.
Each time we add the next card we also double the amount of different numbers we can represent.
Working with these patterns is valuable for working out the relationship between the number of bits being used and the power of what they can represent.
Examples of what you could look for:
Which students recognised quickly that each card was doubling the number of dots?
Which students easily understand the patterns of cards flipping when counting with binary numbers?
Logical thinking means using rules you already know and using logic to deduce more rules and information from these.
Once we know what number each of the binary cards represents then we can use this knowledge to figure out how to represent other numbers with the cards.
If you memorise how to represent the numbers we can make with 4 cards, does that mean you understand how to represent any number with any number of bits?
It doesn’t, but you can understand how to do that if you understand the logic behind how these numbers with the 4 cards are made.
A good example of logical thinking in binary numbers is the reasoning for why each bit "has to" have a particular value (e.g. it has to be on, or it has to be off) to represent a given number.
This in turn leads to an argument that there is only one representation for each number.
Examples of what you could look for:
Do students explicitly explain that the first bit needs to be a one because it is the only odd number and therefore is needed so that we are able to make any, and all, odd numbers? Without it we could only make even numbers.
Are students able to explain that each card "has to" be up the way it is for a given number e.g. the 8-dot card is needed for the number 9 because without it you only have 7 dots remaining (not enough); but it's not needed for the number 6 because it would give too many dots?
An example of evaluation is working out how many different values can be represented by a given number of bits (e.g. 4 bits can represent 16 different values), and vice versa (to represent 1000 different values, you need at least 10 bits).
Examples of what you could look for:
Can a student work out the range possible with 2 bits? (4)
3 bits? (8)
4 bits? (16)
If we add one more bit to a representation, how much does that increase the range? (it doubles it)
This definition is not available in English, sorry!