SACRED HEART COLLEGE
LESSON PLAN
SYLLABUS SECTION
Section 1: Theory of Computer CLASS Form 1
Science
TOPIC 1.1 Data representation DATE 27/01/2021
SUB TOPIC 1.1.1 Binary systems TOPIC Measurement of
computer memory
Lesson objectives:
Students should be able to:
show understanding of the concept of a byte and how the byte is used to
measure memory size.
use binary in computer registers for a given application (such as in robotics, digital
instruments and counting systems).
Introduction:
A binary digit is commonly referred to as a BIT;
8 bits are usually referred to as a BYTE.
The byte is the smallest unit of memory in a computer.
Some computers use larger bytes but they are always multiples of 8 (e.g. 16-bit
systems and 32-bit systems).
One byte of memory wouldn’t allow you to store very much information; therefore, the
need to discuss memory size.
Body of Lesson
Measurement of the size of computer memory
adapted from the IGCS Computer Science Textbook pg14
SACRED HEART COLLEGE
Uses of binary
Example: Use of Binary
In the scenario below you will see that a digital display has 7 segments, the
microprocessor can alter which segments are on or off in-order to produce a desired
number. In the image below you can see that each segment has been labelled from
1 - 7 and that segments 1, 2 and 3 are lit up to make the number 7!
The Register
The register that makes this happen can be seen below.
The top row is labelled from 1 - 7, each number corresponds to the display
segment.
The second row contains the binary numbers (Register) that control this
device. For this to work correctly a number 1 is placed in position under any
segment that needs to be lit up whereas a 0 is placed under any segment that
remains unlit.
Activity
1. What would be would be the contents of the register, if the following numbers
are displayed?
(a) 5
(b) 3
SACRED HEART COLLEGE
(c) 1
2. What number will be displayed by the image if the following binary numbers
are held by the registers?
contained the following values
1 2 3 4 5 6 7
1 1 1 1 0 0 1
(a)
1 2 3 4 5 6 7
0 1 1 0 0 0 0
(b)
1 2 3 4 5 6 7
(c)
Conclusion