Computer Architecture & Organization (1)

Download as pdf or txt
Download as pdf or txt
You are on page 1of 1

Code: CS20AOE502 R 20

B.Tech III Year I Semester Regular Examinations February - 2023


COMPUTER ARCHITECTURE & ORGANIZATION
(Electronics & Communication Engineering)
Time: 3 hrs. Max Marks: 60
PART-A
(Compulsory Question)
1. Answer the following 05 x 02 = 10 Marks
a) What is a micro-operation? 2M
b) Define control word? 2M
c) What are the two attractive features of Booth’s algorithm? 2M
d) List out various modes of data transfers? 2M
e) List out pipeline hazards? 2M
PART-B
Answer All five Units 05 x 10 = 50 Marks
UNIT-I
2. a) Explain about instruction cycle. 6M
b) Explain the basic computer registers. 4M
OR
3. a) Explain in detail about the various instruction formats. 7M
b) With suitable example, explain assembly language notation 3M
UNIT-II
4. a) Explain Micro instruction format. 5M
b) Explain direct and indirect addressing modes with examples. 5M
OR
5. Draw and Explain the micro programmed control unit with a neat diagram. 10 M
UNIT-III
6. Draw the flowchart for addition and subtraction algorithm and Explain. 10 M
OR
7. Draw and Explain the hardware circuit for Booth’s multiplication with an example. 10 M
UNIT-IV
8. What is use of DMA? Explain about DMA controller with a neat diagram. 10 M
OR
9. Describe virtual-memory address-translation method based on the concept of 10 M
fixed-length Pages with a neat block diagram.
UNIT-V
10. Explain Inter-processor communication and synchronization in a shared 10 M
multiprocessor environment.
OR
11. Describe cache coherence and why it is important in shared memory 10 M
multiprocessor systems? How can the problem be solved with a snoopy cache
controller?

*****

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy