CS318-Computer Organization

Fall 2024- 2025

EL-SAYED A. El-DAHSHAN
[email protected]
OFFICE: EELU- AIN SHAMS CENTRE.
 Course Administration

Textbook:
Lectures: DD 10:00 – 11:00 pm
Sections : From 0-:00 to 0-:00 am

Exams: 2 Quizzes (10%), Midterm

(20%) and final (50%).
Homework (10%).
Attendance and Participation (10%).
Slides: should be available on:
www.eelu.edu.eg
Office hours: Monday 00.00-00.00 pm, Computer System
Architecture (3rd Edition)
or by appointment at EELU- Ain Shams by M. Morris Mano
Centre. Published by Pearson
TA: WBA. Prentice Hall, 1993.

2
CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 2
 If You Need Help3
 If you have difficulties or problems on the course, you
can do one of the following (in the order of preference).
 Come talk to me after class.
 Go to the office hour.
 Send me an email for question that doesn't need a lot of
elaboration.
 Come see me at my office outside office hour: Please
make sure you make an appointment by email first.
 Do not hesitate to contact me if you have problem.
Any problem is usually easier to x if dealt with as
soon as possible.

CS318 Computer organization-E. El-dahshan

3 Lect 1 -10 Oct. 2024
 How to Succeed
4

 Come to lecture where you will see especially

important examples and applications.
 The best way to obtain skills required to succeed in this
 course is to do the assignments. Discussion on the
 assignment is OK, but all the work handed in should be
 original, written by you on your own words.
 Try to stay on schedule. Each lecture builds on top
of the previous one, so if you miss one lecture it will be
difficult to catch up.
 Read the book. You should read the sections I note
under the references in the overview of the lecture
slide.

4
CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024
 Acknowledgement
 This lecture note is modified from Engin112: Digital Design
by Prof. Maciej Ciesielski, Prof. Tilman Wolf, University of
Massachusetts Amherst and original slide from publisher

CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 5

 Computer Architecture VS Computer Organization

 Computer organization
 Encompasses all physical aspects of computer
systems.
 E.g., circuit design, control signals, memory types.
 How does a computer work?
 Computer architecture
 Logical aspects of system implementation as seen by
the programmer.
 E.g., instruction sets, instruction formats, data types,
addressing modes.
 How do I design a computer?
CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 6
 Difference between Computer Architecture and Computer Organization

Computer Organization:-
 Computer organization deals with the physical component of computer system that
interacts with each other to perform various functionality or Computer organization refers to
the operational units and their interconnections that realize the architecture specification.
 Computer organization is implementation of its architecture.
 Organization is like building a house by a brick.
 Example of organizational attributes include hardware details transparent to the programmer
such as control signal and peripheral.

Computer Architecture:-
 Computer Architecture refers to set of attributes that are visible to the programmer.
 Computer Architecture is more about design construction that may lead to better
performance of the system.
 Architecture describes what the computer does.
 Computer Architecture comes before organization. It's like building the design and
architecture of the house which takes maximum time
 A particular computer architecture may span over many years and can have number of
different computer models.

CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 7

 Computer Architecture

CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 8

CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 9
 Computer Organization& Computer Architecture

CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 10

CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 11
CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 12
CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 13
CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 14
CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 15
CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 16
CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 17
CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 18
CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 19
CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 20
CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 21
CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 22
 Decoders
 General decoder structure

 Typically n inputs, 2n outputs

 2-to-4, 3-to-8, 4-to-16, etc.

CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 23

 Binary 2-to-4 decoder

Note: “x” = (don’t care) cases.

CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 24

 Decoder Use – Operation Decoding

•Microprocessor instruction decoding

opcode field
other fields instruction

1 4-input binary
En decoder
0 1 2 ………. 15

jump

load decoded instructions

store
add

CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 25

 2-to-4-decoder logic diagram

CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 26

 3-input Binary Decoder

E x2 x1 x0 x y7 y6 y5 y4 y3 y2 y1 y0
1 0 0 0 0 0 0 0 0 0 0 0 1
1 0 0 1 1 0 0 0 0 0 0 1 0
1 0 1 0 2 0 0 0 0 0 1 0 0
1 0 1 1 3 0 0 0 0 1 0 0 0
1 1 0 0 4 0 0 0 1 0 0 0 0
1 1 0 1 5 0 0 1 0 0 0 0 0
1 1 1 0 6 0 1 0 0 0 0 0 0
1 1 1 1 7 1 0 0 0 0 0 0 0
0 - - - - 0 0 0 0 0 0 0 0

Inputs: x = (x2, x1, x0), with xi in {0,1} and E in {0,1}

Outputs: y = (y7,y6,y5,…,y1,y0) with yi in {0,1}
Function: yi = E. mi(x), i = 0,1,…,7

CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 27

 Implementing functions using a
Binary Decoder and OR Gates

Function z2

x2 x1 x0 z2 z1 z0 0
x2 1

Decoder
0 0 0 0 1 0 2 2 z1

Binary
0 0 1 1 0 0 x1 1 3
0 1 0 0 0 1 x0 0 4
0 1 1 0 1 0 5
6 z0
1 0 0 0 0 1 7
1 0 1 1 0 1
E
1 1 0 0 1 0
1 1 1 1 0 0
1
Remember that any function can be represented as a sum of minterms

CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 28

 Binary Encoders

• Only one input Ij has value 1 at any given time

• Output Y corresponds to the binary code of j when Ij = 1

CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 29

 8-to-3 Binary Encoders

Y0 = I1 + I3 + I5 + I7 (odd input indices)

Y1 = I2 + I3 + I6 + I7
Y2 = I4 + I5 + I6 + I7 (indices > 3)

CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 30

 Multiplexers

data
inputs
1 0

0
1 1
MUX
0 2

1 3 1 0

0
1 1
0 selection inputs

CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 31

 4-input Multiplexer

CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 32

 Typical Multiplexer use
selection between multiple paths to a functional unit

CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 33

 Multiplexers as universal modules

 Universal module: using only this module you are able

to implement ANY logic function.
 NAND and NOR gates for example are universal gates.
 Question: how do you assign inputs for the multiplexer
in order to implement a given function?

CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 34

 Exercise
Implement the following function using:
a) 8-input multiplexer.
b) 4-input multiplexer.

F=x,y,z(1,2,6,7)

CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 35

CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 36
CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 37
CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 38
CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 39
CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 40
 Table of contents
 Combinational circuit vs sequential circuits
 Types of sequential circuits
 Clock and Triggering
 Types of triggering
 Latches
 Flipflops

CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 41

 Combinational circuit vs sequential circuits

CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 42

 Types of sequential circuits
There are two types of sequential circuits: Asynchronous and
synchronous sequential circuits.
Asynchronous sequential circuit
Asynchronous sequential circuits are driven by the pulses of

the inputs instead of using the clock signals, that is the state
of circuit changes when the inputs change. The change in
internal state occurs when there is change in the input
variable. Un-clocked flip flops or time delay elements are used
as memory elements.
Synchronous sequential circuit

In synchronous sequential circuits, the state of memory

changes with the clock signal connected. That is, all the
outputs are affected by the clock signal at the same time.
Here, flip flops and latches are used as memory elements.
CS318 Computer organization-E. El-dahshan Lect 1 -10 Oct. 2024 43