UNIVERSITY OF COLOMBO

SCHOOL OF COMPUTING

IT2101
Computer Architecture &
Operating Systems

DEGREE OF BACHELOR OF
INFORMATION TECHNOLOGY
 Major Topics
1.
1. Review
Review ofof Basic
Basic Principles
Principles 07
07
2.
2. General
General Systems
Systems Architecture
Architecture 04
04
3.
3. Instruction
Instruction Set
Set Architecture
Architecture 05
05
4.
4. Basic
Basic CPU
CPU Architecture
Architecture 04
04
5.
5. Memory
Memory Hierarchy
Hierarchy && I/O
I/O Techniques
Techniques 06
06
6.
6. Parallelism
Parallelism 04
04
7.
7. Introduction
Introduction toto Operating
Operating Systems
Systems 04
04
88 Processes
Processes && Process
Process Management
Management 08
08
9.
9. Memory
Memory Management
Management 06
06
10.
10. File
File Systems
Systems 06
06
11
11 Unix
Unix System
System && Windows
Windows NT NT Overview
Overview 06
06
Total Lectures 60
 Review of Basic Principles (7hrs.)
•• Radix
Radix number
number systems
systems
•• Decimal,
Decimal, Binary,
Binary, and
and Hexadecimal
Hexadecimal number
number
systems
systems
•• Binary
Binary arithmetic:
arithmetic: addition,
addition, complements,
complements, and
and
subtraction
subtraction
•• Binary
Binary Codes
Codes
•• BCD
BCD code
code
•• ASCII
ASCII character
character code
code
•• Boolean
Boolean algebra
algebra and
and Logic
Logic Gates:
Gates:
•• Boolean
Boolean functions
functions
•• Logic
Logic Gates:
Gates: AND,
AND, OR,
OR, NOT,
NOT, NOR,
NOR, NAND,
NAND, XOR
XOR
•• Simplification
Simplification of
of Boolean
Boolean functions:(2,3,
functions:(2,3, and
and 44
variable
variable Karnaugh
Karnaugh maps)
maps)
 Review of Basic Principles
• Digital Computer
– A digital system performing
computational tasks.
– Represents information using variables
that take a limited number of discrete
values.
– Processes these values internally
– Uses two basic values to represent
information
Radix Number Systems
Each number system has a number of
different digits which is called the radix
or the base of the number system.

• Decimal Base = 10
• Binary Base = 2
• Octal Base = 8
• Hexadecimal (Hex) Base = 16
 Decimal Number System
Base (Radix) 10
Digits 0, 1, 2, 3, 4, 5, 6, 7, 8, 9
e.g. 747510
The magnitude represented by a digit is decided by
the position of the digit within the number.
1000 100 10 1
7 4 7 5

For example the digit 7 in the left-most position of

7475 counts for 7000 and the digit 7 in the second
position from the right counts for 70.
 Binary Number System
Base (Radix) 2
Digits 0, 1
e.g. 11102
8=23 4=22 2=21 1=20

1 1 1 0
The digit 1 in the third position from the right
represents the value 4 and the digit 1 in the
fourth position from the right represents the
value 8.
 Octal Number System
Base (Radix) 8
Digits 0, 1, 2, 3, 4, 5, 6, 7
e.g. 16238
512=83 64=82 8=81 1=80

1 6 2 3

The digit 2 in the second position from the right

represents the value 16 and the digit 1 in the
fourth position from the right represents the value
512.
 Hexadecimal Number System
Base (Radix) 16
Digits 0, 1, 2, 3, 4, 5, 6, 7, 8, 9,
A, B, C, D, E, F
e.g. 2F4D 16
4096=163 256=162 16=161 1=160

2 F 4 D

The digit F in the third position from the right

represents the value 3840 and the digit D in the
first position from the right represents the value 1.
Binary Arithmetic
• Addition

•Complements
•Subtraction
Binary Addition
0 (b) 0
(a)
+0 +1
0 1

(c) 1 (d) 1
+0 +1
1 10
Carry Bit
 Binary Addition Examples
(a) 1011 (b) 1010 (c) 1011
+ 1100 + 100 + 101
10111 1110 10000

