2.2 Quiz

What is the main drawback of a ripple carry adder?

• High power consumption

• Slow carry propagation

• High cost

• High cost

A carry lookahead adder (CLA) improves performance by:

• Adding numbers one bit at a time

• Generating and propagating carry in advance

• Using extra bits for storage

• • Repeating addition multiple times

How many full adders are required in a 4-bit ripple carry adder?

• 1

• 2

• 3

• 4

The 1’s complement of the binary number 1010 is:

• 0101

• 1011

• 1101

• 0110

What happens when you add two negative numbers in 2’s complement representation?

• Result is always positive

• Overflow can occur if the sum exceeds the range

• The answer is incorrect

• The sum remains unchanged

The shift-and-add method for multiplication is similar to:

• Division

• Repeated addition

• Logical shifting

• Subtraction

Booth’s Algorithm is useful because it:

• Speeds up addition

• Reduces the number of required additions/subtractions

• Works only with positive numbers

• Increases multiplication time

The Carry Save Multiplier helps in:

• Speeding up addition of multiple partial products

• Reducing memory usage

• Performing division faster

• • Increasing carry propagation time

In Booth's algorithm, if the current bit pair is 10, what operation is performed?

• Add

• Subtract

• Shift only

• Multiply

Which method is not used for binary multiplication?

• Shift-and-add

• Booth's algorithm

• Carry lookahead multiplication

• Carry save multiplication