Activity 1: How many values?
How many different ways can we arrange four bits in one nibble?
Should be 0000 through to 1111
Activity 2: Representing small numbers in binary
Use the place value tables below to write the following numbers in binary.
9
=
1001
14
=
1110
Without place value tables:
11
= 1011
7
= 111
5
= 101
8
= 1000
6
= 0110
12
= 1100
What about this one?
23
= 10111
Activity 3: Representing larger numbers in binary
128
64
32
128
0
47
100 =
128
0
16
64
0
64
1
8
32
1
32
1
4
16
0
16
0
2
8
1
1
4
1
8
0
2
1
4
1
1
1
2
0
Denary  Binary
00101111
1
0
01100100
Denary  Binary
135
=
10000111
131
=
10000011
73
=
01001001
87
=
01010111
245
=
11110101
229
=
11100101
What are the largest and smallest numbers you can represent in a byte?
Zero and 255
Activity 4: Adding binary numbers
+
1
0
1
0
0
1
1
1
0
0
0
1
1
1
0
0
0
0
0
1
1
1
0
1
(169)
(42)
+
0
0
1
1
0
0
0
1
0
1
1
1
1
1
0
0
0
1
1
0
0
1
1
0
(91)
(57)
1
0
0
1
0
0
0
1
0
1
1
0
1
0
1
0
0
1
1
1
0
0
1
1
+
1
Activity 5 Binary Logic
1
AND 0
0
1
0
0
0
1
0
1
1
1
1
0
0
0
0
0
1
1
1
0
1
0
1
0
1
1
0
1
0
1
1
1
1
1
1
0
1
0
0
0
1
1
1
0
1
1
1
AND 1
1
1
0
0
0
0
0
0
1
0
1
0
0
1
1
1
1
1
1
0
1
0
1
1
1
1
0
1
0
0
0
0
1
1
1
0
1
1
1
1
1
1
1
0
1
1
1
AND 1
1
1
0
0
1
1
1
1
0
0
1
1
1
1
0
0
1
1
1
1
0
0
1
1
1
1
0
1
1
1
1
1
0
1
1
1
1
1
0
1
1
1
1
1
0
1
OR
OR
OR
Nightclub Doorman Checks Activity 6
1. Write some rules that the customers must have when they come in
a. Rule 1 No Trainers
b. Rule 2 No Denim
c. Rule 3 Must have proof of age
2. There are two ways in which customers could still be allowed into the nightclub even if they
didn’t follow the rules. What are they?
a. Exception 1 Monday
b. Exception 2 VIP Pass
(No trainers AND No Denim AND Proof of age) OR Monday OR VIP
Activity 7 Logic Charts
Draw logic charts for the following logic statements. You will need to use a maximum of three logic
gates (OR, AND, NOT) for each question.
1. P = NOT A
6. P = NOT (A OR B) AND C
2. P = A AND B
7. P = ((NOT A) OR B) AND C
3. P = A OR B
8. P = NOT((NOT A) AND B)
4. P = NOT (A AND B)
9. P = (A OR B) AND (C OR D)
5. P = (A AND B) OR C
10. P = NOT((A OR B) AND C)
11. P = A OR B OR C OR D
12. P = (A AND B) AND NOT C