0% found this document useful (0 votes)
54 views2 pages

2021 Cao

This document contains questions for a B.Tech theory examination in Computer Architecture and Organization. It has 7 sections with a total of 100 marks. Section A contains 10 short answer questions worth 2 marks each for a total of 20 marks. Section B contains 5 subquestions worth 10 marks each, requiring students to attempt 3. Section C contains 2 subquestions worth 10 marks each, requiring students to attempt 1. Sections D, E, F and G follow the same format as Section C. The questions cover topics related to computer design, components, instruction sets, pipelining, and memory organization.

Uploaded by

Sudeep Shukla
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
54 views2 pages

2021 Cao

This document contains questions for a B.Tech theory examination in Computer Architecture and Organization. It has 7 sections with a total of 100 marks. Section A contains 10 short answer questions worth 2 marks each for a total of 20 marks. Section B contains 5 subquestions worth 10 marks each, requiring students to attempt 3. Section C contains 2 subquestions worth 10 marks each, requiring students to attempt 1. Sections D, E, F and G follow the same format as Section C. The questions cover topics related to computer design, components, instruction sets, pipelining, and memory organization.

Uploaded by

Sudeep Shukla
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Printed Page: 1 of 2 

Subject Code: KEC051


0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0
 
B. TECH
(SEM-V) THEORY EXAMINATION 2020-21
COMPUTER ARCHITECTURE AND ORGANIZATION
Time: 3 Hours Total Marks: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
SECTION A

1. Attempt all questions in brief. 2 x 10 = 20


Q no. Question Marks CO
a. Discuss the design levels in the design of computer system. 2 1
b. Discuss the generic block representation of a register level component. 2 1
c. Differentiate between memory-mapped IO & IO-mapped IO. 2 2
d. Categorize various addressing modes. 2 2
e. Tell how normalized number are represented according to IEEE? 2 3
f. Define Hardwired control. 2 3
g. "Hardwired control unit is faster than micro programmed control unit." 2 4
Justify this statement.
h. Justify that the theoretical maximum speedup that a pipeline can provide 2 4
is equal to number of segments in the pipeline.

P
i. Illustrate the concept of locality of reference. 2 5
4Q

0
j. Outline how the performance of cache memory is measured? 2 5

10
16

SECTION B

3.
0E

2. Attempt any three of the following:

.1
P2

12
Q no. Question Marks CO
_Q

a. Design a two-level combinational circuit in the sum-of-products style 10 1


that compares the 3-bit sum of two 2-bit binary numbers. The circuit is
.1
03
TU

to be implemented using AND and OR gates.


|1

b. Illustrate a small accumulator-based CPU using suitable block diagram 10 2


AK

in detail.
2
:4

c. Discuss the Datapath of the Twos complement multiplier in detail. 10 3


05

d. Categorize the various microoperations carried out by CPU with 10 4


suitable example each.
:
09

e. A Computer uses a memory unit with 256K words of 32 bits each. A 10 5


binary instruction code is stored in one word of memory. The instruction
1

has four parts: an indirect bit, an operation code, a register code part to
02

specify one of 64 registers and an address part.


-2

(i) Calculate how many bits are there in the opcode, the register
ar

code part and the address part?


M

(ii) Illustrate the instruction word format & indicate the number of
3-

bits in each part.


|0

SECTION C
3. Attempt any one part of the following:
Q no. Question Marks CO
a. Describe the various Register level components with suitable example. 10 1
b. Design a pipelined 4-bit stream serial adder at register level. 10 1

1 | P a g e  
 
AKTU_QP20E164QP | 03-Mar-2021 09:05:42 | 103.112.13.100
Printed Page: 2 of 2 
Subject Code: KEC051
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0
 
4. Attempt any one part of the following:
Q no. Question Marks CO
a. Derive the correct floating representation for the decimal numbers +3.25 10 2
and -3.25 using the 32-bit IEEE 754 floating-point standard.
b. Describe the detailed general register organization of a CPU using block 10 2
diagram.
5. Attempt any one part of the following:
Q no. Question Marks CO
a. Discuss Booth’s algorithm with its flow chart. Multiply (-8) and (+14) 10 3
using Booth’s algorithm.
b. Illustrate the data path of a sequential n-bit binary adder in detail. 10 3
6. Attempt any one part of the following:
Q no. Question Marks CO
a. Draw a flowchart for adding and subtracting two fixed point binary 10 4
numbers where negative numbers are signed 1’s complement
presentation.
b. Formulate the four-segment instruction pipeline for a computer. Specify 10 4
the operation to be performed in each segment.

P
7. Attempt any one part of the following:
4Q

0
Q no. Question Marks CO

10
16

a. RAM chip 4096 X 8 bits has two enable lines. How many pins are 10 5

3.
0E

needed for the integrated circuits package? Draw a block diagram and

.1
label all input and outputs of the RAM. Outline the main features of
P2

12
random-access memory.
_Q

.1
b. Describe the various types of mapping techniques in cache memory 10 5
organization. Illustrate any two techniques with suitable diagram.
03
TU

|1
AK

 
2
:4

 
05

 
:
09

 
1
02
-2
ar
M
3-
|0

2 | P a g e  
 
AKTU_QP20E164QP | 03-Mar-2021 09:05:42 | 103.112.13.100

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