37 votes 37 votes Which of the following sets of component(s) is/are sufficient to implement any arbitrary Boolean function? XOR gates, NOT gates $2$ to $1$ multiplexers AND gates, XOR gates Three-input gates that output $(A.B) + C$ for the inputs $A, B$ and $C$. Digital Logic gate1999 digital-logic normal functional-completeness multiple-selects + – Kathleen asked Sep 23, 2014 • edited Nov 5, 2018 by kenzou Kathleen 15.2k views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Deepak Poonia commented Jul 16, 2022 i edited by Deepak Poonia Dec 28, 2023 reply Follow Share Functional Completeness Complete Course 1 votes 1 votes raja11sep commented Sep 11, 2022 reply Follow Share Sir, what do you mean by xor is linear? Can you please explain a bit ? 0 votes 0 votes Deepak Poonia commented Dec 28, 2023 reply Follow Share @raja11sep, Linear Boolean Function is Explained in these lectures: Lecture 1: Linear Boolean Function | Functional Completeness Lecture 2: Linear Boolean Function Part 2 0 votes 0 votes Please log in or register to add a comment.
–2 votes –2 votes answer - C ankitrokdeonsns answered Oct 19, 2014 ankitrokdeonsns comment Share Follow See all 3 Comments See all 3 3 Comments reply Gate Aspirant commented Dec 24, 2014 reply Follow Share I think B ,C can you tell me please why not B???? 1 votes 1 votes ankitrokdeonsns commented Dec 25, 2014 reply Follow Share 2:1 MUX cant implement binary boolean functions 0 votes 0 votes dhingrak commented Feb 1, 2015 reply Follow Share can you please explain why the answer is c ? 0 votes 0 votes Please log in or register to add a comment.