<p>COURSE INFORMATION</p><p>Course Code: CS303 Course Name: Computer Organization Contacts: 3L+1T</p><p>PREREQUISITES To understand this course, the student must have idea of: . Concept of basic components of a digital computer, Basic concept of Fundamentals & Program structures. . Basic number systems, Binary numbers, representation of signed and unsigned numbers, Binary Arithmetic . . Boolean algebra, Karnaugh Maps, . Logic Gates </p><p>SYLLABI Module – 1: [8L] Basic organization of the stored program computer and operation sequence for execution of a program. Role of operating systems and compiler/assembler. Fetch, decode and execute cycle, Concept of operator, operand, registers and storage, Instruction format. Instruction sets and addressing modes. [7L] Commonly used number systems. Fixed and floating point representation of numbers. </p><p>[1L] Module – 2: [8L] Overflow and underflow. Design of adders - ripple carry and carry look ahead principles. [3L] Design of ALU. [1L] Fixed point multiplication -Booth's algorithm. [1L] Fixed point division - Restoring and non-restoring algorithms. [2L] Floating point - IEEE 754 standard. [1L] Module – 3: [10L] Memory unit design with special emphasis on implementation of CPU-memory interfacing. [2L] Memory organization, static and dynamic memory, memory hierarchy, associative memory. [3L] Cache memory, Virtual memory. Data path design for read/write access. [5L] Module – 4: [10L] Design of control unit - hardwired and microprogrammed control. [3L] Introduction to instruction pipelining. [2L] Introduction to RISC architectures. RISC vs CISC architectures. [2L] I/O operations - Concept of handshaking, Polled I/O, interrupt and DMA. [3L] BEYOND SYLLABI COVERAGE CS303.I Explain how to construct large memory using small chips.</p><p>CS303.II Identify different parameters used to measure the performance of a computer.</p><p>Lecture Plan: Cl. Date Topics Remarks No. 1 13/7/15 Fundamentals of Computers; Overview of Computer organization; Difference between Computer Organization & Computer Architecture 2 14/7/15 Basic organization of the stored program computer; operation sequence for execution of a program.; Role of operating systems and compiler/assembler 3&4 15/7/15 Number System; Complements of numbers; Binary data Problems to be 16/7/15 representation; Guard Bits & truncation solved 5&6 17/7/15 Multiplication of Unsigned & signed integers Problems to be 27/7/15 solved 7 28/7/15 Division of unsigned integers Problems to be solved 8 &9 28/7/15 Register Transfer Micro operation; Construction of Common 31/7/15 Bus; Memory Transfer; Arithmetic Micro operation; 10&1 3/8/15 Design Serial Adder, Parallel Adder, Carry propagate Adder, 1 4/8/15 Carry Look- Ahead Adder, Carry Save Adder 12 5/8/15 Design Binary Incrementer unit, Binary decrementer unit, Binary Adder-Subtractor Unit 13 10/8/15 Design Arithmetic Unit, 14 11/8/15 Design Logic Unit, Shifter Unit, Arithmetic Logic Unit(ALU) 15&1 12/8/15 Memory Hierarchy; Access Method; Block diagram of RAM & Problems to be 6 14/8/15 ROM chip; Construction of large Memory using small solved chips(Heterogeneous & Homogeneous case) 17&1 17/8/15 Internal organization of Memory chips; SRAM & DRAM Problems to be 8 18/8/15 Memory cell; Secondary Memory solved 19&2 19/8/15 Associative Memory; Performance of Cache Memory; Cache Problems to be 0 21/8/15 Mapping solved 21&2 24/8/15 Virtual Memory; Paging; Page replacement; Problems to be 2 25/8/15 solved 23 26/8/15 Control Unit design methods; Structure of Micro programmed Control Unit; 24 28/8/15 Instruction formats; CPU organization(Single accumulator, General register, Stack) 25&2 31/8/15 Instruction Length; Three address instruction, Two address Problems to be 6 4/9/15 instructions, one address instruction, Zero address instruction solved 27&2 7/9/15 Instruction Cycle; Addressing Modes; Instruction Type; CISC Vs 8 8/9/15 RISC 29 9/9/15 I/O Interface; I/O Driver; Synchronous & Asynchronous data transfer; 30 11/9/15 Polled I/O; Interrupt initiated I/O, interrupt hardware; 31 14/9/15 DMA controller, DMA transfer, DMA transfer mode; Daisy chaining method; polling; Fixed priority method; 32 22/9/15 Performance measurement of Computers; Structure of Problems to be SISD,SIMD,MISD Computer; solved 33 22/9/15 Pipelining; Instruction Pipelining; </p><p>Recommended Books: 1. T K Ghosh, A J Pal – “Computer Organization & Architecture “-TMH 2. Mano, M.M. – “Computer System Architecture” – PHI 3. Hamacher -“Computer Organisation” - McGraw Hill</p><p>Subject Teacher: Moumita Mantri Signature: </p>