COMPUTER ORGANIZATION AND

ARCHITECTURE
IKSAN BUKHORI, M.PHIL.
COURSE INTRODUCTION
LECTURER INFO

 Name : Iksan Bukhori

 Email : [email protected]
 Phone Number : 085217029493
 Availability : Cubicle C-10 Faculty of Engineering Room A Building 3rd Floor
Mon, Tue, Fri (Or by request)
RULES AND CONDUCTS

 Please come to the class on time

 You are allowed to be absent without permission from class at most 4 times. Those who violated this will
fail the class immediately.
 Students who are spending excessive amount of time playing on their phone or any form of
entertainment during the class session in the class will be given warning at most two times before being
kicked out of the class and considered absent.
 Any student who did not come to class but can provide formal permission from doctor or any institution
related to the reason behind the absence, will not be considered as being absent
 Two-way communication is always encouraged and appreciated, even outside the class session
GRADES

 Composition
- Mid-Term Exam : 30 %
- Final Exam/Project : 40 %
- Quizzes : 20 %
- Homework/Assignment : 10%

 Final grades may be adjusted; however, you are guaranteed the following:
Minimum Grade
0 E
55 D
60 C
64 C+
67 B-
70 B
75 B+
80 A-
85 A
HOMEWORK

 Homeworks will be given in fairly regular basis. The average of homework grades contributes 10% of

final grade.

 Homeworks must be submitted on time, on the scheduled day of the lecture. If you submit late, the

penalty will be –10·n points, where n is the total number of lateness made.
HOMEWORK TEMPLATE

 Any assignment submitted offline should be written on A4 papers, and include the header as shown

below
COA
Homework 6

Rudi Bravo
009201700008

21 March 2021

No.1. Answer: . . . . . . . .
SYLLABUS (TENTATIVE)

Week Topic Week Topic

1 Intro to COA and Logic Design 9 Organization and Architecture of CPU
Part I
2 Logic Design (cont.) 10 Organization and Architecture of CPU
Part II
3 Data Representation 11 Computer Arithmetic Part I
4 Computer System 12 Computer Arithmetic Part II
5 Organization and Architecture of Memory 13 Instruction Format
Part I
6 Organization and Architecture of Memory 14 Addressing Modes
Part II
7 Review 15 Review
8 MID EXAM 16 FINAL EXAM
REFERENCES

 Carl Hamacher, Zvonko Vranesic, Safwat Zaky, Computer Organization, McGraw Hill 2002.
 Andrew S. Tanenbaum, Structured Computer Organization, Pearson Prentice Hall 1999
 M. Morris, Mano, Computer System Architecture, Prentice Hall 1993
INTRO TO COA: ORGANIZATION VS
ARCHITECTURE
ORGANIZATION VS ARCHITECTURE

 Computer architecture : Structure and behaviour of the various

functional units of the computer and their interactions (“What to do?”)
 Computer Organization : The way the hardware components are
connected to form a computer system (“How to do?”)
 Computer having the same architecture may have different organization
 For example, all intel x86 family share the same basic architecture but
different version may implement it differently, i.e. having different
organization

Source: https://www.geeksforgeeks.org/differences-between-computer-architecture-and-
computer-organization/
ARCHITECTURE

 The design of computers, including their instruction sets, hardware components, and system
organization

Include specification that

Instruction Set determines how programs
in machine language
Architecture (ISA) interact with computer

