1.0 Computer System 2021 - 2022 Students
1.0 Computer System 2021 - 2022 Students
1.0 Computer System 2021 - 2022 Students
1.1 i.
ii.
Input
Process
SYSTEM iii.
iv.
Output
Storage
What is Computer?
An electronic device that accepts data
(input), process data, produces
information (output) and store the
information for future use.
1.1 System Concept
Hardware Software
Process
Storage
1.1 System Concept
Storage
Process
1.1 System Concept
INPUT
INPUT
PROCESS
✓ Transforming data
into information.
1.1 System Concept
PROCESS
OUTPUT
OUTPUT
STORAGE
1. INPUT : 2. PROCESS:
Enter 2 and 5 using keyboard into Adds 2 and 5.
the memory of computer.
7
3. OUTPUT : 4.STORAGE:
Displays Saves the data and information for
the results 7 at the monitor. future use.
TEST YOURSELF 1.
There are four operations involved in information processing lifecycle. Identify and
state the operation of information processing cycle based on the given description.
PSPM 2018/2019
Description Operation
The information which has been processed is
produced in a usable form by people.
The data is being manipulated or transformed
into information.
The process to keep data, information and
programs in computer-processed form.
The data which entered or captured
electronically for processing.
TEST YOURSELF 2.
Section B : A lecturer plans to calculate the coursework marks at the end of each
semester. Coursework marks are the total marks for quizzes, assignments and
group project. PSPM 2018/2019
Operation Explanation
Input
Process
Output
Learning Outcomes :
Data Information
Collection of ✓ Processed data that
unprocessed items, conveys meaning
which can include number, and is useful to
character and symbol, people.
images, audio, video and
instructions.
Example: name, father’s Example: receipt, average
name, mark, unedited marks, result of semester
video and audio , raw one, student’s carry
picture. marks, video clips, full
song, poster, banner, book
cover
1.2 Number System and Representation
computer recognizes
only two discrete
electrical states
(on and off)
1.2 Number System and Representation
Example :
00110100 represents 4
00110110 represents 6
01000101 represents E
How a letter is converted to binary form and back
Step 1. Step 2.
The user An electronic signal
presses the for the capital
capital letter letter D is sent to
D on the the system unit.
keyboard.
Step 4. Step 3.
After processing, the binary The signal for the capital letter D
code for the capital letter D is converted to its binary code
is converted to an image, (01000100) and is stored in
and displayed on the memory for processing.
monitor.
TEST YOURSELF 3.
Section A : State three(3) benefits of using binary digits to represent data in
computers. PSPM 2018/2019
1.
2.
3.
EXTRA NOTES - Storage Capacity
TB PB
bit Byte KB MB GB
Example 1 : Convert 1 GB to KB
8 1024 1024 1024 1024 1024
TB PB
bit Byte KB MB GB
1GB = 1x1024x1024
= 1048576KB
Learning Outcomes :
✓ Convert between
1.2
binary and decimal
whole numbers
Number
System
and
Representation
1.2 Number System and Representation
Number System
A set of numerals
for representing numbers
1.2 Number System and Representation
Number System
Binary digit
110
Binary numbers
1.2 Number System and Representation
system 7 111
8 1000
and 9 1001
binary 10
11
1010
1011
number 12 1100
system 13 1101
14 1110
15 1111
16 10000
1.2 Number System and Representation
Example 1:
Solution:
Desired base is 2, so we repeatedly
divide the given decimal number by 2.
Example 2:
Solution:
Desired base is 2, so we repeatedly
divide the given decimal number by 2.
Example 3:
Solution:
Divide the given decimal number by 2
Example 1:
Solution:
Example 2:
Solution:
Example 3:
Solution:
Example 1:
Convert AFB2 16 to decimal number system
Example 2:
Example 3:
Example 1:
Example 2:
Convert the binary number 10010₂ to
hexadecimal.
Example 3:
Example 1:
Example 2:
Convert the hexadecimal number 1A2₁₆ to binary
number
Example 3:
Convert the hexadecimal number AF1₁₆ to binary
number.
1.3
encode characters using
ASCII, EBCDIC, Unicode
INFORMATION
CODING
SCHEME
1.3 Information Coding Scheme
Introduction
ASCII
•Basic ASCII
•Extended ASCII
EBCDIC
Unicode
1.3 Information Coding Scheme
❑ ASCII
(American Standard Code for Information Interchange)
❑ EBCDIC
(Extended Binary Coded Decimal Interchange Code)
❑ Unicode
(Uniform code capable of representing all world’s
languages)
1.3 Information Coding Scheme
ASCII
The American Standard Code for Information Interchange (ASCII) is
widely used in computers of all types.
ASCII codes are of two types :
ASCII-7 ( Basic ) and ASCII-8 ( Extended ).
ASCII-7 ASCII-8
is a 7-bit standard is an extended
ASCII code version of ASCII-7
In ASCII-7, the first 3 ASCII-8 is an 8-bit
bits are the zone bits code having 4 bits for
and the next 4 bits zone and 4 bits for
are for the digits. the digit.
1.3 Information Coding Scheme
ASCII
ASCII - 7 ASCII - 8
Basic Extended
7-bit standard ASCII code is an extended version of
ASCII-7
first 3 bits are the zone first 4 bits are the zone
bits bits
the next 4 bits are for the digits.
000 0000 0000 0000
Zone
Digits
1.3 Information Coding Scheme
ASCII - 8
1.3 Information Coding Scheme
WHY ASCII – 8?
is an extended version of
ASCII-7
1.3 Information Coding Scheme
EBCDIC
• The Extended Binary Coded Decimal
Interchange Code (EBCDIC) uses 8 bits
• (4 bits for zone, 4 bits for digit) to represent
a symbol in the data.
00000000
Zone Digits
• EBCDIC allows 2 8 = 256 combinations of bits.
1.3 Information Coding Scheme
EBCDIC
256 unique symbols are represented using
EBCDIC code.
Unicode
Unicode is a 16-bit coding scheme
that has the capacity of representing
all the world’s current languages,
as well as classic and historical
languages, consists 65536 characters
and symbols.
1.3 Information Coding Scheme
Unicode
Unicode is a universal character
encoding standard for the representation
of text which includes letters, numbers and
symbols in multi-lingual environments.
Unicode codes can uniquely represent any
character or symbol present in any
language like Chinese, Japanese etc.
Learning Outcomes :
1.3
number of bits/bytes in
a given word based on
INFORMATION each coding scheme
CODING
SCHEME
1.3 Information Coding Scheme
COMPUTER SCIENCE
1.3 Information Coding Scheme
COMPUTER SCIENCE
1.3 Information Coding Scheme
‘7 eleven’
1.3 Information Coding Scheme
‘7 eleven’
1.3 Information Coding Scheme
“SC 015”
1.3 Information Coding Scheme
COMPUTER SCIENCE
TEST YOURSELF 6.
Section B : A lecturer plans to calculate the coursework marks at the end of each
semester. Coursework marks are the total marks for quizzes, assignments and
group project. PSPM 2018/2019
1.3
system based on
number of bits and total
INFORMATION number of character.
CODING
SCHEME
1.3 Information Coding Scheme
1.4
(AND, OR, NOT) and
symbols (gate) used to
represent each of the
Logic Gate operators (AND, OR, NOT)
and
Simple
Logic Circuit
1.4 Logic Gate and Simple Logic Circuit
Introduction
AND
NOT OR
Logic
gate
1.4 Logic Gate and Simple Logic Circuit
NOT gate
• Changes one logic level to the opposite level.
• Assume A is input and Y is output, symbol of NOT
gate is:
Y = A
1.4 Logic Gate and Simple Logic Circuit
NOT gate
• Truth table:
A Y=A
AND gate
AND gate
• Boolean expression:
Y = A• B
• Truth table:
A B Y=A.B
False (0) False (0) False (0)
False (0) True (1) False (0)
True (1) False (0) False (0)
True (1) True (1) True (1)
1.4 Logic Gate and Simple Logic Circuit
OR gate
OR gate
• Boolean expression:
Y = A+ B
• Truth table:
A B Y=A+B
False (0) False (0) False (0)
False (0) True (1) True (1)
True (1) False (0) True (1)
True (1) True (1) True (1)
Learning Outcomes :
✓ Identify combination of
1.4
different gates (NAND,
NOR, XOR, XNOR)
Logic Gate
and
Simple
Logic Circuit
1.4 Logic Gate and Simple Logic Circuit
NAND gate
NAND gate
• Assume A & B are inputs and Y is output, symbol of
NAND gate is:
or
1.4 Logic Gate and Simple Logic Circuit
NAND gate
• Boolean expression: Y = A•B
• Truth table:
A B A.B Y = A .B
False (0) False (0) False (0) True (1)
False (0) True (1) False (0) True (1)
True (1) False (0) False (0) True (1)
True (1) True (1) True (1) False (0)
1.4 Logic Gate and Simple Logic Circuit
NOR gate
NOR gate
or
1.4 Logic Gate and Simple Logic Circuit
NOR gate
• Boolean expression: Y=A+B
• Truth table:
A B A+B Y=A+B
False (0) False (0) False (0) True (1)
False (0) True (1) True (1) False (0)
True (1) False (0) True (1) False (0)
True (1) True (1) True (1) False (0)
1.4 Logic Gate and Simple Logic Circuit
XOR gate
XOR gate
XOR gate
XOR gate
A . B + A . B OR
• Boolean expression:
• Truth table:
(A + B) . (A + B)
A B
False (0) False (0) False (0)
False (0) True (1) True (1)
True (1) False (0) True (1)
True (1) True (1) False (0)
1.4 Logic Gate and Simple Logic Circuit
XNOR gate
XNOR gate
XNOR gate
• Assume A & B are inputs and Y is output, symbol of
XNOR gate is:
Y
1.4 Logic Gate and Simple Logic Circuit
XNOR gate
• Boolean expression:
Y = A+B
• Truth table:
A B
False (0) False (0) True (1)
False (0) True (1) False (0)
True (1) False (0) False (0)
True (1) True (1) True (1)
TEST YOURSELF 7.
Section A : Name the logic symbols based on the descriptions given below.
PSPM 2018/2019
✓ Derive Boolean
1.4
expression (and truth
table) based on given
Logic Gate logic statement.
and ✓ Draw simple logic circuit
Simple from a given Boolean
Logic Circuit expression
Lets Try
Exercise
B Y
C
Your Answer
Lets Try
Exercise
A
Y
B C
Your Answer
Lets Try
Exercise
A
B Y
C
Your Answer
Lets Try
Y
Your Answer
Lets Try
Y
Your Answer
Lets Try
Y
Your Answer