CS6303 Computer Architecture

CS6303 Computer Architecture Nov/Dec 2016 Anna University Question Paper

CS6303 Computer Architecture Nov/Dec 2016 Anna University Question paper Nov/Dec 2016 Here you can get Previous Year Question paper Recent Question Papers 2marks syllabus 2013 regulation etc.  To Score more in your semester exams Get best score in your semester exams without any struggle. Just refer the previous year questions from our website. At the last time of examination you won’t be able to refer the whole book. We know students find it difficult to score better in university exams so we make it easy to assemble, use, and even reuse the frequently asked questions. We are a library of questions which are asked frequently, all you need to do is to refer our website and get the CS6303 Computer Architecture Anna university Question paper Nov/Dec 2016

Students who are already keeping good score should use previous questions only for reference. It may help you to get full score. For such students a small advice is that, after studying the entire portions, one can use these recent year questions for revision. Our recentquestionpaper.com is meant for practicing and revising what one has studied and for you to assure pass mark who find it difficult to study the full portion. It helps you to know the range of questions asked in semester exam.

Department of Computer Science and Engineering

Sub. Name: Computer Architecture                                                           Sub.Code: CS6303

Max.Marks: 100                                                                                         Time: 180 min

Department: Computer Science and Engineering                             Sem/Year: III/II       Date:

Model Exam I

Answer All Questions.

PART- A           (10 X 2 = 20)

1.      Define Amdahl’s Law.

2.      Explain Relative addressing mode with an example.

3.      Explain the little endian arrangement.

4.      Define DMA.

5.      Explain about speculation.

6.      Define exception.

7.      State the Flynn’s Classification.

8.      Define multithreading.

9.      Explain Programmed I/O and Interrupt I/O.

10. Explain the purpose of Dirty/Modified bit in Cache memory.

PART- B           (5 X 13 = 65)

11. a) Explain about registers,data types,addressing modes and instruction format of MIPS architecture.(13)

(Or)

b) Explain the components of a computer systems and Eight ideas in details.(13)

12. a) Explain the floating point addition algorithm in details with suitable examples. (13)

(Or)

b) Explain the floating point multiplication algorithm in details with suitable examples. (13)

13.a) Explain the different types of hazards and how to handle those hazards.(13)

(or)

b) Explain in detail to build a simple data path with example(13)

14. a) Explain in detail about Flynn’s Classification(13)

(or)

b) Explain in detail about hardware multithreading and its types.(13)

15. a) Explain in detail about the DMA and it bus arbitrary(13)

(or)

b) Explain in detail about cache basics and how to measure its performance.(13)

Part – C   (1x15=15 )

16.a) Explain in detail about i7 processor and its components(15)

(or)

b) Explain in detail about advance IO device topologies in market(15)