Download Model question papers & previous years question papers

Posted Date: 09 May 2016      Posted By:: Krishna Teja Yeluripati    Member Level: Gold  Points: 3 (Rs. 3)

2015 B Tech Computer Science and Engineering B.Tech - CSE - Question Paper - May 2015 - Computer Organization (CO) - CS223 - Acharya Nagarjuna University Question paper

Course: B Tech Computer Science and Engineering   University/board: Acharya Nagarjuna University

Here is one of the previous question papers of Acharya Nagarjuna University - B.Tech - CSE - Computer Organization (CO) - CS223. This is the original question paper of the exam conducted to II/IV B.Tech - 2nd Semester students by Acharya Nagarjuna University. If you are looking for this paper, do not hesitate to download and use it for your upcoming exams.

[Total No. of Questions : 09]

CS/IT 223 (CR)

II/IV B.Tech Degree Examinations, April - May 2015

Second Semester


Computer Organization

Time : 3 hours

Maximum Marks : 70

Answer question No.1 Compulsory

Answer ONE question from each Unit

1. Briefly explain following [7 x 2 = 14M]
a) Register and its purpose.
b) Purpose of Accumulator.
c) Purpose of control unit.
d) Uses of Associative memory.
e) Locality of reference.
f) Mapping micro-operation to a micro-instruction.
g) Serial communication.

UNIT - I [1 x 14 = 14M]

2. a) What are the different computer registers available explaining the purpose of each.
2. b) What are the register transfer logic languages? Explain few of the RTL statement for branching with their actual functioning. (OR)
3. Design a circuit to implement the following RTL instructions. Mention about control logic. Assume A,B are 4-bit registers using JK flip-flops.
A < A + B                    B < A + B

UNIT - II [1 x 14 = 14M]

4. Explain general register and stack organization and distinguish them. (OR)
5. a) Explain the design of control unit.
5. b) Distinguish the characteristics of RISC and CISC.

UNIT - III [1 x 14 = 14M]

6. a) What is overflow and underflow. What is the reason? If the computer is considered as infinite system do we still have these problems?
6. b) Explain division algorithm with a suitable example. (OR)
7. a) Explain Cache memory organization and its importance.
7. b) What is virtual memory technique? Explain different virtual memory techniques with suitable example illustrating their importance.

UNIT - IV [1 x 14 = 14M]

8. a) What is daisy chaining? Explain how daisy chaining is implemented.
8. b) What are the different kinds of I/O communication techniques? What are the relative advantages and disadvantages? Explain. (OR)
9. a) What is parallel priority interrupt method? Explain with neat sketch.
9. b) What is Direct Memory Access? Explain working of DMA and different kinds of DMA transfers.

Return to question paper search

Next Question Paper: B.Tech - CSE - Question Paper - May 2015 - CS224 - Database Management Systems (DBMS) - Acharya Nagarjuna University

Previous Question Paper: B.Tech - CSE - Environmental Science (ES) - CS222 - May 2015 - Question Paper - Acharya Nagarjuna University

Related Question Papers:

  • B.Tech - CSE - CS315 - Design & Analysis of Algorithms (DAA) - November 2015 - Question Paper - Acharya Nagarjuna University

  • B.Tech - CSE - Software Engineering (SE) - CS316 - Question Paper - November 2015 - Acharya Nagarjuna University

  • Acharya Nagarjuna University, B.A. (Economics, History, Sociology) - II YEAR , MAY 2015 Question Paper (Distance Mode)

  • Acharya Nagarjuna University, B.A. (Economics, History, Sociology) - I YEAR , MAY 2015 Question Paper (Distance Mode)

  • Acharya Nagarjuna University, B.A. (Economics, Public Administration, Sociology) - III YEAR , May 2015 Question Paper (Distance Mode)

  • 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.

    Awards & Gifts
    Top Contributors
    TodayLast 7 Daysmore...

    ISC Technologies, Kochi - India. © All Rights Reserved.