SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR

Similar documents
CHETTINAD COLLEGE OF ENGINEERING AND TECHNOLOGY COMPUTER ARCHITECURE- III YEAR EEE-6 TH SEMESTER 16 MARKS QUESTION BANK UNIT-1

Course Description: This course includes concepts of instruction set architecture,

PART A (22 Marks) 2. a) Briefly write about r's complement and (r-1)'s complement. [8] b) Explain any two ways of adding decimal numbers.

COMPUTER ORGANIZATION AND ARCHITECTURE

INTELLIGENCE PLUS CHARACTER - THAT IS THE GOAL OF TRUE EDUCATION UNIT-I

SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE) UNIT-I

SYLLABUS. osmania university CHAPTER - 1 : REGISTER TRANSFER LANGUAGE AND MICRO OPERATION CHAPTER - 2 : BASIC COMPUTER

JNTUWORLD. 1. Discuss in detail inter processor arbitration logics and procedures with necessary diagrams? [15]

MaanavaN.Com CS1202 COMPUTER ARCHITECHTURE

Honorary Professor Supercomputer Education and Research Centre Indian Institute of Science, Bangalore

Computer Organization and Microprocessors SYLLABUS CHAPTER - 1 : BASIC STRUCTURE OF COMPUTERS CHAPTER - 3 : THE MEMORY SYSTEM

1. Define Peripherals. Explain I/O Bus and Interface Modules. Peripherals: Input-output device attached to the computer are also called peripherals.

COA. Prepared By: Dhaval R. Patel Page 1. Q.1 Define MBR.

3. Which of the following is volatile? [ ] A) Bubble memory B) RAM C) ROM D) Magneticdisk

COURSE DESCRIPTION. CS 232 Course Title Computer Organization. Course Coordinators

2 MARKS Q&A 1 KNREDDY UNIT-I

SAE5C Computer Organization and Architecture. Unit : I - V

SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR

UNIT I BASIC STRUCTURE OF COMPUTERS Part A( 2Marks) 1. What is meant by the stored program concept? 2. What are the basic functional units of a

CS2253 COMPUTER ORGANIZATION AND ARCHITECTURE 1 KINGS COLLEGE OF ENGINEERING DEPARTMENT OF INFORMATION TECHNOLOGY

Computer organization and architecture UNIT-I 2 MARKS

Computer Architecture: Part V. First Semester 2013 Department of Computer Science Faculty of Science Chiang Mai University

Computer Organisation CS303

QUESTION BANK UNIT-I. 4. With a neat diagram explain Von Neumann computer architecture

DC57 COMPUTER ORGANIZATION JUNE 2013

Computer System Overview OPERATING SYSTEM TOP-LEVEL COMPONENTS. Simplified view: Operating Systems. Slide 1. Slide /S2. Slide 2.

Computer System Overview

UNIT I DATA REPRESENTATION, MICRO-OPERATIONS, ORGANIZATION AND DESIGN

Time : 03 Hours Maximum Marks : 75

INPUT-OUTPUT ORGANIZATION

SYLLABUS UNIT - I 8086/8088 ARCHITECTURE AND INSTRUCTION SET

2. (a) Compare the characteristics of a floppy disk and a hard disk. (b) Discuss in detail memory interleaving. [8+7]

Microprocessors and Microcontrollers. Assignment 1:

DIGITA L LOGIC AND COMPUTER ORGA NIZATION

Advanced Diploma in Computer Science (907) Computer Systems Architecture

VALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

4 Multiplexer. Y Fig Keyboard Scan Matrix

Input / Output. School of Computer Science G51CSA

Seth Jai Parkash Polytechnic, Damla

Computer Organization - 2nd MID - -

Reader's Guide Outline of the Book A Roadmap For Readers and Instructors Why Study Computer Organization and Architecture Internet and Web Resources

CHAPTER 4 MARIE: An Introduction to a Simple Computer

Modes of Transfer. Interface. Data Register. Status Register. F= Flag Bit. Fig. (1) Data transfer from I/O to CPU

CS6303-COMPUTER ARCHITECTURE UNIT I OVERVIEW AND INSTRUCTIONS PART A

Computer Organization

Chapter 2: Data Manipulation

Chapter 2 Data Manipulation

Chapter 2: Data Manipulation

FACULTY OF ENGINEERING & TECHNOLOGY SYLLABUS

Computer Systems Overview

5 Computer Organization

COURSE FILE COMPUTER ORGANIZATION. IV B.Tech. - I Semester. Department of Computer Science and Engineering

1) What is information system? Describe the basic concepts of information systems.

BASIC INTERFACING CONCEPTS

Chapter 2: Data Manipulation. Copyright 2015 Pearson Education, Inc.

INPUT-OUTPUT ORGANIZATION

COMPUTER ORGANIZATION AND ARCHITECTURE

