Recent questions tagged adder

1 1 vote
1 answers 1 answer
893
893 views
How many inputs & outputs does a full adder have?$3, 2$$2, 3$$3, 3$$2, 2$
3 3 votes
1 answers 1 answer
1.4k
1.4k views
A $4-bit$ carry-lookahead adder adds two $4-bit$ numbers. The adder is designed only using $AND, OR, NOT, NAND $ and $NOR$ gates. We assume that all the inputs are availa...
1 1 vote
1 1 answer
1.8k
1.8k views
20 20 votes
2 answers 2 answers
7.3k
7.3k views
Using binary full adders and other logic gates (if necessary), design an adder for adding $4$-bit number (including sign) in $2’s$ complement notation.
0 0 votes
0 0 answers
1.1k
1.1k views
Can anyone explain me this theory with an example(from the third line)...??
0 0 votes
1 1 answer
1.3k
1.3k views
Which of the following statements is/are true?S1: Carry-lookahead adder is faster compared to a ripple carry adder.S2: The cost is higher for a carry lookahead adder comp...
1 1 vote
1 answers 1 answer
493
493 views
Which of the following combinations is sufficient to build a half adder?EX-OR gate and NOR gate.EX-OR gate and OR gate.EX-OR gate and AND gate.Four NAND gates.
45 45 votes
1 answers 1 answer
10.8k
10.8k views
Fill in the blanks:In the two bit full-adder/subtractor unit shown in below figure, when the switch is in position $2$ ___________ using _________ arithmetic.
1 1 vote
0 0 answers
1.0k
1.0k views
Design an $8 \times 8$ multiplier using five $4$-bits adders and $4$ ROM's each programmed to realise $4 \times 4$ multiplier.
1 1 vote
0 0 answers
470
470 views
Can anyone explained me how gate delay is calculated in this link http://iitkgp.vlab.co.in/?sub=38&brch=120&sim=483&cnt=664According me for 32 bit ripple carry adder,gate...
1 1 vote
3 3 answers
2.1k
2.1k views
How many gate delays are needed to add for increase of level in multilevel carry look ahead adder?(A) 2 gate delays(B) 3 gate delays(C) 4 gate delays(D) 5 gate delaysI re...
2 2 votes
1 answers 1 answer
1.4k
1.4k views
Match the following :$\begin{array}{clcl} & \textbf{List-I} && \textbf{List-II} \\ \text{a.} & \text{Controlled inverter} & \text{i.} & \text{a circuit that can add 3 bi...
1 1 vote
2 2 answers
884
884 views
Total number of full and half-adders require to add 32 bit numbers is16 half adders , 16 full adders1 half-adders , 31 full-adders32 half-adders, 0 full-adders16 half-add...
8 8 votes
2 2 answers
5.4k
5.4k views
We want to multiply two 32 bit unsigned numbers 70E5F867 * EFB70E1E. . how many add operation is needed in ADD-shift and Booth method? Any idea how I can solve this? the ...
2 2 votes
3 3 answers
2.6k
2.6k views
Which of the following statements are true ?A circuit that adds two bits, producing a sum bit and carry bit is called half adder.A circuit that adds two bits, producing a...
2 2 votes
5 answers 5 answers
7.4k
7.4k views
The $\text{BCD}$ adder to add two decimal digits needs minimum of$6$ full adders and $2$ half adders$5$ full adders and $3$ half adders$4$ full adders and $3$ half adders...
5 5 votes
2 answers 2 answers
5.3k
5.3k views
For a binary half-subtractor having two inputs $\text{A}$ and $\text{B}$, the correct set of logical outputs $\text{D}\;(=\text{A}\;\text{minus} \;\text{B})$ and $\text{X...
9 9 votes
2 answers 2 answers
8.0k
8.0k views
The circuit shown in the given figure is afull adderfull subtractershift registerdecade counter
1 1 vote
0 0 answers
869
869 views
The CPU of a computer has a ripple-carry implementation of a $2$’s complement adder that takes two $8$ – bit integers $A = a_7a_6 \dots a_0$ and $B = b_7b_6 \dots b_0$ as...
112 112 votes
9 answers 9 answers
47.1k
47.1k views
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$\Theta (1)$$\...
105 105 votes
9 answers 9 answers
34.0k
34.0k views
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 o...
0 0 votes
1 1 answer
3.0k
3.0k views
I am unable to prove it. Please explain
10 10 votes
5 answers 5 answers
12.8k
12.8k views
If half adders and full adders are implements using gates, then for the addition of two $17$ bit numbers (using minimum gates) the number of half adders and full adders r...
155 155 votes
14 14 answers
111k
111k views
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 o...
21 21 votes
2 answers 2 answers
5.2k
5.2k views
Assume that only half adders are available in your laboratory. Show that any binary function can be implemented using half adders only.
57 57 votes
5 answers 5 answers
17.0k
17.0k views
An N-bit carry lookahead adder, where $N$ is a multiple of $4$, employs ICs $74181$ ($4$ bit ALU) and $74182$ ( $4$ bit carry lookahead generator).The minimum addition ti...
62 62 votes
8 answers 8 answers
32.4k
32.4k views
The number of full and half-adders required to add $16$-bit numbers is$8$ half-adders, $8$ full-adders$1$ half-adder, $15$ full-adders$16$ half-adders, $0$ full-adders$4$...
99 99 votes
8 answers 8 answers
25.5k
25.5k views
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 ...
78 78 votes
6 answers 6 answers
23.0k
23.0k views
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 \...
122 122 votes
23 answers 23 answers
55.5k
55.5k views
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 com...