Learn more about IndiaStudyChannel
Install Alexa Toolbar
and earn more...
 
Communities Members BookmarksPolls Fresher Jobs Funny Photos B.Tech Projects New Member FAQ  



My Profile
Active Members
TodayLast 7 Days more...



Awards & Gifts
Online Exams

Fresher Jobs


Our fresher job section is exclusively for fresh graduates! Find jobs for freshers in major Indian cities including Bangalore, Chennai, Hyderabad, Pune or Kochi

Resources


Find educational articles, blogs, discussion threads and other resources.

Colleges


Find details about any college in India or search for courses.

website counter




Download Model question papers & previous years question papers

Posted By: b.thirumaya prabhu       Member Level: Gold       Posted Date: 22 May 2008

2007 Anna University B.E Electronics and Communication CS 1251 - COMPUTER ARCHITECTURE Question paper07 Question paper



Course: B.E Electronics and Communication   University: Anna University




B.E/B.Tech. DEGREE EXAMINATION, APRIL/MAY 2008.
Sixth Semester
(Regulation 2004)
Electronics and Communication Engineering
CS 1251 —— COMPUTER ARCHITECTURE
(Common to B.E. (Part-Time) Fifth Semester Regulation 2005)

Time : Three hours Maximum : 100 marks
Answer ALL questions.


PART A — (10 x 2 = 20 marks)
1. Registers R1 and R2 of a computer contain the decimal values 1200 and 4600. What is the effective address of the memory operand in each of the following instructions?
(a) Load 20(R1), R5
(b) Add -(R2), R5.

2. What is the use of Condition Code register?

3. What do you mean by End—around carry correction?

4. Discuss the role of Booth algorithm in the design of Fast Multipliers.

5. Why is the Wait—for—Memory-Function-Completed step needed when reading from or writing to the main memory?

6. Write the sequence of control steps required for three bus structure for the following instruction:
Add R4, R5, R6.

7. Define Locality of Reference.

8. Give the features of a ROM cell.

9. What is the difference between a Subroutine and an Interrupt — service routine?

10. Define Bus Arbitration.

PART B —— (5 x 16 = 80 marks)
11. (a) Explain in detail the different Instruction types and Instruction Sequencing.
Or
(b) Explain the different types of Addressing modes with suitable examples.

12. (a) Illustrate Booth Algorithm with an example.

Or

(b) Design a 4-bit Carry-Lookahead Adder.

13. (a) Write a Microroutine for the instruction, Add (Rsrc) + Rdst where the source and destination operands are specified in indexed and register addressing modes, respectively.
Or
(b) Explain Microprogrammed Control Unit. What are the advantages and disadvantages of it.

14. (a) Define Cache Mapping Functions. Explain the methods.
Or
(b) How does a virtual address gets translated into a physical address. Explain in detail with a neat diagram. Explain the use of TLB.

15. (a) Explain the use of DMA Controllers in a computer system with a neat diagram.
Or
(b) Explain Handshake protocol, Depict clearly how it controls data transfer
during an input operation.





Return to question paper search

Next Question Paper: PSYCHOPATHOLOGY AND MENTAL HYGIENE

Previous Question Paper: General Principles of Contract Law

Related Question Papers:


  • CH 245 — INSTRUMENTAL METHODS OF ANALYSIS


  • MV 103 APPLIED PHYSICS -I


  • semester


  • MV 203-APPLIED PHYSICS II


  • CS 1202-DIGITAL PRINCIPLES AND SYSTEM DESIGN


  • Categories


    Submit Previous Years University Question Papers and make money from adsense revenue sharing program

    Are you preparing for a university examination? Download model question papers and practise before you write the exam.

    Watch TV Channels



    Contact Us    Editors    Privacy Policy    Terms Of Use   

    ISC Technologies. 2006 - 2008 All Rights Reserved.