Scribd
Upload
3 views

computer_architecture_questions

The document contains a series of computer architecture questions and answers, covering topics such as pipeline stages, cache memory organizations, and hazards in pipeline architecture. It explains concepts like addressing modes, immediate and register addressing, and includes a design example of a 4-bit carry-look ahead adder. Key points include the performance issues in pipelined processors and the theoretical nature of MISD in computing.

Uploaded by

dxzmanish
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

computer_architecture_questions

The document contains a series of computer architecture questions and answers, covering topics such as pipeline stages, cache memory organizations, and hazards in pipeline architecture. It explains concepts like addressing modes, immediate and register addressing, and includes a design example of a 4-bit carry-look ahead adder. Key points include the performance issues in pipelined processors and the theoretical nature of MISD in computing.

Uploaded by

dxzmanish
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Computer Architecture Questions and Answers

Question 1: Choose the correct option of the following (any seven only):

(a) A pipeline stage


Correct Answer: (iii) Consists of both sequential and combinational circuit
Explanation: A pipeline stage typically consists of both sequential and combinational circuits. Sequential
circuits are used for storage elements like flip-flops, while combinational circuits perform the actual
processing.

(b) Associative cache memory organizations


Correct Answer: (iv) n-way set associative
Explanation: n-way set associative cache is a type of cache organization where each cache line can be
mapped to any of the n sets.

(c) The performance of a pipelined processor suffers if


Correct Answer: (iv) All of these
Explanation: Pipeline performance can suffer due to different delays in pipeline stages, data dependencies
between instructions, and shared hardware resources among stages.

(d) A computer with cache access time of 100ns, main memory access time of 1000ns, and hit ratio of 0.9
Correct Answer: (ii) 200 ns
Explanation: The average memory access time (AMAT) is calculated as:
AMAT = (0.9 × 100ns) + (0.1 × 1000ns) = 190ns (Approx. 200ns).

(e) Which of the following has no practical usage?


Correct Answer: (iii) MISD
Explanation: MISD (Multiple Instruction, Single Data) is a theoretical model of parallel computing that is not
practically used.

(f) A microprogrammed control unit


Correct Answer: (ii) Facilitates easy implementation of new instructions
Explanation: Microprogrammed control units allow easier modification and extension, making it simpler to
implement new instructions.

(g) In memory-mapped I/O


Correct Answer: (i) The I/O devices and the memory share the same address space
Explanation: In memory-mapped I/O, I/O devices are accessed using the same address space as memory.

(h) How many 128x8-bit RAMs are required to design a 32kx32-bit RAM?
Correct Answer: (ii) 1024
Explanation: To design a 32kx32-bit RAM, 1024 units of 128x8-bit RAM are required.

Question 2: What are the hazards in pipeline architecture? Explain its types with suitable examples.

Hazards in Pipeline Architecture:


- Structural Hazards: Occur when hardware cannot support specific operations simultaneously.
- Data Hazards: Occur due to dependencies between instructions (RAW, WAR, WAW).
- Control Hazards: Occur due to branches and jumps in the instruction sequence.

Question 3: What is addressing mode? Why do computers use addressing mode techniques?
Addressing mode specifies how the operand of an instruction is to be interpreted.
Reasons: Flexibility, Efficiency, Simplicity.

Question 4: Explain two modes which do not use address fields.


- Immediate Addressing: The operand value is directly specified in the instruction.
- Register Addressing: The operand is in a register.

Question 5: Design a 4-bit carry-look ahead adder and explain its operation with an example.
Carry-Look Ahead Adder uses Carry Generate (G), Carry Propagate (P), and Carry Out (C_out) to speed up
addition operations.
Example: Adding A = 0111 and B = 0011 results in Sum = 1101.

You might also like