COMPUTER SCIENCE AND ENGINEERING
DIGITAL LOGIC
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
x=A+B
|
|
|
x=A.B
|
|
|
X=Ā
|
|
|
None of the above
|
Detailed explanation-1: -Q = ( A + B ) (A + B) = (A’ + B’) (A + B) This equation looks like it can be implemented using NOR Gates. We need totally five NOR gates (two for inverting A and B, one for NOR of A and B, one for NOR of A’ and B’ and the final one to obtain the above equation).
Detailed explanation-2: -Truth Table: The output of an XOR gate is high (1) only when exactly one of its inputs is high (1). If both of an XOR gate’s inputs are low (0), or if both of its inputs are high (1), then the output of the XOR gate is low.
Detailed explanation-3: -Here, A+AB=A(1+B)=A since in Boolean algebra, 1+B=1.
Detailed explanation-4: -“XOR” an abbreviation for “Exclusively-OR.” The simplest XOR gate is a two-input digital circuit that outputs a logical “1” if the two input values differ, i.e., its output is a logical “1” if either of its inputs are 1, but not at the same time (exclusively).