Official PYQ · 2004Q62Computer ArithmeticMCQ1 mark

GATE CS 2004 Q62 — Computer Arithmetic

A 4-bit carry look ahead adder, which adds two 4-bit numbers, is designed using AND, OR, NOT, NAND, NOR gates only. Assuming that all the inputs are available in both complemented and uncomplemented forms and the delay of each gate is one time unit, what is the overall propagation delay of the adder? Assume that the carry network has been implemented using two-level AND-OR logic.

View answer

Answer: B

Worked explanation not available yet.

Free practice · Your answers on this page are not saved.

Published 10 Oct 2026

Report a correction

GATE CS · 2025Computer Arithmetic
The following two signed $2$ 's complement numbers (multiplicand M and multiplier Q) are being multiplied using Booth's algorithm: M: $1100110111101101$ and Q: $1010010010101010$ The total number of addition and subtraction operations to be performed is_____________. (Answer in integer)
NAT · 1 mark
GATE CS · 2016Computer Arithmetic
Consider a carry look ahead adder for adding two $n$ -bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is
MCQ · 1 mark
GATE CS · 2016Computer Arithmetic
Consider an eight-bit ripple-carry adder for computing the sum of $A$ and $B$ , where $A$ and $B$ are integers represented in $2$ 's complement form. If the decimal value of $A$ is one, the decimal value of $B$ that leads to the longest latency for the sum to stabilize is ___________
NAT · 1 mark
GATE CS · 2015Computer Arithmetic
A half adder is implemented with XOR and AND gates. A full adder is implemented with two half adders and one OR gate. The propagation delay of an XOR gate is twice that of an AND/OR gate. The propagation delay of an AND/OR gate is $1.2$ microseconds. A $4$ -bit-ripple-carry binary adder is implemented by using four full adders. The total propagation time …
NAT · 1 mark
GATE CS · 2007Computer Arithmetic
In a look-ahead carry generator, the carry generate function $G_i$ and the carry propagate function $P_i$ for inputs $A_i$ and $B_i$ are given by: $P_i = A_i \oplus B_i \text{ and }G_i = A_iB_i$ The expressions for the sum bit $S_i$ and the carry bit $C_{i+1}$ of the look ahead carry adder are given by: …
MCQ · 1 mark
GATE CS · 2006Computer Arithmetic
Given two three bit numbers $a_{2}a_{1}a_{0}$ and $b_{2}b_{1}b_{0}$ and $c$ the carry in, the function that represents the carry generate function when these two numbers are added is:
MCQ · 1 mark

Browse this topic

More Computer Arithmetic questions

GATE CS 2004 Q62 — Computer Arithmetic

Related questions