Computer Organization and Architecture - BCS302
Computer Organization and Architecture - BCS302
BTECH
(SEM III) THEORY EXAMINATION 2023-24
COMPUTER ORGANIZATION AND ARCHITECTURE
TIME: 3HRS M.MARKS: 70
Note: 1. Attempt all sections. If require any missing data; then choose suitably.
SECTION A
46
arbitration be implemented in Daisy changing scheme?
_0
b. Show the multiplication process using Booth’s algorithm when the following 7
.1
numbers are multiplied: -
P2
97
(-12) *(-18).
.1
4D
c. What is pipelining? What are the different stages of pipelining? Explain in detail. 7
.5
d. Give classification of memory based on the method of access. Also discuss 7
P2
39
construction and working of magnetic disk and various components of disk access
Q
time.
|1
e. What are the basic differences between interrupt initiated I/O and programmed 7
08
a. Explain in detail the principle of carry looks ahead adder and design 4-bit CLA 7
adder.
1-
1|Page
QP24DP2_032 | 21-03-2024 13:23:08 | 139.5.197.146
Printed Page: 2 of 2
Subject Code: BCS302
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0
BTECH
(SEM III) THEORY EXAMINATION 2023-24
COMPUTER ORGANIZATION AND ARCHITECTURE
TIME: 3HRS M.MARKS: 70
46
handshaking mechanism.
_0
b. Explain the various modes of data transfer and discuss direct memory access mode 7
.1
in detail. Also explain how DMA is superior to other modes.
P2
97
.1
4D
.5
P2
39
Q
|1
08
3:
:2
13
4
02
-2
03
1-
|2
2|Page
QP24DP2_032 | 21-03-2024 13:23:08 | 139.5.197.146