Advanced Computer Architecture MCQs with Answers
Practice important Advanced Computer Architecture MCQs with answers and explanations.
Multiple Choice Questions
Q791: Which method of multiplication uses a combination of parallel and sequential hardware?
- A: Parallel Array Multiplier
- B: Series Parallel Multiplier
- C: Binary Multiplier
- D: Fixed Multiplier
View Answer
B
Q792: How is the sign of a product determined in signed multiplication?
- A: By checking the sign of the multiplier only
- B: By checking the sign of both the multiplier and multiplicand
- C: By the magnitude of the numbers
- D: By the number of bits used
View Answer
B
Q793: What is the first step in the Booth Recoding process?
- A: Start with the Most Significant Bit (MSB)
- B: Start with the Least Significant Bit (LSB)
- C: Initialize the quotient counter bit to 0
- D: Clear the dividend register
View Answer
B
Q794: Booth Recoding can potentially increase the number of _______ due to isolated 1s.
- A: Multiplications
- B: Additions
- C: Subtractions
- D: Divisions
View Answer
B
Q795: Which type of division involves clearing the upper half of the dividend register and putting the dividend in the lower half?
- A: Integer division
- B: Fractional division
- C: Binary division
- D: Octal division
View Answer
A
Q796: What is the quotient in binary when 4710 is divided by 510?
- A: 1
- B: 1001
- C: 10
- D: 1000
View Answer
B
Q797: The result of integer division yields the quotient and the remainder in _______.
- A: Upper half of dividend register
- B: Lower half of dividend register
- C: Quotient register
- D: Condition register
View Answer
A
Q798: The condition codes in branch architecture are computed by the _______.
- A: ALU
- B: Multiplier
- C: Adder
- D: Divisor
View Answer
A
Q799: The process of division that reports an overflow involves _______.
- A: Clearing the upper half of the dividend
- B: Clearing the lower half of the dividend
- C: Initializing the quotient counter bit
- D: Clearing both halves of the dividend
View Answer
B
Q800: The complexity of a Ripple Carry Adder is _______ compared to a Carry Lookahead Adder.
- A: m
- B: log(m)
- C: ripple carry complex
- D: ripple carry simple
View Answer
C