In which of the following adder circuits, the carry look ripple delay is eliminated?
A. Half adder
B. Full adder
C. Parallel adder
D. Carry-look-ahead adder
E. None of the above
Answer: Option D
This Question Belongs to Computer Science >> Digital Computer Electronics
Join The Discussion
Comments ( 1 )
Related Questions on Digital Computer Electronics
Conversion of decimal number 6110 to it's binary number equivalent is
A. 1100112
B. 110011102
C. 1111012
D. 111112
E. None of the above
A. switches connected in series
B. switches connected in parallel
C. MOS transistors connected in series
D. All of the above
E. None of the above
Address 200H contains the byte 3FH. What is the decimal equivalent of 3FH
A. 63
B. 32
C. 16
D. 38
E. None of the above
Conversion of an octal number 1128 to hexadecimal number is
A. 4A16
B. 5A16
C. 1516
D. 2016
E. None of the above
1. Half Adder is a combinational circuit that performs the addition of two bits. sum= A X-OR B, Carry=AB.
2. Full Adder is a combinational circuit that performs the addition of three bits. sum= A X-OR B X-OR Cin, Carry=(A X-OR B)Cin+ AB.
3. Parallel adder is a digital circuit that adds two binary numbers in parallel. 4-bit parallel adder. An n-bit parallel requires n-full adders. the output carry from one package must be connected to the input carry of the one with next higher-order bits. the 4-bit full adder is a typical example of MSI function. also called ripple carry adder.
4. this speeding up the addition process by eliminating the ripple carry delay.