1902CS30 COMPUTER ORGANIZATION AND

3 ARCHITECTURE L T P C

3 0 0 3

PREREQUISITES:
1. Programming and Problem Solving
2. , Data Structures
COURSE OBJECTIVES:
1. To develop background knowledge as well as core expertise
in algorithm design and analysis.
2. To provide the importance of the algorithm design process.
3. Learn the basics of algorithm analysis and design skills with
various methodologies.

MODULE I STRUCTURE OF COMPUTERS & MACHINE 9

INSTRUCTION Hour
s
Functional Module s - Basic operational concepts - Bus structures - Software -
performance – Technology– Instruction and instruction sequencing – Addressing
modes – operations and operands-Basic I/O operations. ALU design – Fixed point
and floating point operations
MODULE II BASIC PROCESSING MODULE 9
Hour
s
Fundamental concepts – Execution of a complete instruction – Multiple bus
organization – Hardwired control – Micro programmed control – Nano
programming.
MODULE PIPELINING 9
III Hour
s
Basic concepts – Data hazards – Instruction hazards – Influence on instruction
sets –Data path and control considerations – Performance considerations –
Exception handling.
MODULE PARALLELISM 9
IV Hour
s
Instruction-level-parallelism – Parallel processing challenges – Flynn's
classification – Hardware multithreading – Multicore processors
MODULE V MEMORY AND I/O SYSTEMS 9
Hour
s
Memory hierarchy - Memory technologies – Cache basics – Measuring and
improving cache performance - Virtual memory - Input/output system,
programmed I/O, DMA and interrupts, I/O processors. Total
TOTA 45
L HOURS
FURTHER READING / CONTENT BEYOND SYLLABUS / SEMINAR:
1. Advanced Design of an algprithms.
2. Algorithm Analysis.
3. Case Studies: Various computational techniques.
COURSE
OUTCOMES:
After completion of the course, Student will be able to
CO1 Create use case documents that capture requirements for a software
system.