Chapter 1 Computer System Overview

Processing Unit CS206T

Darshan Institute of Engineering & Technology for Diploma Studies Unit - 1

5 Computer Organization

Chapter 3. Top Level View of Computer Function and Interconnection. Yonsei University

Computer Organization. Submitted By: Dalvir Hooda

M.Sc. (Previous) DEGREE EXAMINATION, MAY First Year Information Technology. Time : 03 Hours Maximum Marks : 75

Programmed I/O Interrupt-Driven I/O Direct Memory Access (DMA) I/O Processors. 10/12/2017 Input/Output Systems and Peripheral Devices (02-2)

Pipeline and Vector Processing 1. Parallel Processing SISD SIMD MISD & MIMD

Advanced Parallel Architecture Lesson 3. Annalisa Massini /2015

Chapter 2: Data Manipulation


The von Neumann Architecture. IT 3123 Hardware and Software Concepts. The Instruction Cycle. Registers. LMC Executes a Store.

Computer Architecture CS 355 Busses & I/O System

Instruction Register. Instruction Decoder. Control Unit (Combinational Circuit) Control Signals (These signals go to register) The bus and the ALU

DR. JIVRAJ MEHTA INSTITUTE OF THECHNOLOGY

Microprocessor Micro Syllabus BSc. CSIT, IOST, TU. Microprocessor

Microcontrollers. Microcontroller

UNIT-II. Part-2: CENTRAL PROCESSING UNIT

COS Computer Organization. Review Questions Ref. Chap Title Page Introduction Computer Evolution & Performance 4

Advanced Parallel Architecture Lesson 3. Annalisa Massini /2015

Unit 1. Chapter 3 Top Level View of Computer Function and Interconnection

SRM UNIVERSITY FACULTY OF SCIENCE AND HUMANITIES DEPARTMENT OF PHYSICS AND NANOTECHNOLOGY COURSE PLAN FOR PHY0408

COMPUTER ORGANIZATION & ARCHITECTURE

Blog -

MICROPROCESSOR MEMORY ORGANIZATION

Structure of Computer Systems

Computer System Overview. Chapter 1

Computer Organization

Input/Output Problems. External Devices. Input/Output Module. I/O Steps. I/O Module Function Computer Architecture

Total No. of Questions :09] [Total No. of Pages : 02. II/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC Second Semester CSE/IT DBMS

b) Write basic performance equation.

Lesson Plan for Even semester

DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING QUESTION BANK

UNIT 2 (ECS-10CS72) VTU Question paper solutions

The von Neuman architecture characteristics are: Data and Instruction in same memory, memory contents addressable by location, execution in sequence.

Chapter 4. MARIE: An Introduction to a Simple Computer

Computer Organization ECE514. Chapter 5 Input/Output (9hrs)

systems such as Linux (real time application interface Linux included). The unified 32-

COS 140: Foundations of Computer Science

DHANALAKSHMI SRINIVASAN INSTITUTE OF RESEARCH AND TECHNOLOGY. Department of Computer science and engineering

EE 354 Fall 2015 Lecture 1 Architecture and Introduction

GRE Architecture Session

Transcription:

SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR 603203 DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS LESSON PLAN (207-208) Course / Branch : M.Sc CST Total Hours : 50 Subject Name : Computer Architecture Subject Code : CTC6C Faculty Name : K. Priya lakshmi Designation : Asst.Pressor Semester / Year : EVEN / III : 50 PPT Hours : Minimum Hour per Aim: To study about the nature, structure and functions contemporary computer system. Objectives: To explore the competence changeover the computer system over different generations. To study about system architecture like bus structure and PCI etc. Giving an overview about types memory and their hierarchy. To explain about secondary storage backup technique like RAID In-depth analysis core concepts like instruction fetch and execute, instruction cycle etc. To study about Instruction Pipelining, RISC etc. Text Book(s):. M.M.Mano - Computer System Architecture, 3 rd Edition- PHI, 994. 2. J.P.Hayes Computer System Architecture McGrawHill - 988

-I: Central Processing : General Register and Stack Organization Instruction Formats Addressing Modes Data Transfer and Manipulation Program Control RISC. I General Register Organization i) Control Word ii) Examples Microprocessors T 242-246 2 I Stack Organization i) Register Stack ii) Memory Stack iii) Reverse Polish Notation T 247-254 3 I Instruction Formats i) Three Address Instructions ii) Two Address Instructions T 253-258 4 I Instruction Formats iii) One Address Instructions iv) Zero Address Instructions v) RISC Instructions T 259-260 5 I Addressing Modes T 260-264 6 I Data Transfer & Manipulation i) Data Transfer Instructions ii) DataManipulation iii) Arithmetic Instructions iv) Logical & Bit Instructions v) Shift Instructions T 266-272 7 I 8 I Program Control i) Status Bit Conditions ii) Conditional Branch iii) Subroutine Call & Return Program Control iv) Program Interrupt v) Types Interrupts T 273-278 T 279-28 9 I RISC i) CISC Characteristics ii) RISC Characteristics 0 I Test T 282-285 2

