Scribd
Upload
15 views2 pages

Wa0003.

The document is a question bank for the course CST 202 Computer Organization and Architecture, covering various topics related to computer organization, pipelining, and multiplication algorithms. It includes questions categorized into two parts, with Part A containing both 3-mark and 8-mark questions focusing on concepts like restoring division, pipeline hazards, and Booth's algorithm. The questions are aligned with specific course outcomes and Bloom's taxonomy levels.

Uploaded by

georgyinhjbvg
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
15 views2 pages

Wa0003.

The document is a question bank for the course CST 202 Computer Organization and Architecture, covering various topics related to computer organization, pipelining, and multiplication algorithms. It includes questions categorized into two parts, with Part A containing both 3-mark and 8-mark questions focusing on concepts like restoring division, pipeline hazards, and Booth's algorithm. The questions are aligned with specific course outcomes and Bloom's taxonomy levels.

Uploaded by

georgyinhjbvg
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

Course Code & Name: CST 202 Computer Organization and Architecture

Semester & Branch: S4 CSE / S4 AI / S4 CSOT

Slot: B

Module 3 Question Bank

PART A (3 MARKS EACH)

Q. Questions CO Bloom’s
No. Level

1 Explain the steps involved in restoring division. CO5 L2

2 Describe the instruction pipeline. CO1 L2

3 Illustrate divide overflow condition in restoring division with help of an CO5 L3


example

4 Differentiate between unifunction and multifunction pipelines. CO1 L2

5 Differentiate between instruction and arithmetic pipelines. CO1 L2

6 Write a note on data hazard detection resolution. CO1 L1

7 Show how the multiplication of 1101 and 1011 is performed by a sequential CO5 L3
circuit multiplier.

8 Differentiate between static and dynamic pipelines CO1 L2

9 Explain the role of cache memory in pipelining. CO1 L2

10 Consider the binary numbers in the following addition and subtraction CO5 L3
problems to be signed ,6 bit values in the 2’s complement
representation.Perform the operations indicated ,specify whether or not
arithmetic overflow occurs and check the answers by converting operands
and results to decimal,sign magnitude representations.
(a) 010110 + (b) 101011 + (c ) 010110 -
001001 100101 011111

11 Explain RAW,WAR and WAW data hazards with the help of an example C01 L2

12 Explain the algorithm for sequential circuit multiplier CO5 L3

13 Compare the execution speed in pipelined and non pipelined circuits CO1 L2

14 Identify the hazard if (a) first instruction (I) is store type and 2nd instruction CO1 L2
(J) is arithmetic and load type (b) I is branch type and J is arithmetic and
load type (c ) I is conditional branch and J is branch type

15 Explain features of booth algorithm CO5 L3

PART A (8 MARKS EACH)

Q. Questions CO Bloom’s
No. Level

1 a) Draw the flowchart of Booth's multiplication algorithm and multiply CO5 L3


-9 X -13 (5) L3
b) Design and draw the block diagram for a 3 by 2 array multiplier (3)

2 a) List and explain the different pipeline hazards and their possible L2
solutions. CO1 L2

3 a) Briefly describe the following with reference to pipelining: i) Clock L2


period ii) Speedup iii) Efficiency iv) Throughput CO1 L2
b) Explain arithmetic and instruction pipelining

4 a) Illustrate the restoring division method with help of a flowchart and CO5, L3
an example. CO1 L2
b) Summarize the different techniques used for pipeline hazard
resolution.

5 (a)Identify the various types of hazards occurring during the execution CO1 L2
of the following program in a pipelined system. Where the pipeline
consists of five stages: opcode fetch , instruction decode, operand
fetch, execution, and store the result. All stages take equal time
duration
MOV [R1],[R2] (6)
MOV R3,[R1]
SUB R2,R3
ADD R1,R3
CALL 5000
MOV R2,R3 CO5 L3
(b)Draw the flowchart of Booth's multiplication algorithm and multiply
-5 X -4 using booth's algorithm? (8)

6 (a)Write notes on processor pipelining with suitable diagram (7) CO1 L2


(b) Multiply 13 * -6 using Booth’s multiplication (7) CO5 L3

You might also like