(d)
101 (e) 10011001
+ 1001 + 101100
1110 11000101
 Binary Complement
(1s Complement) Operation
1 0
0 1
Example

110010110

001101001
 Two’s Complement
The Two’s complement of a binary number
is obtained by first complementing the
number and then adding 1 to the result.
1001110
0110001 One’s Complement
+ 1
0110010 Two’s Complement
 Binary Subtraction
Binary subtraction is implemented by adding
the Two’s complement of the number to be
subtracted. Two’s
Example complement
of 1001
1101 1101
-1001 +0111
10100
If there is a carry then it is ignored. Thus,
the answer is 0100.
Binary Codes
A binary code is a group of n bits that
assume up to 2n distinct combinations of 1’s
and 0’s with each combination representing
one element of the set that is being coded.

• BCD – Binary Coded Decimal

• ASCII – American Standard Code for
Information Interchange
 BCD – Binary Coded Decimal
Decimal BCD
Number Number
When the decimal numbers are
represented in BCD, each 0 0000
decimal digit is represented by 1 0001
the equivalent BCD code. 2 0010
3 0011
Example :BCD Representation 4 0100
of Decimal 6349 5 0101
6 0110
6 3 4 9
7 0111
0110 0011 0100 1001 8 1000
9 1001
ASCII
Number ASCII Letter ASCII

0 A
0110000 1000001
1 B
0110001 1000010
2 C
0110010 1000011
3 D
0110011 1000100
4 E
0110100 1000101
5 F
ASCII Continued.
Letter ASCII Letter ASCII
J S
1001010 1010011
K T
1001011 1010100
L U
1001100 1010101
M V
1001101 1010110
N W
1001110 1010111
O X
Logic Gates
• Binary information is represented in
digital computers by physical quantities
called signals.
• Two different electrical voltage levels
such as 3 volts and 0.5 volts may be
used to represent binary 1 and 0.
• Binary logic deals with binary variables
and with operations that assume a logical
meaning.
Logic Gates Contd…
• A particular logic operation can be
described in an algebraic or tabular form.
• The manipulation of binary information is
done by the circuits called logic gates
which are blocks of hardware that
produce signals of binary 1 or 0 when
input logic requirements are satisfied.
Logic Gates Contd…
• Each gate has a distinct graphics
symbol and it’s operation can be
described by means of an algebraic
expression or in a form of a table
called the truth table.
• Each gate has one or more binary
inputs and one binary output.
Logic Gates
AND
OR
NOT (Inverter)
NAND (Not AND)
NOR (Not OR)
XOR (Exclusive-OR)
Exclusive-NOR
Logic Gates Cont.
AND Logic Gate Truth Table

A AB x
x
B 0 0 0
0 1 0
x=A.B 1 0 0
A, B Binary Input Variables 1 1 1
x Binary Output Variable
Logic Gates Cont.

OR Logic Gate Truth

Table
A AB x
x
B 0 0 0
0 1 1
1 0 1
x=A+B 1 1 1
This is read as x
equals A or B.
Logic Gates Cont.
NOT Logic Gate Truth Table

A x
A x
0 1
1 0

x=A
Logic Gates Cont.
NAND Logic Gate Truth
Table
A
x AB x
B
0 0 1
0 1 1
x=A.B
1 0 1
1 1 0
Logic Gates Cont.

NOR Logic Gate Truth Table

A AB x
x
B 0 0 1
0 1 0
x=A+B 1 0 0
1 1 0
Logic Gates Cont.
XOR Logic Gate Truth Table

A AB x
x
B 0 0 0
0 1 1
1 0 1
x=A+B
1 1 0
Logic Gates Cont.

Exclusive-NOR Logic Gate Truth

Table
A
x AB x
B
0 0 1
0 1 0
x=A+B 1 0 0
1 1 1
 Contact
External Degree Unit (EDU) of the
University of Colombo School of
Computing
No. 221/2A, Dharmapala Mawatha,
Colombo 7.
Phone : 074-720511
Fax : 074-720512

http://www.bit. lk
Thank you