1 votes 1 votes 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 ? EX-NOR implication, negation OR, negation NAND Digital Logic digital-logic go-digital-logic-1 functional-completeness + – Bikram asked Sep 19, 2016 Bikram 503 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes option a) we cant drow negation with the help of EX-OR so it is not functionally complete. abhishekmehta4u answered Apr 28, 2018 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Except EX-OR all are functionally complete. Digvijay Pandey answered Oct 31, 2016 Digvijay Pandey comment Share Follow See all 3 Comments See all 3 3 Comments reply Wanted commented Jan 7, 2017 reply Follow Share what about thiz implication, negation 0 votes 0 votes anonymous commented Apr 28, 2018 reply Follow Share OR, NEGATION is not complete i think 0 votes 0 votes abhishekmehta4u commented Apr 28, 2018 reply Follow Share it is functionally complete 0 votes 0 votes Please log in or register to add a comment.