Last Updated :
06 Jan, 2019
Any set of boolean operators that is sufficient to represent all boolean expression is called complete. Which of the following is NOT complete?
(A) {→, ↚}
(B) {→, ¬}
(C) {↑}
(D) None of these
Answer: (D)
Explanation: Given sets {→, ↚}, {→, ¬}, and {↑} are functional complete sets.
So, option (D) is correct.
Quiz of this Question
Share your thoughts in the comments
Please Login to comment...