GATE CSE 2008 | Functional Completeness | Digital Logic | GO Classes | GATE Overflow | Deepak Poonia

GATE IT 2008 | Question: 1 : 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? EX-NOR implication, negation OR, negation NAND https://gateoverflow.in/3222/gate-it-2008-question-1 Visit GO Classes Website : Website Link : https://www.goclasses.in/ Join GO Classes Telegram channel for Resources : Telegram Link : https://t.me/Goclasses_for_GATECSE Complete Discrete Mathematics Course(FREE) Link : https://www.goclasses.in/s/store/courses/description/Discrete-Mathematics Complete C-Programming Course(FREE) Link : https://www.goclasses.in/s/store/courses/description/C-programming Crack GATE Computer science exam with the best. Join "GO Classes Complete GATE CSE Course" Feel free to contact us for any query.