0
You visited us 0 times! Enjoying our articles? Unlock Full Access!
Question

# The Boolean expression for NAND gate is -

A
$$Y = \overline {A + B}$$
B
$$Y = A + B$$
C
$$Y = A.B$$
D
$$Y = \overline {A. B}$$
Solution
Verified by Toppr

#### Correct option is D. $$Y = \overline {A. B}$$The Boolean algebra for $${\text{AND}}$$ gate is-$$Y = A.B$$So, the Boolean algebra for $${\text{NAND}}$$ gate is-$$Y = \overline {A.B}$$

6
Similar Questions
Q1
The Boolean expression for NAND gate is -
View Solution
Q2
What is the Boolean expression for the output F of the combinational logic circuit of NAND gates given below:

View Solution
Q3
Three NAND gates are used as shown in diagram and give a new logic gate. Then Boolean algebra for the new gate is

View Solution
Q4
Consider a Boolean expression
f=(B+BC)(B+¯¯¯¯BC)(B+D)

The minimum number of NAND-gates required to implement this function f will be __________
View Solution
Q5
Consider a Boolean expression.
f=(B+BC)(B+¯¯¯¯BC)(B+D)

The minimum number of NAND-gates required to implement this function f will be __________
View Solution