-II: Pipelining Arithmetic, Instruction and RISC Pipelining Vector Processing Array Processors II Parallel Processing T 299-302 2 II Pipelining i) General Considerations T 302-307 3 II Arithmetic Pipeline T 307-30 4 II Instruction Pipeline i) Four Segment Instruction T 30-32 5 II Instruction Pipeline ii) Data Dependency iii) Handling Branch T 33-35 6 II RISC Pipeline i) Three Segment Instruction ii) Delayed Load iii) Delayed Branch T 35-38 7 II Vector Processing i) Vector Operations ii) Matrix Multiplication T 39-32 8 II Vector Processing iii) Memory Interleaving iv) Supercomputers T 324-326 9 II Array Processors i) Attached Array Processor T 326-329 20 II Test 3

-III: Computer Arithmetic Addition and Subtraction Multiplication and Division Algorithms Floating Point and Decimal Arithmetic Operations Addition and Subtraction 2 III 22 III 23 III 24 III 25 III 26 III 27 III 28 III 29 III i) With Signed-Magnitude ii) Hardware Implementation Addition and Subtraction iii) Hardware Algorithm iv) Signed-2 s Complement data Multiplication Algorithm i) Hardware Implementation ii) Hardware Algorithm Multiplication Algorithm iii) Booth Multiplication Alg. iv) Array Multiplier Division Algorithm i) Hardware Implementation ii) Hardware Algorithm iii) Divide Overflow Floating Point Arithmetic Operations i) Basic Considerations ii) Register Configuration iii) Addition & Subtraction Floating Point Arithmetic Operations iv) Multiplication v) Division Decimal Arithmetic Operations i) Addition & Subtraction ii) Multiplication Decimal Arithmetic Operations iii) Division iv) Floating Point Operations 30 III Test T 333-336 T 337-339 T 340-342 T 343-347 T 348-353 T 354-358 T 360-362 T 369-373 T 374-376 4

-IV: Input Output Organization Peripheral devices I/O Interface Asynchronous Data Transfer Modes Transfer Priority Interrupt - Direct Memory Access I/O Processor Serial Communication 3 IV Peripheral Devices T 38-384 32 IV 33 IV 34 IV 35 IV 36 IV 37 IV 38 IV 39 IV Input-Output Interface i) I/O Bus & Interface Modules ii) I/O versus Memory Bus iii) Isolated versus Memory- Mapped I/O Asynchronous Data Transfer i) Strobe Control ii) Handshaking iii) Asynchronous Serial Transfer iv)asynchronous Communication Interface Modes Transfer i) Example Programmed I/O ii) Interrupt-Initiated I/O iii) Stware Considerations Priority Interrupt i) Daisy-Chaining Priority ii) Parallel Priority Interrupt iii) Priority Encoder Priority Interrupt iv) Interrupt Cycle v) Stware Routines vi) Intial and Final Operations Direct Memory Access i) DMA Controller ii) DMA Transfer Input-Output Processor i) CPU-IOP Communication ii) IBM 370 I/O Channel Serial Communication i) Character-Oriented Protocol ii) Transmission Example iii) Data Transparency iv) Bit-Oriented Protocol 40 IV Test T 385-390 T 39-400 T 402-406 T 407-4 T 42-45 T 45-49 T 420-428 T 429-439 5

-V: Memory Organization Memory Hierarchy Main Memory Auxiliary Memory Associative Cache and Virtual Memory Interconnection Structures Interprocessor Arbitration. i)memory Organization 4 V ii)memory Hierarchy T 445-452 a)ram & ROM Chips 42 V 43 V 44 V 45 V 46 V 47 V 48 V 49 V b)memory Address Map Auxiliary Memory i) Magnetic Disk ii) Magnetic Tape Associative Memory i) Hardware Operations ii) Match Logic iii) Read Operation iv) Write Operation Cache Memory i) Associative Mapping ii) Direct Mapping iii) Set-Associative Mapping iv) Writing into Cache v) Cache Initialization Virtual Memory i) Address Space & Memory Space ii) Address Mapping Using Pages Virtual Memory iii) Associative Memory Page iv) Page Replacement Interconnection Structure i) Time-shared Common Bus ii) Multiport Memory iii) Crossbar Switch Interconnection Structure iv) Multistage Switching Network v) Hypercube Interconnection Interprocessor Arbitration i) System Bus ii) Serial Arbitration Procedure iii) Parallel Arbitration Logic 50 V Test T 452-455 T 456-46 T 462-469 T 469-473 T 473-476 T 489-494 T 496-500 T 500-505 * T Text Book / R Book 6