Architecture
Deals with major computer
Hardware System hardware subsystems like
Architecture (HSA CPU, Memory, I/O, etc.
EXAMPLE: ISA

 Suppose that we simply want to do operation x=2+3

 There are several models of architecture that can be used. Each one of the box below represents
one instruction set (one ISA)

 Suppose that we chose the second one. Then in that case, similar operations should follow the same
architecture
EXAMPLE: HSA

 This choice of ISA determines the hardware that should be used. In this case we will need two registers
and one adder (for the operation Add R1,R2)
 These hardware specifications constitute what we call HSA
COMPUTER ORGANIZATION IN GENERAL
INTRO TO COA: CLASSIFICATION OF COMPUTER
ARCHITECTURES
CLASSIFICATION OF COMPUTER ARCHITECTURE: VON
NEUMANN VS NON-VON NEUMANN
Computer
Architecture

Non-Von
Von Neumann
Neumann
Architecture
Architecture

Harvard
Architecture

Modified
Harvard
Architecture
NON-VON NEUMANN ARCHITECTURE

 Harvard Architecture

 Modified Harvard Architecture

CLASSIFICATION OF COMPUTER ARCHITECTURE: SSID VS
SIMD VS MISD VS MIMD

In practice, technically no one uses it

INTRODUCTION TO LOGIC DESIGN (PART I)
NUMBER REPRESENTATION
CHANGING BASES

 Decimal  Binary  Binary  Decimal

Remainder 1101
13
1 0
:2
6
0
1× 2 =1
1
:2
:2
3
1 0 ×2 =0
2
:2
1 1 1× 2 =4
3
0 1× 2 =8
 
CHANGING BASES

 Binary  Octal
CHANGING BASES

 Binary  Hex
IMPORTANCE OF BINARY REPRESENTATION

 Computers fundamentally can only work with binaries which only consists of two symbols; ‘0’ and ‘1’
 As we have seen before, even octal and hex representation depends on binary representation
 Besides number, binary representation is also fundamental in Boolean Logic, where there are two
possible states of truth in a statement; True or False. These two values can be represented in binary
 Therefore, understanding the machinery inside computers in terms of these binary values are important
BOOLEAN ALGEBRA
HISTORY OF BOOLEAN ALGEBRA

 Developed by English Mathematician George Boole between 1815-1864

 It is described as an algebra of logic or an algebra of two values; True or False
 The term logic means a statement of having binary decisions, i.e. True/Yes or False/No
APPLICATION OF BOOLEAN ALGEBRA

 It is used to perform digital operations in digital computer

 In digital computer True is represented by ‘1’ (high volt”) and False is represented by ‘0’ (low volt)\
 Logical operations are performed by logical operators. The fundamental logical operators are:
1. AND (Conjunction)
2. OR (Disjunction)
3. NOT (Negation/Complement)
AND OPERATOR

 It perform “logical multiplication and commonly denoted by dot (.)

X Y X.Y
0 0 0
0 1 0
1 0 0
1 1 1
OR OPERATOR

 It perform “logical addition” and commonly denoted by (+)

X Y X+Y
0 0 0
0 1 1
1 0 1
1 1 1
NOT OPERATOR

 It perform “logical negation” and commonly denoted by bar overhead (-)

X
0 1
1 0
TRUTH TABLE

 Truth Table is a table that contains all possible values of logical variables/statements in Boolean
expression
 The number of possible combination = where n = number of variables used in a Boolean expression
TRUTH TABLE: EXAMPLE

 The following is an example of the truth table for XY + Z

TAUTOLOGY VS FALLACY

 If the output of Boolean expression is always TRUE, it is called Tautology

 If the output of Boolean expression is always False, it is called Fallacy

0 1 1 0
1 0 1 0

 In the above case, is a tautology while is a fallacy

EXERCISE
PRINCIPAL OF DUALITY

 In Boolean algebra, interchanging AND and OR operators while simultaneously negating the operands
do not change the truth value of the expression
Example
X.Y + Z’ = (X’ + Y).Z
BASIC THEOREM OF BOOLEAN ALGEBRA
EXERCISE
SOP VS POS REPRESENTATION OF BOOLEAN EXPRESSION

 Boolean expression can be represented by either

 Sum of Product (SOP) form or
 Product of Sum (POS) form

 For example,

AB + AC  SOP
(A+B)(A+C)  POS

 I n above exam p les bot h are in SOP and POS respe ct iv e ly but they are no t in
Standard SOP and POS.
POS AND SOP IN STANDARD FORM

 In standard SOP and POS, each term of Boolean expression must contain all the literals (with and
without bar) that has been used in Boolean expression
 If such condition is satisfied by the expression, such expression is called Canonical Form of Boolean
Expression

 Example: Let’s convert the previous SOP into its canonical form

AB + AC = AB(C+C’) + AC(B+B’)

= ABC + ABC’ + ABC + AB’C

= ABC + ABC’ + AB’C

EXERCISE

 Convert (A+B)(A+C) into canonical SOP form

THANK YOU