Computing Section 1 LV
Computing Section 1 LV
SECTION
1 COMPUTER
SYSTEMS A – DATA
REPRESENTATION
AND COMPUTER
STRUCTURE
1
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
INTRODUCTION
Inside today’s computers, all information is encoded (represented) in the form of 0s
and 1s data. These digits are called bits, which are short for binary digits. Bits are the
basic building blocks of computers (just like letters are the building blocks for words),
telling the computers what to do and how to represent data. Patterns of bits combine
to represent text, numbers, images and sound. This topic is fundamental to computer
science because, at the end of the day, computers are machines that manipulate digital
signals, which are either on or off, either 1 or 0. So, regardless of whether you are
programming, doing machine learning, just using a computer or engaging in more
advanced topics like robotics, you are also ultimately manipulating bits.
Key Ideas
• A bit is the smallest unit of data.
• 8 bits make a byte (8 bits = 1 byte).
• Different types of information (numbers, text, images, etc.) are encoded into binary
in different ways. This means the raw data/binary representation needs to be decoded
according to its type to make sense as useful information.
• Boolean logic is a type of algebra in which results are calculated as either True or False.
• Buses are used to connect these components, allowing data and signals to pass between
them.
• The buses that form the system bus play a key role in the machine cycle, because it is
they who ferry around the necessary addresses, data and control signals.
2
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
3
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
We will learn how the following types of data are represented in binary (as bits): Integers
(numbers), Text, Images, Audio, Videos, Files, and Data for Transmission. We will
discuss each in turn below.
1. Integer Representation
At the basic level, you were taught how to convert an integer (whole number)
from one base to another.
When encoding numbers in binary, we are converting from base-10 (decimal) to
base-2 (binary). In binary/base-2, the place values for each digit go up in 2s, going
from right to left.
For example, the first five place values are:
a. Decimal to Binary
The process of converting decimal numbers to binary (base-2) notation is shown
through two examples. Figure 1.4 converts 13 to binary and Figure 1.5 converts 25
to binary.
4
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
13 ÷ 2 = 6 (Remainder 1)
6 ÷ 2 = 3 (Remainder 0)
3 ÷ 2 = 1 (Remainder 1)
1 ÷ 2 = 0 (Remainder 1)
(Decimal)
1101
25 ÷ 2 = 12 (Remainder 1)
12 ÷ 2 = 6 (Remainder 0)
6 ÷ 2 = 3 (Remainder 0)
3 ÷ 2 = 1 (Remainder 1)
1 ÷ 2 = 0 (Remainder 1)
(Decimal) (Binary)
Activity 1.1
1. Count the number of chairs in your class and convert this number to binary.
2. Convert your age to binary.
Leading zeros can be added to make a byte (8 bits), as shown in Table 1.1
5
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
0 00000000
1 00000001
2 00000010
3 00000011
4 00000100
5 00000101
6 00000110
7 00000111
8 00001000
9 00001001
b. Binary to Decimal
Now that we are done with the conversion from decimal to binary, let us look at
how to convert from binary to decimal. To convert from binary to decimal, you
can use the positional notation system. Each digit in a binary number represents
a power of 2, starting from the rightmost digit , then , , and so on.
Note: When counting the binary numbers, you start counting from 0, from the
right to the left.
Let us follow the steps below to convert binary numbers to decimals.
Firstly, assign powers of 2 to each digit, starting from the rightmost digit. For
example, if you have the binary number 10110, the rightmost digit is 0, followed
by 1, then 1, in that order.
6
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
= 16 + 0 + 4 + 2 + 0
= 22
101102 = 2210
(Binary) (Decimal
)
Fig 1.6 Converting 10110 to decimal
= 64 + 32 + 0 + 8 + 0 + 2 + 0
= 106
11010102 = 10610
(Binary) (Decimal)
Activity 1.2
7
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
2. Text Representation
In the numeric representation we learnt earlier, we saw that numbers can be
represented as binary numbers the computer understands. In the same way, text
characters also have their own binary representation. These are done using ASCII
(American Standard Code for Information Interchange) and Unicode.
Standard ASCII uses a 7-bit code to represent 128 characters. These include 95
printable characters, like letters (A-Z, a-z), digits (0-9), and symbols, along with 33
non-printable characters for things like formatting and control (example carriage
return, line feed).
The extended ASCII character set utilises an 8-bit code to represent a wider range
of characters. With 8 bits, extended ASCII can accommodate an additional 128
characters and symbols. Extended ASCII is assumed when ASCII is mentioned
for the remainder of these notes.
ASCII is a standard that allows computers to understand and communicate with
each other. In ASCII, each character (letter, number, and symbol) has its unique
code. For example, the letter ‘A’ is represented by the binary number 01000001
(65), while ‘a’ is represented by the binary number 1100001 (97). This system helps
computers know what characters to display on the screen or how to store them
in memory. So, when you type a letter on your keyboard, the computer translates
it into its corresponding ASCII code to understand what you are saying. ASCII
makes it possible for computers to communicate with each other and makes it
easy for us to also interact with them through the text we type. Another encoding
scheme is Unicode, which is a more recent standard, developed to overcome
the limitations of how many characters ASCII can represent by assigning 16
bits per character. Extended ASCII is a subset of Unicode (comprising its first
256 characters). Unicode aims to provide a unique number for every character,
regardless of the platform, programme, or language, creating a global standard for
text representation.
Sometimes, an ASCII table can also show the hexadecimal (base-16) and octal
(base-8) equivalent of the binary ASCII code as shown in the ASCII table extract
in Table 1.2.
48 30 110000 60 0
49 31 110001 61 1
50 32 110010 62 2
51 33 110011 63 3
52 34 110100 64 4
53 35 110101 65 5
8
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
54 36 110110 66 6
55 37 110111 67 7
56 38 111000 70 8
57 39 111001 71 9
58 3A 111010 72 :
59 3B 111011 73 ;
60 3C 111100 74 <
61 3D 111101 75 =
62 3E 111110 76 >
63 3F 111111 77 ?
64 40 1000000 100 @
65 41 1000001 101 A
66 42 1000010 102 B
67 43 1000011 103 C
68 44 1000100 104 D
Table 1.2: Extract from an ASCII table
The ASCII binary codes for letters are shown in Table 1.3.
9
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
Activity 1.3
Encode your first name using the ASCII-Binary character code set and show the
result to your study mate.
Activity 1.4
10
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
3. Image Representation
When images are represented using bits, we use pixels. A pixel is the smallest
unit of a digital image or display. One way of thinking of an image to be displayed
and stored by a computer is as lots of pixels. We then give each pixel a binary code
to show its colour. When we put all these binary codes together, we get what is
called a bitmap, which is an array/grid of binary data representing the colour
values of pixels in an image or display. We call this method of representing images
on a computer bitmapped graphics. With bitmapped graphics, if only 1 bit is
used to represent each pixel, the binary code for each pixel is 1 or 0, giving 2
possible colours (such as black and white).
From Figure 1.8, ‘1’ is for ‘white’ and ‘0’ is for ‘black’. If more bits are used to
represent each pixel, then there are more combinations of binary numbers so
more colours can be represented. For example, if two bits are assigned to each
pixel, then four colours can be represented using the binary codes 00, 01, 10, and
11.
Activity 1.5
For each of the bitmaps in Figure 1.9, produce the pixel array that encode them
as a bitmapped graphics with white represented by ‘0’ and black represented by
‘1’. In other words, you are producing the array on the left of Figure 1.8, but for
the images in Figure 1.9.
11
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
4. Audio Representation
One method of representing sound on a computer is digital audio. Digital audio
is where sound is recorded as a sequence of samples, with each sample encoding
the amplitude of the sound wave at a specific time as seen in Figure 1.9. The
amplitude value is represented using a series of bits.
Here are examples of how audio can be represented using different bit depths:
a. 8-bit audio: Each sample is represented by an 8-bit binary number, which can
range from 0 to 255 ( - 1). This provides relatively low resolution and dynamic
range, suitable for some basic audio applications like early video games or
simple sound effects.
b. 16-bit audio: Each sample is represented by a 16-bit binary number, which
can range from 0 to 65,535 ( - 1). This is the standard format for CD-quality
audio and offers higher resolution and dynamic range compared to 8-bit audio.
c. 24-bit audio: Each sample is represented by a 24-bit binary number, which can
range from 0 to 16,777,215 ( - 1). 24-bit audio provides even greater resolution
and dynamic range, suitable for professional audio recording and mastering,
as well as high-fidelity audio playback.
These examples illustrate how the number of bits used to represent each sample affects
the quality and fidelity of the digital audio signal.
Activity 1.6
Share, with your study mate, how sound quality would be affected by adjusting
the rate at which samples are taken. For example, how would an audio file, where
samples are recorded every second, compare to one with samples taken every
0.1s.
12
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
Activity 1.7
Find out, using the internet, what sample rate CDs are typically recorded at,
exploring what unit of measurement is used and how that corresponds to samples
per second. As an extension, you can also find out why that is the standard rate in
relation to faithfully recording sound and how humans hear.
5. Video Representation
Digital videos are represented as a series of images (frames), where each frame is
encoded using bit patterns to store the colour of each pixel in the frame. Videos
are essentially a sequence of images played in rapid succession.
6. File Representation
Files, such as documents, images, videos, and executables are represented as
collections of bits. The arrangement of these bits follows specific file formats,
which dictate how the data should be interpreted and displayed.
Examples of file formats: JPEG for pictures, DOC or DOCX for Word documents
and XLS or XLSX for Excel spread sheets.
13
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
BIT PATTERNS
Representing data as bit patterns allows computers to process, store, and transmit data
efficiently. These representations conquer the binary nature of computing, enabling
the use of simple electronic circuits that can distinguish between two states (0 and 1) to
have the great utility of modern computers. These bit patterns serve as the foundation
of modern computing systems, enabling the vast array of applications and services we
use in our digital world.
Logic operations
These operations are based on the Boolean logic, which was developed by mathematician
George Boole and is widely used in computer science and digital electronics, including
applications in programming, digital circuit design, and data processing.
There are three main logic operations. These are: AND, OR and NOT.
Now, let’s look at the meaning of these logical operations.
14
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
1. AND operation
The AND operation takes two input values, often represented as A and B, and
produces an output based on the following rules:
a. If both A and B are 1 (true), the output is 1 (true).
b. Otherwise, if either A or B (or both) is 0 (false), the output is 0 (false).
In simple terms, the AND operation checks whether both input values are true,
and if they are, the result is also true; otherwise, the result is false.
The behaviour of logical operation can be summarised into a truth table. A
truth table is a breakdown of all the possible truth values returned by a logical
expression. Let us consider the truth table for the AND operation in Table 1.5.
Activity 1.8
0 0
0 1
1 0
1 1
15
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
Activity 1.9
Based on the output (A AND B) of input A and input B, provide the corresponding
inputs A and B that satisfy the output.
A (Input) B (Input) A AND B (Output)
1
0
0
1
2. OR Operation
The OR operation takes two input values, also often represented as A and B, and
produces an output based on the following rules:
a. If either A or B (or both) is 1 (true), the output is 1 (true).
b. If both A and B are 0 (false), then the output is 0 (false).
In simple terms, the OR operation checks if at least one of the input values is true
and if it is, the result is true; otherwise, the result is false.
Table 1.6 shows the truth table for the OR operation.
0 0 0
0 1 1
1 0 1
1 1 1
Table 1.6 OR logic truth table
16
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
Activity 1.10
Use the truth table of table 1.6 to complete the truth table below.
A (Input) B (Input) A OR B
(Output)
0 0
0 1
1 0
1 1
Activity 1.11
Complete the truth table below such that each row of inputs is different.
3. NOT Operation
The NOT operator takes a single input value (often referred to as A) and produces
the opposite value as the output.
a. If A is 0 (false), the output is 1 (true).
b. If A is 1 (true), the output is 0 (false).
In simple terms, the NOT operator negates or flips the input value.
0 1
1 0
Table 1.7 NOT Logic truth table
17
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
Activity 1.12
Use the truth table in table 1.7 to complete the table below.
Activity 1.13
Use the truth table in table 1.7 to complete the table below.
Understanding logic operations is important for programming and working with digital
circuits, as they form the basis for making decisions, comparisons, and computations
in computer systems. By using truth tables and practical examples, you can gain an
understanding of logic operations and their significance in digital computing.
One example is a truth table for analysing the statement ‘The dog is black, and you are
the dog’s owner’. This is a statement with two inputs or propositions, where the logic
operator is the AND. Therefore ‘the dog is black’ (labelled as A) and ‘you are the dog’s
owner’ (labelled as B) can be combined into the truth table of table 1.8 to summarise
the statement.
0 0 0
0 1 0
1 0 0
1 1 1
18
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
Activity 1.14
Discuss, with your study mates, why 1KB is 1024 bytes and not 1000 bytes.
Activity 1.15
Activity 1.16
Explore how much storage is needed for different types of data by conducting
online research or using available storage calculators to investigate the storage
requirements for a movie, a mobile phone photo, and a popular video game.
19
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
Secondary Storage
RAM or ROM
Input devices are pieces of equipment used to provide data and control signals to the
computer. The keyboard and mouse are examples of input devices. Output devices
provide data and control signals from the computer to the user. Screens and printers
are examples of output devices.
Flip-flop
Having understood what bits are, ‘the smallest pieces of data’ (either 0 or 1), the question
is, how are bits stored in the computer’s memory? A flip-flop is a basic electronic circuit
used for storing bits. A flip-flop can store only one bit of data. Some types of memory
(for example, a type of RAM called SRAM) use flip-flop circuits.
20
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
RAM has a limited capacity compared to secondary storage devices which will
be studied in the next section. The capacity of RAM is typically measured in
gigabytes (GB) or terabytes (TB). The amount of RAM in a computer affects its
ability to run multiple programmes simultaneously and handle large amounts of
data efficiently.
Binary numbers, called memory addresses, are used to identify storage locations
in RAM. RAM is described as volatile, meaning it requires power to retain data.
When the computer is turned off, the data stored in a RAM is lost.
3. Secondary Memory/Storage
Secondary memory is external, non-volatile memory where data can be stored
permanently. Examples include internal/external hard disk drives (HDDs), Pen
drives (Flash drives), CDs, and solid-state drives (SSDs). Secondary storage has a
much larger capacity than main memory but is slower in terms of access times.
Secondary storage is also sometimes termed auxiliary storage.
21
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
4. Cache Memory
Cache memory or CPU cache is a small, high-speed memory for temporary data
storage. It is located directly on the CPU or close to it. It acts as a buffer between the
CPU and RAM, holding frequently used data and instructions that the processor
may require next. This reduces the need for frequent slower memory retrievals
from RAM which may otherwise keep the CPU waiting.
5. Registers
Registers are the fastest access and smallest capacity storage units. They are located
within the CPU itself. They serve as temporary storage areas that store the data,
instructions and memory addresses that the CPU is currently processing.
Memory Hierarchy
Memory hierarchy is a hierarchical arrangement of different types of memory in a
computer system, organised in levels according to their speed, capacity and cost. The
memory hierarchy is designed to optimise data access and storage, ensuring that the
computer can efficiently process and retrieve data at various speeds. It consists of
several levels, each with different characteristics, purpose and proximity to the CPU.
The levels in the memory hierarchy go from the fastest and smallest access time to the
slowest and largest capacity.
Since CPU registers are the fastest to read and write, they are placed at the top of the
hierarchy. On the other hand, secondary storage devices like optical drives (CDs and
DVDs) are the slowest and largest and therefore occupy the last level in the pyramid.
A significant way to increase system performance is minimising how far down the
memory hierarchy data needs to be retrieved.
22
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
Activity 1.17
Use Figure 1.15 and any search engine of your choice to complete the task below.
a. Expand figure 1.15 into a poster that gives more details about each level.
b. Go online and find out detailed explanation of each level.
c. Prepare PowerPoint slides of your finding.
d. Share your finding with your colleagues.
CACHING
CPU cache is just an example of the more general concept of caching. In computing,
a cache is a hardware or software component that stores data so that future requests
for that data can be served faster. Another example of caching is browser cache, also
known as web cache.
23
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
Activity 1.18
With the aid of the internet, use the steps above to clear the browser cache of the
device you are using.
24
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
Activity 1.19
Write the names of other devices that have CPU in them in your jotter and share
with your friends in class.
Components of a CPU
A CPU consists of three main parts: the Control Unit (CU), the Arithmetic and Logic
Unit (ALU), and registers. We will look at each in turn, along with other components
of the CPU including its cache, clock and bus.
25
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
Activity 1.20
Table 1.9 shows real life examples of processing, breaking processes down into
their input, processor and output. For example, the first line demonstrates how
the process of washing clothes can be broken down into the input of dirty clothes,
the processor of a washing machine, and the output of clean clothes. Complete the
rest of the table individually, asking your teacher for feedback on your completed
table.
26
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
3. Registers
We have already touched on this part of the CPU in the last topic, where we
learned the details of computer memory. Recall that registers are the fastest
access and smallest capacity storage units, and that they are located within the
CPU itself. They serve as temporary storage areas that store the data, instructions
and memory addresses that the CPU is currently processing. Different types of
registers perform different functions. The names and functions of three of the
CPU registers include the following:
a. The Memory Address Register (MAR) stores the address in memory
currently being read from/written to.
b. The Program Counter (PC) stores the memory address of the next instruction
to be executed.
c. The Memory Data Register (MDR) holds data being transferred to and from
the processor.
4. Cache
Cache memory is a fast random-access memory that temporarily stores a small
amount of data and instructions that the CPU is likely to use, so that it can run
more efficiently.
Functions:
a. Temporarily store data and instructions for later.
b. Allows faster processing, as the CPU can get the data and instructions directly
from the cache instead of having to wait to retrieve them from RAM.
Activity 1.21
5. Clock
The clock is the part of the CPU that sends out regular pulses that keep the CPU
and its related components in step with one another. The CPU clock speed, also
27
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
6. System Bus
A bus is a communication channel/series of lines that connect the processor to
another part of the computer’s architecture.
The processor also has a set of internal buses that allow signals and data to pass
between its different components.
The three types of buses are address bus, data bus and control bus. These buses are
collectively called the system bus. Functions include:
a. The address bus sends memory addresses to other components.
b. The data bus sends the actual data to/from other components.
c. The control bus sends control signals to other devices.
Out of all the components looked at, the control unit, arithmetic and logic
unit, and registers are considered to be the three main parts of the CPU.
Activity 1.22
Together with one or more of your study mates, create an informative display
communicating all that you have learnt about the CPU. For example, you might
28
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
want to create a labelled model of the CPU including all the relevant parts (CU,
ALU, registers, etc.).
Activity 1.23
In pairs, pick one of the following processors and research it: Intel Core i5-
14600K, Intel Core i9-14900K, Intel Core i7-14700K, AMD Ryzen 7 5800X3D and
AMD Ryzen 97950X. Create a report of your findings that could be presented to
the class.
Activity 1.24
29
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
Machine Cycle
The CPU does its work by following a specific process called the machine cycle, which
consists of four main steps: fetch, decode, execute and store. For this reason, the
machine cycle is also known as the Fetch-Decode-Execute-Store cycle. This process is
a routine that the CPU repeats to run a programme/set of instructions. Figure 1.19
shows stages of the machine cycle and what parts of the computer are involved.
1. Fetch
During the fetch stage, the CPU retrieves an instruction from memory. This is
achieved by the address bus providing the location (or address) of the instruction
in the RAM, and the data bus transferring this instruction to the processor. The
programme counter is a register that keeps track of the memory address of the
next instruction. This is where the address bus finds the address, and after it has
passed the address of the current location, the programme counter is incremented
to point to the next instruction (by storing its address). The fetched instruction is
then stored in a designated register within the CPU for further processing.
2. Decode
In the decode stage, the CPU interprets the fetched instruction. It identifies the
operation to be performed and determines the operands involved. The instruction
is decoded into a format that the CPU can understand and execute.
3. Execute
Once the instruction has been decoded, the CPU executes the instruction; that
is, carrying out the necessary operations specified by the instruction. This stage
may involve arithmetic or logical calculations, data manipulation, or control flow
modifications.
30
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
4. Store
The final stage of the machine cycle is the store stage. Here the results of the
executed instruction are stored back in memory or designated registers. This stage
ensures that the changes made during the execution are preserved going forward
for future operations or the overall programme’s functioning. The four main
processes are shown in Figure 1.20.
The FDES cycle repeats continuously, with each cycle processing one instruction at a
time. By following this cycle, a computer system can execute complex programmes by
sequentially fetching, decoding, and executing instructions, storing any results. The
CPU clock, with its regular electronic pulses, synchronises the various stages of the
cycle, ensuring each step happens at the right time.
Activity 1.25
Embedded systems
An embedded system is a special-purpose computer system, which is completely
encapsulated by the device it controls. Its purpose is to control the device and to allow
a user to interact with it.
31
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
Programmes on an embedded system often run in real time with limited hardware
resources. For example, often there is no disk drive. The software may be stored in
a type of memory called Flash ROM. If a user interface is present, it is often a small
keypad and screen or touch screen.
32
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
Activity 1.25
1. Look around your home, school and place of work and name two examples
of embedded systems you might find in each place. Explain what the
embedded system does in each case.
2. What do you think are two important characteristics shared by most
embedded systems? Justify your answer.
3. Create a presentation demonstrating how embedded systems are employed
in managing household tasks, improving healthcare or enhancing
transportation systems.
33
Review Questions
34
8. Sir Kojo was passing by to attend to one of his lessons and heard students in 3A
General Arts class making noise. He then tasked the class to convert decimal
number 22 into its binary representation. What would be your answer if you were
a member of the class that day?
A. 10101
B. 11010
C. 10110
D. 11011
9. What does the AND operation do if both input values are 1?
A. Outputs 0
B. Outputs 1
C. Outputs either 0 or 1 randomly
10. Which logic operation inverts the input value?
A. AND
B. OR
C. NOT
11. The OR operation requires both inputs to be 1 to produce an output of 1. True or
False?
A. True
B. False
12. Which of the following best describes the difference between RAM and ROM?
A. RAM is volatile and ROM is non-volatile.
B. RAM is used for permanent storage and ROM is used for temporary storage.
C. RAM is non-volatile and ROM is volatile.
13. Given that 1 KB equals 1024 bytes, how many bytes are there in 7 KB?
14. Why is ROM considered non-volatile?
A. It retains data without power.
B. It loses data when power is turned off.
C. It can be easily rewritten.
D. It operates at high speeds.
15. Given two binary numbers A = 01101 and B = 10011, after performing the AND
operation point wise (bit by bit) on A and B, how many 1s are in the output?
A. 1
B. 2
C. 3
35
16. If a computer has 8GB of storage and a programme takes up 8000 MB of memory,
can the programme be stored? Explain your reasoning.
17. A student claims that deleting files from a computer’s ROM can speed it up.
Evaluate this statement and explain why it is correct or incorrect.
18. Create a truth table for the following statement and evaluate when it is true:
‘Kojo is not an artist and Abena is not a musician’
19. What does CPU stand for?
20. Which part of the human body is the best analogy for what the CPU is to a
computer?
A. Heart
B. Brain
C. Eyes
D. Skin
21. Which component is primarily responsible for executing instructions in a
computer?
A. RAM
B. ROM
C. CPU
D. SSD
22. Identify the three main components of a CPU.
A. Arithmetic Logic Unit (ALU), Control Unit (CU), and Registers
B. Hard Drive, Monitor, and Keyboard
C. Motherboard, Power Supply, and Fan
D. RAM, ROM, and SSD
23. Explain the role of CPU registers; specifically, how they help make computers
more efficient.
24. Explain the role of the ALU.
25. Explain the role of the CU.
26. How does increasing the clock speed of a CPU affect its performance?
27. If Efo Danny’s personal computer’s CPU can process 10 thousand instructions per
second, how many instructions can it process in one minute?
28. Describe how cache memory benefits CPU performance.
29. What are the four stages of the machine cycle?
30. Name the three buses that make up the system bus.
36
31. What is the name of the set of commands that a processor can understand and
execute?
32. Describe the steps involved in the fetch phase in the Fetch-Decode-Execute-Store
cycle.
33. Research and prepare a presentation to illustrate, with examples, how a typical
instruction is processed through the Fetch-Decode-Execute-Store cycle.
34. Explain the role the CPU clock plays in the machine cycle.
37
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
EXTENDED READING
• Click on the link below to learn more on ASCII Code and Binary https://youtu.be/
H4l42nbYmrU?si=BxrlW76QNrAbi6zS
• Click on the link below to watch a video on binary numbers
https://www.youtube.com/watch?v=kcTwu6TFZ08&t=2s
• Click on the link below to play a binary game
https://learningcontent.cisco.com/games/binary/index.html
• CSC 170 – Introduction to Computers and their Applications – Lecture #1 – Digital
Basics
38
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
REFERENCES
Appiah O. K., Birbal R., Taylor M. (2008). ICT for Senior High Schools, Students’ Book.
Sedco Publishing Limited, pg. 38 - 40.
Computer Science Wiki (2016). Fetch-execute-cycle.png retrieved from https://
computersciencewiki.org/index.php?title=File:Fetch-execute-cycle.png.
Fenwick, P. (2014). Introduction to computer data representation. Bentham Science
Publishers.
Harvard, Indonesia. (2022). Black and White Bitmap. In CS50 for Teachers. Retrieved
from https://cs50.harvard.edu/indonesia/2023/psets/4/filter/less/
NaCCA (2023). Computing Teacher Manual (Year One - Book One). Pages – 47.
Teach Computer Science (2024). Sound Representation. Retrieved from https://
teachcomputerscience.com/sound-representation/
Thapliyal, N. (2023). Difference Between RAM and ROM retrieved from https://www.
scaler.com/topics/difference-between-ram-and-rom/
39
SECTION 1 COMPUTER SYSTEMS A – DATA REPRESENTATION AND COMPUTER STRUCTURE
ACKNOWLEDGEMENTS
List of Contributors
Name Institution
40