Department of Computer Science and Engineering
Academic Year: 2026-27 (Odd) FORM -3.4
Question Bank BIoE/Dept./RBT/2026-27/REV 00
CW Computer Organization and Architecture
Course Code 252 Course Name
01
B.T IT Year/Semester II/03
Degree Programme
ech
Course in-charge Jeba Gifty S
Unit 2 - Arithmetic for Computers
Arithmetic for Computers: Integer Arithmetic, Binary Parallel Adder, Carry Lookahead Adder,
Carry Save Adder, Fast Adders, Binary Multiplication, Booth’s Algorithm, Bit Pair Recoding,
Binary Division, Restoring and Non-Restoring Division, Floating Point Numbers (Single and
Double Precision), Floating Point Representation, Arithmetic Operations on Floating Point
Numbers, ALU Design, Parallelism and Computer Arithmetic.
Q No. Questions RBT Level
Integer arithmetic in computers is mainly performed using:
A) Decimal numbers
B) Binary numbers Remember
1
C) Octal numbers (K1)
D) Hexadecimal numbers
Answer: B) Binary numbers
The Arithmetic Logic Unit (ALU) performs:
A) Input operations
B) Arithmetic and logical operations Remember
2
C) Memory operations (K1)
D) Output operations
Answer: B) Arithmetic and logical operations
A Binary Parallel Adder is constructed using:
A) Half Adders only
B) Full Adders Remember
3
C) Decoders (K1)
D) Multiplexers
Answer: B) Full Adders
A Full Adder has how many inputs?
A) 2
B) 3 Remember
4
C) 4 (K1)
D) 5
Answer: B) 3
The major drawback of a Ripple Carry Adder is:
A) High power consumption
B) Carry propagation delay Understand
5
C) Large memory requirement (K2)
D) High cost
Answer: B) Carry propagation delay
Carry Lookahead Adder improves speed by:
A) Increasing clock frequency
B) Predicting carry signals in advance Understand
6
C) Using more memory (K2)
D) Reducing word size
Answer: B) Predicting carry signals in advance
In a Carry Lookahead Adder, Generate signal is represented by:
A) G = A + B
B) G = A × B Remember
7
C) G = A – B (K1)
D) G = A/B
Answer: B) G = A × B
The Propagate signal in Carry Lookahead Adder is:
A) P = A + B
B) P = A × B Remember
8
C) P = A – B (K1)
D) P = A/B
Answer: A) P = A + B
Carry Save Adder is mainly used in:
A) Division
B) Multiplication Understand
9
C) Address calculation (K2)
D) Memory access
Answer: B) Multiplication
Carry Save Adders reduce:
A) Memory size
B) Carry propagation delay Understand
10
C) CPU clock speed (K2)
D) Number of registers
Answer: B) Carry propagation delay
Fast adders are designed to:
A) Increase storage
B) Reduce addition delay Remember
11
C) Increase instruction length (K1)
D) Reduce memory size
Answer: B) Reduce addition delay
Binary multiplication is performed using:
A) Repeated subtraction
B) Shift and Add operations Understand
12
C) Logical AND only (K2)
D) Division
Answer: B) Shift and Add operations
Booth's Algorithm is mainly used for:
A) Floating point addition
B) Signed binary multiplication Remember
13
C) Binary division (K1)
D) Address generation
Answer: B) Signed binary multiplication
14 Booth's Algorithm is efficient for numbers containing: Understand
A) Consecutive 1's (K2)
B) Only 0's
C) Alternating bits
D) Decimal digits
Answer: A) Consecutive 1's
Bit Pair Recoding is an improvement of:
A) Binary Division
B) Booth's Algorithm Remember
15
C) CLA (K1)
D) CSA
Answer: B) Booth's Algorithm
Bit Pair Recoding reduces:
A) Partial products
B) Memory size Understand
16
C) Register count (K2)
D) Instruction size
Answer: A) Partial products
Binary Division produces:
A) Sum and Carry
B) Quotient and Remainder Remember
17
C) Product only (K1)
D) Carry only
Answer: B) Quotient and Remainder
Restoring Division restores the:
A) Quotient
B) Partial Remainder Remember
18
C) Dividend (K1)
D) Divisor
Answer: B) Partial Remainder
Non-Restoring Division avoids:
A) Addition
B) Restoration step Understand
19
C) Multiplication (K2)
D) Shifting
Answer: B) Restoration step
Non-Restoring Division is generally:
A) Slower than restoring division
B) Faster than restoring division Understand
20
C) Less accurate (K2)
D) More complex only
Answer: B) Faster than restoring division
PART – B
What is Integer Arithmetic?Answer: Integer arithmetic refers to
arithmetic operations performed on binary integers. The basic operations Remember
1
are addition, subtraction, multiplication, and division, which are executed (K1)
by the Arithmetic Logic Unit (ALU).
What is a Binary Parallel Adder?Answer: A Binary Parallel Adder is a
combinational circuit that adds two binary numbers simultaneously. It Understand
2
consists of multiple full adders connected in parallel, with each full adder (K2)
adding one bit and its corresponding carry.
What are the advantages of a Carry Lookahead Adder (CLA)?
Answer: The advantages of a Carry Lookahead Adder are: (i) Reduces
Understand
3 carry propagation delay, (ii) Provides faster addition, (iii) Improves
(K2)
processor performance, and (iv) Suitable for high-speed arithmetic
circuits.
What is a Carry Save Adder (CSA)? State its [Link]: A
Carry Save Adder is an adder that adds three or more binary numbers Remember
4
without immediately propagating the carry. It is mainly used in binary (K1)
multipliers and high-speed digital signal processors.
What is Booth's Algorithm? Mention its [Link]: Booth's
Algorithm is an efficient algorithm for multiplying signed binary numbers
Understand
5 using two's complement representation. Its advantages are reduced
(K2)
number of addition/subtraction operations and efficient handling of
consecutive 1's in the multiplier.
Differentiate between Restoring and Non-Restoring [Link]:
In Restoring Division, the partial remainder is restored whenever it Understand
6
becomes negative, whereas in Non-Restoring Division, the restoration step (K2)
is avoided, making it faster and requiring fewer operations.
What are Floating Point Numbers?Answer: Floating point numbers are
used to represent real numbers with fractional parts. According to IEEE Remember
7
754, a floating-point number consists of three fields: Sign bit, Exponent, (K1)
and Mantissa (Significand).
Differentiate between Single Precision and Double Precision Floating
Point [Link]: Single precision uses 32 bits (1 sign bit, 8
Understand
8 exponent bits, and 23 mantissa bits), whereas double precision uses 64 bits
(K2)
(1 sign bit, 11 exponent bits, and 52 mantissa bits), providing greater
accuracy and range.
What are the functions of an Arithmetic Logic Unit (ALU)?Answer:
The ALU performs arithmetic operations (addition, subtraction, Remember
9
multiplication, division), logical operations (AND, OR, XOR, NOT), (K1)
comparison operations, and shift operations.
What is Parallelism in Computer Arithmetic? State its
[Link]: Parallelism is the technique of performing multiple
Understand
10 arithmetic operations simultaneously using multiple processing units. Its
(K2)
advantages include increased execution speed, improved throughput, and
better processor performance.
PART – C
Explain the design and operation of a Binary Parallel Adder with a neat
diagram. Discuss the working of Ripple Carry Adder and Carry Understand
1
Lookahead Adder, highlighting the advantages of Carry Lookahead Adder (K2)
over Ripple Carry Adder.
Explain Booth's Algorithm for signed binary multiplication with a suitable
Understand
2 example. Discuss the concept of Bit Pair Recoding and explain how it
(K2)
improves multiplication performance.
Explain the Restoring and Non-Restoring Division algorithms with
Understand
3 suitable examples. Compare both algorithms based on their operation,
(K2)
speed, and efficiency.
Explain the IEEE 754 floating-point representation in detail. Discuss the
Understand
4 single-precision and double-precision formats and explain the arithmetic
(K2)
operations performed on floating-point numbers.
Explain the design and functions of an Arithmetic Logic Unit (ALU).
Discuss the role of parallelism in computer arithmetic and explain how Understand
5
parallel processing improves the performance of modern computer (K2)
systems.
Course in-charge HoD