A half adder adds two single-bit inputs, usually represented as and .
Incorrect! Try again.
2What are the two outputs of a half adder?
Design of a half adder
Easy
A.Input and output
B.Clock and reset
C.Enable and select
D.Sum and carry
Correct Answer: Sum and carry
Explanation:
A half adder produces a Sum output and a Carry output.
Incorrect! Try again.
3Which logic gate produces the Sum output of a half adder?
Design of a half adder
Easy
A.AND gate
B.OR gate
C.NOT gate
D.XOR gate
Correct Answer: XOR gate
Explanation:
The Sum of a half adder is given by .
Incorrect! Try again.
4Which logic gate produces the Carry output of a half adder?
Design of a half adder
Easy
A.XOR gate
B.OR gate
C.NOT gate
D.AND gate
Correct Answer: AND gate
Explanation:
The Carry output is produced by an AND gate: .
Incorrect! Try again.
5What is the Sum output of a half adder when and ?
Design of a half adder
Easy
A.2
B.Undefined
C.0
D.1
Correct Answer: 0
Explanation:
Since , the Sum output is 0.
Incorrect! Try again.
6What is the Carry output of a half adder when and ?
Design of a half adder
Easy
A.0
B.Undefined
C.2
D.1
Correct Answer: 1
Explanation:
Since , the Carry output is 1.
Incorrect! Try again.
7Which operation does a half adder perform?
Design of a half adder
Easy
A.Decimal multiplication
B.Binary subtraction
C.Single-bit addition
D.Bit comparison
Correct Answer: Single-bit addition
Explanation:
A half adder performs the addition of two single-bit binary numbers.
Incorrect! Try again.
8How many input bits are used in a full adder?
Design of a full adder
Easy
A.Three input bits
B.Two input bits
C.One input bit
D.Four input bits
Correct Answer: Three input bits
Explanation:
A full adder adds two data bits and an input carry bit.
Incorrect! Try again.
9What is the additional input of a full adder compared with a half adder?
Design of a full adder
Easy
A.Output sum
B.Input carry
C.Clock signal
D.Output carry
Correct Answer: Input carry
Explanation:
A full adder includes an input carry, commonly written as .
Incorrect! Try again.
10What are the outputs of a full adder?
Design of a full adder
Easy
A.Input and carry
B.Sum and carry
C.Clock and sum
D.Select and enable
Correct Answer: Sum and carry
Explanation:
A full adder produces a Sum output and an output Carry.
Incorrect! Try again.
11Which expression represents the Sum output of a full adder?
Design of a full adder
Easy
A.
B.
C.
D.
Correct Answer:
Explanation:
The full adder Sum is the XOR of all three inputs.
Incorrect! Try again.
12What is the Sum output of a full adder when , , and ?
Design of a full adder
Easy
A.2
B.Undefined
C.0
D.1
Correct Answer: 1
Explanation:
The binary addition gives a Sum of 1 and a Carry of 0.
Incorrect! Try again.
13What is the Carry output of a full adder when , , and ?
Design of a full adder
Easy
A.0
B.2
C.Undefined
D.1
Correct Answer: 1
Explanation:
The addition equals binary , giving a Carry of 1.
Incorrect! Try again.
14A full adder can be constructed using how many half adders and one OR gate?
Design of a full adder
Easy
A.Two half adders
B.Three half adders
C.Four half adders
D.One half adder
Correct Answer: Two half adders
Explanation:
A common full adder design uses two half adders and one OR gate.
Incorrect! Try again.
15What does represent in a full adder?
Design of a full adder
Easy
A.Input carry
B.Output carry
C.Output control
D.Input clock
Correct Answer: Input carry
Explanation:
denotes the carry received from the previous lower-order bit.
Incorrect! Try again.
16Which tool is commonly used to list all input and output combinations of a logic circuit?
Validation of combinational logic
Easy
A.Connection chart
B.Truth table
C.Timing clock
D.Power table
Correct Answer: Truth table
Explanation:
A truth table shows the output of a logic circuit for every possible input combination.
Incorrect! Try again.
17What should be compared when validating a combinational logic circuit?
Validation of combinational logic
Easy
A.Gate sizes and labels
B.Expected and observed outputs
C.Input and wire colors
D.Power and ground lengths
Correct Answer: Expected and observed outputs
Explanation:
Validation checks whether the observed circuit outputs match the expected truth-table outputs.
Incorrect! Try again.
18How many input combinations are possible for a circuit with three binary inputs?
Validation of combinational logic
Easy
A.Nine combinations
B.Six combinations
C.Three combinations
D.Eight combinations
Correct Answer: Eight combinations
Explanation:
For binary inputs, the number of combinations is . For three inputs, .
Incorrect! Try again.
19What is a combinational logic circuit's output based on?
Validation of combinational logic
Easy
A.Clock frequency values
B.Stored memory values
C.Previous output values
D.Present input values
Correct Answer: Present input values
Explanation:
A combinational circuit produces outputs based only on its current inputs.
Incorrect! Try again.
20Which method can be used to validate an adder circuit in a workshop?
Validation of combinational logic
Easy
A.Testing input combinations
B.Changing the circuit color
C.Removing all input signals
D.Measuring wire length
Correct Answer: Testing input combinations
Explanation:
Applying all relevant input combinations and checking the outputs validates the adder circuit.
Incorrect! Try again.
21A half adder receives inputs and . What are its sum and carry outputs?
Design of a half adder
Medium
A.Sum = 1, Carry = 0
B.Sum = 1, Carry = 1
C.Sum = 0, Carry = 0
D.Sum = 0, Carry = 1
Correct Answer: Sum = 0, Carry = 1
Explanation:
The sum output is , so . The carry output is , so .
Incorrect! Try again.
22Which combination of logic gates correctly implements a half adder?
Design of a half adder
Medium
A.OR gate for sum and AND gate for carry
B.NOR gate for sum and XOR gate for carry
C.AND gate for sum and XOR gate for carry
D.XOR gate for sum and AND gate for carry
Correct Answer: XOR gate for sum and AND gate for carry
Explanation:
A half adder is defined by and , requiring one XOR gate and one AND gate.
Incorrect! Try again.
23A half adder has a sum output of and a carry output of . Which input condition must be present?
Design of a half adder
Medium
A.
B.
C.Both B and C are possible
D.
Correct Answer: Both B and C are possible
Explanation:
A sum of and carry of occurs when exactly one input is , so either or .
Incorrect! Try again.
24If the AND gate in a half-adder circuit is replaced by an OR gate while the XOR gate remains unchanged, which output behavior is affected?
Design of a half adder
Medium
A.Only the sum output is affected
B.Both outputs become complements
C.Both outputs remain unchanged
D.Only the carry output is affected
Correct Answer: Only the carry output is affected
Explanation:
The sum still comes from the XOR gate. Replacing the AND gate changes the carry function from to .
Incorrect! Try again.
25Which input combination produces a carry but no sum in a half adder?
Design of a half adder
Medium
A.
B.
C.
D.
Correct Answer:
Explanation:
When both inputs are , the XOR sum is and the AND carry is .
Incorrect! Try again.
26A half adder is used to add two single-bit numbers. For inputs and , what binary value is represented by the combined carry and sum outputs?
Design of a half adder
Medium
A.
B.
C.
D.
Correct Answer:
Explanation:
The sum is and the carry is . Thus the two-bit result is .
Incorrect! Try again.
27A designer wants to implement the half-adder sum using only basic AND, OR, and NOT gates. Which Boolean expression should be used?
Design of a half adder
Medium
A.
B.
C.
D.
Correct Answer:
Explanation:
The sum is the exclusive-OR function, which can be written as .
Incorrect! Try again.
28A full adder receives , , and carry-in . What are the sum and carry-out?
Design of a full adder
Medium
A.Sum = 0, Carry-out = 0
B.Sum = 0, Carry-out = 1
C.Sum = 1, Carry-out = 1
D.Sum = 1, Carry-out = 0
Correct Answer: Sum = 0, Carry-out = 1
Explanation:
The total is , which is represented as binary . Therefore, sum = and carry-out = .
Incorrect! Try again.
29Which Boolean expression represents the sum output of a full adder?
Design of a full adder
Medium
A.
B.
C.
D.
Correct Answer:
Explanation:
The full-adder sum is , producing when an odd number of inputs are .
Incorrect! Try again.
30Which expression correctly represents the carry-out of a full adder?
Design of a full adder
Medium
A.
B.
C.
D.
Correct Answer:
Explanation:
A carry is generated when at least two of the three inputs are , represented by .
Incorrect! Try again.
31How can a full adder be constructed using half adders and an OR gate?
Design of a full adder
Medium
A.Two half adders and one AND gate
B.Three half adders and one XOR gate
C.One half adder and one OR gate
D.Two half adders and one OR gate
Correct Answer: Two half adders and one OR gate
Explanation:
The first half adder adds and . The second adds its sum to , and an OR gate combines the two carry outputs.
Incorrect! Try again.
32For a full adder, the sum output is and the carry-out is . Which input condition is possible?
Design of a full adder
Medium
A.
B.
C.
D.
Correct Answer:
Explanation:
With all three inputs equal to , the total is , giving binary outputs and .
Incorrect! Try again.
33A full adder has inputs , , and . What is the decimal value represented by its outputs?
Design of a full adder
Medium
A.Two
B.One
C.Zero
D.Three
Correct Answer: One
Explanation:
The input total is . Therefore, the output is sum = and carry-out = , representing decimal one.
Incorrect! Try again.
34A full-adder circuit is designed with two XOR gates, two AND gates, and one OR gate. Which signal is normally connected to the second XOR gate along with the first XOR output?
Design of a full adder
Medium
A.Carry-in
B.Input
C.Carry-out
D.Input
Correct Answer: Carry-in
Explanation:
The first XOR produces . The second XOR combines this result with to produce .
Incorrect! Try again.
35What is the most appropriate method for validating a newly built full-adder circuit?
Validation of combinational logic
Medium
A.Compare measured outputs with the complete truth table
B.Test only the all-zero input
C.Measure only the supply voltage
D.Check the circuit only when the sum is one
Correct Answer: Compare measured outputs with the complete truth table
Explanation:
A combinational circuit is validated by applying every input combination and comparing the observed outputs with the expected truth-table values.
Incorrect! Try again.
36During testing of a half adder, the carry output is always , including for and . Which fault is most likely?
Validation of combinational logic
Medium
A.The output indicator is connected to ground
B.The supply frequency is too high
C.The AND gate or its wiring is faulty
D.The XOR input is shorted
Correct Answer: The AND gate or its wiring is faulty
Explanation:
The carry should be only when both inputs are . A constant-zero carry suggests a problem in the AND gate path or its connections.
Incorrect! Try again.
37A full-adder test gives the correct sum for all input combinations but an incorrect carry-out. Which part should be checked first?
Validation of combinational logic
Medium
A.The XOR network for the sum
B.The carry-generation network
C.The circuit's clock source
D.The input switches for only
Correct Answer: The carry-generation network
Explanation:
Since the sum is correct, the XOR path is likely functioning. The carry gates, connections, or carry-output indicator should be examined.
Incorrect! Try again.
38When validating combinational logic on a breadboard, why should unused logic inputs not be left floating?
Validation of combinational logic
Medium
A.Floating inputs can produce unpredictable logic levels
B.Floating inputs permanently damage every logic gate
C.Floating inputs increase the circuit's clock speed
D.Floating inputs always force the output to zero
Correct Answer: Floating inputs can produce unpredictable logic levels
Explanation:
An unconnected input may pick up electrical noise and switch between logic states, causing unreliable or inconsistent output readings.
Incorrect! Try again.
39A measured full-adder output disagrees with the truth table only when , , and . What output should be expected for this test?
Validation of combinational logic
Medium
A.Sum = 0, Carry-out = 0
B.Sum = 1, Carry-out = 1
C.Sum = 0, Carry-out = 1
D.Sum = 1, Carry-out = 0
Correct Answer: Sum = 1, Carry-out = 1
Explanation:
The three input bits add to , which is binary . Thus both the sum and carry-out outputs must be .
Incorrect! Try again.
40A logic probe shows an undefined reading at the sum output while testing a half adder. Which action is most suitable before concluding that the design is incorrect?
Validation of combinational logic
Medium
A.Tie the sum output directly to supply
B.Verify power, ground, and input connections
C.Replace the XOR gate with a NOT gate
D.Ignore the reading and test only carry
Correct Answer: Verify power, ground, and input connections
Explanation:
An undefined output can result from missing power, poor grounding, loose wiring, or floating inputs. These connections should be checked first.
Incorrect! Try again.
41A half adder is implemented using only NAND gates. Which minimized two-output realization correctly produces sum and carry for inputs and ?
Design of a half adder
Hard
A.,
B.,
C.,
D.,
Correct Answer: ,
Explanation:
The sum is , realized by the four-NAND XOR network, and the carry is , obtained by inverting with a NAND gate.
Incorrect! Try again.
42A half adder uses active-high inputs and outputs. Its sum output is accidentally connected to an AND gate while its carry output is connected to an XOR gate. Which input condition exposes both wiring errors simultaneously?
Design of a half adder
Hard
A.,
B.,
C.,
D.,
Correct Answer: ,
Explanation:
For , the required outputs are and . The swapped implementations produce and , so both outputs are wrong.
Incorrect! Try again.
43A half-adder sum is specified as , but the available gates are one 2-input OR gate and one 2-input AND gate. An inverter is also available. Which expression implements the sum with the fewest additional gates?
Design of a half adder
Hard
A.
B.
C.
D.
Correct Answer:
Explanation:
The identity requires one OR, one AND, and one inverter. The other expressions do not evaluate to XOR for all four input combinations.
Incorrect! Try again.
44A half adder is described by the canonical sum-of-products expression for its carry output. Which expression is correct, and why is no minterm required for the sum output at input ?
Design of a half adder
Hard
A.; the sum is one when both inputs are one
B.; the sum is zero when both inputs are equal
C.; the sum is zero when both inputs are one
D.; the sum is one whenever is one
Correct Answer: ; the sum is one when both inputs are one
Explanation:
With ordering , carry is one only at , so . The sum is , which is zero for equal inputs, including .
Incorrect! Try again.
45Two half adders are cascaded incorrectly by feeding the first half-adder carry into the second half-adder along with an external bit . For , , and , what are the final sum and carry outputs of this cascade?
Design of a half adder
Hard
A.,
B.,
C.,
D.,
Correct Answer: ,
Explanation:
The first half adder gives and . The second receives and , giving final sum and carry .
Incorrect! Try again.
46A half-adder circuit uses positive-logic XOR and AND gates, but its inputs are active-low signals and . Which output equations represent active-high versions of the arithmetic sum and carry?
Design of a half adder
Hard
A.,
B.,
C.,
D.,
Correct Answer: ,
Explanation:
An active-low zero represents logical one, so the internal logical inputs are and . Substituting them into the half-adder equations gives the stated outputs.
Incorrect! Try again.
47A half-adder implementation has propagation delays of through its XOR path and through its AND path. If both inputs change simultaneously from to , which transient behavior is expected under an inertial-delay model?
Design of a half adder
Hard
A.The sum pulses high before returning low, while carry rises
B.The sum rises after and the carry remains low
C.The sum and carry rise together after the XOR delay
D.The sum remains low and the carry rises after
Correct Answer: The sum pulses high before returning low, while carry rises
Explanation:
The XOR output may respond to the unequal arrival of internal signals and briefly indicate inequality during the transition. The stable result for is , , with carry reaching its final value after the shorter path.
Incorrect! Try again.
48Which Boolean expression gives the carry output of a full adder in terms of augend , addend , and carry-in ?
Design of a full adder
Hard
A.
B.
C.
D.
Correct Answer:
Explanation:
A carry occurs when at least two of the three inputs are one. The majority expression is , equivalent to .
Incorrect! Try again.
49A full adder is constructed from two half adders and an OR gate. If the first half adder produces from and the second produces from , which carry equation results?
Design of a full adder
Hard
A.
B.
C.
D.
Correct Answer:
Explanation:
The two half-adder carries are and . Their OR gives the full-adder carry without changing the required truth table.
Incorrect! Try again.
50For a full adder with inputs , , and , which output pair is correct and what arithmetic condition does it represent?
Design of a full adder
Hard
A., ; the total is binary
B., ; the total is binary
C., ; the total is binary
D., ; the total is binary
Correct Answer: , ; the total is binary
Explanation:
The input total is , represented as . Therefore, the sum bit is zero and the carry-out bit is one.
Incorrect! Try again.
51A full-adder sum output is implemented as . If the first XOR gate has a stuck-at-zero output, for which input set is the observed sum incorrect?
Design of a full adder
Hard
A., ,
B., ,
C., ,
D., ,
Correct Answer: , ,
Explanation:
For , the correct sum is . A stuck-at-zero intermediate gives , so this test detects the fault. The other listed cases either remain correct or do not expose the fault.
Incorrect! Try again.
52A ripple-carry adder is formed from four full adders. The carry propagation delay of each stage is , and the final sum logic settles after its carry-in settles. What is the worst-case delay from a carry-in change at the least significant stage to the most significant sum output?
Design of a full adder
Hard
A.
B.
C.
D.
Correct Answer:
Explanation:
The carry must propagate through four stages, requiring to reach the final carry, but the most significant sum is formed after three carry propagations and then of sum delay: .
Incorrect! Try again.
53A full adder must be designed using only 2-input XOR, AND, and OR gates. Which gate-count combination implements both outputs with no shared intermediate node?
Design of a full adder
Hard
A.Two XOR, two AND, one OR
B.One XOR, two AND, two OR
C.Three XOR, two AND, two OR
D.Two XOR, three AND, one OR
Correct Answer: Two XOR, three AND, one OR
Explanation:
The sum requires two XOR gates. A direct carry implementation requires three AND gates and one OR gate.
Incorrect! Try again.
54For a full adder, the carry output is required to be independent of for a particular pair . Which pair satisfies this condition, and what is the resulting carry value?
Design of a full adder
Hard
A.; for either carry-in
B.; for either carry-in
C.; for either carry-in
D.; for either carry-in
Correct Answer: ; for either carry-in
Explanation:
Using , the pair makes both terms zero. Thus the carry remains zero regardless of .
Incorrect! Try again.
55A full adder is used to add three one-bit operands. If the sum output is correct but the carry output is replaced by , which input combination produces an incorrect carry?
Design of a full adder
Hard
A., ,
B., ,
C., ,
D., ,
Correct Answer: , ,
Explanation:
For , the correct carry is zero because only one input is one? Actually two inputs are one, so the correct carry is one. The faulty expression gives , exposing the missing term.
Incorrect! Try again.
56A combinational circuit has three inputs, and its output is one for minterms . Which input sequence provides complete functional validation when all possible static input combinations are tested?
Validation of combinational logic
Hard
A.
B.
C.
D.
Correct Answer:
Explanation:
Three binary inputs have possible static combinations. Exhaustive validation requires applying every combination, regardless of whether the expected output is zero or one.
Incorrect! Try again.
57A measured full-adder truth table shows the correct outputs for all cases except , , , where the measured result is , . Which fault best explains this isolated error?
Validation of combinational logic
Hard
A.The carry term is missing
B.The input is permanently held at one
C.The carry output is stuck at zero
D.The sum XOR network is stuck at zero
Correct Answer: The carry term is missing
Explanation:
For , the required carry is one because . Omitting that term can cause this case to fail while other carry-generating cases remain correct.
Incorrect! Try again.
58During validation of a two-level combinational circuit, the output briefly pulses when input changes from to while . The steady-state function is . Which explanation is most appropriate?
Validation of combinational logic
Hard
A.The circuit has a static-1 hazard caused by unequal path delays
B.The truth table is invalid because OR gates cannot produce pulses
C.The circuit is sequential because the output depends on prior inputs
D.The circuit has a static-0 hazard because both inputs are zero
Correct Answer: The circuit has a static-1 hazard caused by unequal path delays
Explanation:
With , should remain one while changes. A temporary low caused by unequal delays is a static-1 hazard, even though the steady-state truth table is correct.
Incorrect! Try again.
59A logic analyzer samples a full-adder output at the exact instant inputs change. Why can this method falsely suggest an incorrect truth-table entry?
Validation of combinational logic
Hard
A.Truth tables apply only when inputs change asynchronously
B.Combinational outputs may be transient before propagation settles
D.Full adders retain the previous output until reset
Correct Answer: Combinational outputs may be transient before propagation settles
Explanation:
Gate propagation delays can create temporary glitches after an input transition. Validation should sample after the worst-case settling time or use timing-aware measurements.
Incorrect! Try again.
60A half-adder testbench checks only input pairs and and observes correct outputs. Which conclusion is justified?
Validation of combinational logic
Hard
A.The carry function is validated, but the sum function is not fully validated
B.Both functions are fully validated because equal inputs were tested
C.Neither function is validated because unequal inputs were omitted
D.The sum function is validated, but the carry function is not validated
Correct Answer: The carry function is validated, but the sum function is not fully validated
Explanation:
The tested cases establish for and for , covering both carry values. The XOR sum is zero in both cases, so unequal-input behavior remains untested.
Incorrect! Try again.
Did this save you a night before the exam?
LPU Notes is free, and it stays free. Ads cover part of the server bill.
The rest comes out of a student's own pocket: the domain, the storage,
and keeping the site up through the weeks everyone needs it at once.
The payment button didn't load. An ad blocker or a filtered network is the usual reason.
to try again.
Nothing here is ever locked, and nothing unlocks. Chip in only if it was worth it.
What it pays for →