GATE Overflow | Digital Logic | Test 1 | Question: 4

Question

A set of Boolean connectives is known as functionally complete if all Boolean functions can be Synthesized using those. Which of the following sets of connectives is not functionally complete ?

• A. EX-NOR
• B. implication, negation
• C. OR, negation
• D. NAND

Answer 1

option a) we cant drow negation with the help of EX-OR so it is not functionally complete.

Answer 2

Except EX-OR all are functionally complete.

Comments

what about thiz

implication, negation

---

OR, NEGATION is not complete i think

---

it is functionally complete