A set of Boolean connectives is functionally complete if all Boolean functions…
GATE · 2008 · IT
A set of Boolean connectives is 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
Attempted by 694 students.
Sign up free to check your answer
Sign up freeLoading lesson…