CSE2009_Computer Organization and Architecture_COURSE HANDOUT (1).rtf
CSE2009_Computer Organization and Architecture_COURSE HANDOUT (1).rtf
2013)
[2024-25 ODD SEMESTER]
COURSE HAND OUT [Revision 2 - JAN 2023]
SCHOOL: SOCSE DEPT: CSE DATE OF ISSUE: 15-07-2024
COURSE INSTRUCTOR(S): Dr. G. Vennira Selvi, Ms. Monisha Gupta, Dr. Pamela, Ms.
Sreelatha, Dr. Kuppala Saritha, Dr. Madhusudhan M V, Mr.
Sakthi S, Ms. Kalpana Harish
COURSE URL:
https://presidencyuniversity.linways.com/
PROGRAM OUTCOMES:
problems. [H]
PO2. Problem analysis: Identify, formulate, review research literature, and analyze complex
PO3. Design/development of solutions: Design solutions for complex engineering problems and
design system components or processes that meet the specified needs with appropriate
consideration for the public health and safety, and the cultural, societal, and environmental
considerations. [L]
PO4. Conduct investigations of complex problems: Use research-based knowledge and research
methods including design of experiments, analysis and interpretation of data, and synthesis of the
PO5. Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern
engineering and IT tools including prediction and modeling to complex engineering activities with an
PO6. The engineer and society: Apply reasoning informed by the contextual knowledge to assess
societal, health, safety, legal and cultural issues and the consequent responsibilities relevant to the
PO7. Environment and sustainability: Understand the impact of the professional engineering solutions
in societal and environmental contexts, and demonstrate the knowledge of, and need for sustainable
development.
PO8. Ethics: Apply ethical principles and commit to professional ethics and responsibilities and
PO9. Individual and team work: Function effectively as an individual, and as a member or
engineering community and with society at large, such as, being able to comprehend and write
effective reports and design documentation, make effective presentations, and give and receive
clear instructions.[L]
PO11. Project management and finance: Demonstrate knowledge and understanding of the
engineering and management principles and apply these to one’s own work, as a member and leader
PSO1: [Problem Analysis]: Identify, formulate, research literature, and analyze complex
technologies and design system components or processes that meet the specified needs with
appropriate consideration for the public health and safety, and the cultural, societal, and
environmental considerations.[L]
PS03: [Modern Tool usage] : Create, select, and apply appropriate techniques, resources, and modern
engineering and IT tools including prediction and modelling to complex engineering activities related
to Software Engineering principles and practices, Programming and Computing technologies with an
COURSE PREREQUISITES:
COURSE DESCRIPTION:
This course introduces the core principles of computer architecture and organization from basics to
intermediate level. This theory-based course emphasizes on understanding the interaction between
computer hardware and software. It equips the students with the intuition behind assembly-level
instruction set architectures. It helps the students to interpret the operational concepts of computer
COURSE OBJECTIVE:
The objective of the course is to familiarize the learners with the concepts of Computer Organization
and Architecture and attain Skill Development through Participative Learning techniques.
COURSE OUTCOMES: On successful completion of the course the students shall be able to:
TABLE 1: COURSE
OUTCOMES
CO CO Expected
Number BLOOMS
LEVEL
CO1 Discuss the basic components of a computer, their interconnections, and Remember
instruction set architecture
CO2 Apply appropriate techniques to carry out selected arithmetic operations Apply
Reference Book(s):
R1. William Stallings, “Computer Organization & Architecture – Designing for performance”, 11th
Edition, Pearson Education Inc., 2019. (RB1)
R2. David A. Patterson, John L. Hennessy, “Computer Organization and design MIPS Edition- The
Hardware/Software Interface”, 6th Edition, Morgan Kaufmann, Elsevier Publications, November
2020. (RB2)
ONLINE RESOURCES:
W1. NPTEL Course on “Computer architecture and organization” IIT Kharagpur By Prof. Indranil
Sengupta, Prof. Kamalika Datta. https://nptel.ac.in/courses/106105163
W2. NPTEL Course on “Computer Organization”, IIT Madras By Prof. S. Raman.
https://nptel.ac.in/courses/106106092
COURSE SCHEDULE:
TABLE 4: COURSE BROAD
SCHEDULE
Sl. ACTIVITY PLANNED PLANNED TOTAL NUMBER OF
No. STARTING CONCLUDING PERIODS
DATE DATE
01 Over View of the course 19/08/2024 1
02 Module : 01 20/08/2024 15/09/2024 12
03 Surprise Test 1 - - NA
04 Module: 02 17/09/2024 14/10/2024 11
05 Surprise Test 2 - - NA
06 Assignment 1 15/10/2024 23/10/2024 --
07 Midterm As per schedule by COE
08 Module:03 15/10/2024 18/11/2024 11
09 Surprise Test 3 - - NA
10 Module:04 19/11/2024 13/12/2024 10
11 Assignment 2 19/11/2024 27/11/2024 --
DETAILED SCHEDULE OF INSTRUCTION:
Main pedagogy: PPT + Chalk Board and Lecture
Module 1 Integration
14 Instructions Register,
Module 2 : Absolute, Immediate,
Instructio Indirect Addressing
n Set modes
Architectu LO1: Explain the Absolute, T1
re and Immediate and Direct L1 - CO 1 Chap. 2
Memory Addressing with an (Pg. 48)
Unit example.
LO2: Interpret the type of
addressing mode used in the L3
given instructions.
15 Indirect Addressing
modes,
Index Mode and Relative --
Addressing
LO1: Explain the Indirect, T1
Index and relative L1 CO Chap. 2
Addressing with an 1 (Pg. 50)
example.
LO2: Interpret the type of
addressing mode used in the L3
given instructions.
16
Auto increment and Auto
decrement mode
LO1: Explain the Auto T1
increment and Auto L1 - CO Chap. 2
decrement instructions with 1 (Pg. 57)
an example.
LO2: Calculate the effective L3
address of the operands.
17 Processor stack and stack
operations
LO1: Describe the T1
operations used in a stack L1 CO Chap. 2
LO2: Explain the operations - 1 (Pg. 68)
performed to solve an L2
equation using stack.
18 Subroutine, Subroutine
Nesting
LO1: Explain the Push and
Pop subroutine. L1 - T1
LO2: Demonstrate the CO Chap. 2
operations to point the PC 1 (Pg. 72)
register to a subroutine using
stack. L3
19 Internal Organization of -
Memory Chips
LO1: Describe Static T1
memory. L1 CO Chap. 5
LO2: Explain the memory 3 (Pg 295)
organization of 16 X8 chip. L2
20 Internal Organization of
Memory Chips
LO1: Describe Dynamic L1 T1
memory. CO Chap. 5
LO2: Explain the read and L2 -- 3 (Pg 295)
write operations of dynamic
memory.
21 Read-Only memories,
Speed, Size and Cost,
Memory Hierarchy T1
LO1: Explain the types of CO Chap. 5
primary memory. L1 -- 3 (Pg.309)
LO2: Compare the Speed,
size and cost of memory L2
devices.
22 Introduction to Cache
Memory
LO1: Define the operations -- T1
performed in cache L1 CO Chap. 5
memory. 3 (Pg.314)
LO2: Illustrate the benefit L3
of using cache memory
23 Different Mapping
Technique’s LO1: Explain
the different techniques of T1
Mapping functions with L1 -- CO Chap. 5
example. LO2: Solve the 3 (Pg.316)
given problem using
different caching L3
techniques.
24 Surprise Test I
Module 2 Integration
25 4 bit carry look ahead
adder
LO1: Explain the concept T1
C
of Look ahead adder LO2: Chap. 6
Describe the design of L1 -- O (Pg.372)
Look Ahead Adder circuit 2
L2
26 Introduction and problem
on Booth Algorithm LO1:
Write the Booth Algorithm L1 -- T1
LO2: Solve the given C Chap. 6
problem using Booth O (Pg.380)
Algorithm L3 2
27 Problem on Booth
Algorithm
LO1: Explain the key T1
features of Booth L1 C Chap. 6
Module 3: Algorithm. -- O (Pg.382)
Arithmeti LO2: Solve the given 2
c and problem using Booth L3
Input/Out Algorithm
28 put Units Introduction to Restoring
Division
LO1: Write the Restoring -- T1
Algorithm L1 C Chap. 6
LO2: Solve the given O (Pg.390)
problem using Restoring 2
Algorithm L3
29 Problems on Restoring
Division
LO1: Explain the key T1
features of Restoring L1 C Chap. 6
Division Algorithm. LO2: -- O (Pg.391)
Solve the given problem 2
using Restoring L3
Division Algorithm
30 IEEE Standards For
Floating- Point Numbers
(Single Precision) LO1: T1
Explain the pertinent L1 -- C Chap. 6
concepts of IEEE standards. O (Pg.394)
LO2: Interpret the given 2
numbers in IEEE format. L3
31 IEEE Standards For
Floating- Point Numbers T1
(Single Precision) L1 -- C Chap. 6
LO1:Explain the IEEE O (Pg.394)
Formats. L2 2
LO2: Find the smallest and
largest number possible in a
given IEEE format.
32 Accessing I/O devices,
LO1:Explain the two
schemes to connect I/O T1
L1
devices to CPU LO2:Write Chap. 4
a program to check the -- C (Pg.204)
status of register and read or O
L3 1
display data.
33 Interrupts, Enabling and
Disabling
LO1: Describe an interrupt T1
LO2: Explain the different L1 C Chap. 4
ways of enabling and O (Pg.208)
disabling interrupts L2 1
34 Types of interrupts
LO1: Explain the concept T1
of ISR L1
C Chap. 4
LO2: Describe different -- O (Pg.213)
ways of handling interrupts 1
L2
35 DMA operation LO1:
Define DMA operation
LO2: Distinguish the two L1 T1
modes of memory access C Chap. 4
by DMA controller -- O (Pg.234)
L2 1
36 Surprise Test 3
Module 3 Integration
37 Fundamental Concepts,
LO1: Define ISP L1 T1
LO2: Describe the steps in -- C Chap. 7
the execution of instructions. L2 O (Pg.412)
3
38 Module 4: Single Bus Organization,
Basic Control sequence
Processing LO1: Explain the registers T1
L1 -- C
Unit and used in the execution. Chap. 7
Pipelining LO2: Illustrate the execution O (Pg.413)
of an instruction in single bus 3
L3
organization
39 Control Sequence for CO3 Chap. 7
execution of complete (Pg.421)
instruction L1
LO1: List the actions --
perfomed in execution of
instruction L2
LO2: Explain the control
sequence for execution of a
given instruction
40 Three Bus Organization,
Control sequence
LO1: Explain the working L1
of registers in execution of T1
instruction. -- CO Chap. 7
LO2: Illustrate the execution (Pg.423)
of an instruction in multiple L3 3
bus organization
41 Control Sequence for
execution of complete
instruction for 3-bus LO1:
List the actions performed L1 T1
in execution of instruction CO Chap. 7
LO2: Explain the control -- 3 (Pg.424)
sequence for execution of
a given instruction in L2
multiple bus organization
42 An Overview of
Pipelining
LO1: Describe the T1
different stages of L1 -- CO Chap. 8
pipelining 3 (Pg.454)
LO2: Describe the
execution of instructions in L2
stages.
43 Types of Pipeline
Dependencies T1
LO1:List the dependencies in L1 -- CO Chap. 8
pipeline 3 (Pg.458)
LO2: Explain the
dependencies in pipeline L2
44 Structural, Data and
Control hazards LO1:
Outline the T1
requirements to overcome L1 -- CO Chap. 8
hazards 3 (Pg.461)
LO2:Illustrate the hazards
in pipelining L3
45 Surprise Test 4
SPECIFIC GUIDELINES TO STUDENTS:
ASSESSMENT SCHEDULE:
TABLE 6 ASSESSMENT
SCHEDULE
Course
Sl. Assessment Duratio DATE
Content outcom Marks Weightag
No. type s n In e &
e
Numbe Hours TIME
r
Surprise 10
1 Module 1 CO 1 --- 5%
Test 1 Mark
s
Surprise 10
2 Module 2 CO 2 --- 5%
Test 2 Mark
s
Assignment Questions from Module 1 CO 1 & 10
3 --- 5%
1 / Activity & 2 CO2 Mark
s
Module 1: Basic
Midterm Structure of Computers
2 Examinati Module 2: Instruction Set CO 1, 2 hours 50 25%
on Architecture and Memory CO 2 Mark
Unit s
Surprise 10
3 CO 2, --- 5%
Test 3 Module 3 Mark
CO3
s
Assignmen Problems from Module 3 CO 2 10
t2/ & --- Mark 5%
Activity CO3 s
Module 1: Basic Will be
announced
Structure of Computers by COE
Module 2: Instruction Set
Architecture and Memory
CO1,
Unit
CO 100
6 End Term Module 3: Arithmetic 3 hours 50%
2, Marks
and Input/Output Units
CO 3
Module 4: Basic
Processing Unit and
Pipelining
COURSE CLEARANCE CRITERIA:
AS PER ACADEMIC REGULATIONS OF THE UNIVERSITY
CONTACT TIMINGS IN THE CHAMBER FOR ANY DISCUSSIONS: (Here mention the fixed
slots on any of the week days for students to come and interact with you)
SAMPLE THOUGHT PROVOKING QUESTIONS:
APPROVAL:
This course has been duly verified Approved by the D.A.C.
Name and signature of the Instructor In-Charge (s) AFTER completing entries in Table number 3 and 8 at
end of semester:
Name and signature of the DAC Chairperson AFTER completing entries in Table number 3 and 8 at end of
semester: