GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
103 views

Given $x,y,z$ are Boolean variables and $f(x,y,z)=f(y',x',z)$. How many such functions are possible with $x, y, z$?

  1. $0$
  2. $2^2$
  3. $2^4$
  4. $2^6$ 
asked in Set Theory & Algebra by Junior (935 points)   | 103 views
yes $2^6$
i want explanation i didn't get the explanation which was given in source.
unable to understand the que?? wht is que asking??

plz explain

1 Answer

+5 votes
Best answer

In a three variable boolean function if all of the truth table rows are independent w.r.t the O/P, then total no of boolean function possible is $2^{2^3} = 256$

  • because in the O/P of a truth table we have $2^n= 2^3$ places to fill with 0 or 1. 
  • This is possible because we have not specified any constraint on the boolean function.

 The question here provide us with a constraint equation $f(x,y,z) = f(y',x',z)$

because of this constraint, all 8 rows of the truth table are not independent now. They are in 6 groups.

  1. $f(0,0,0) \ \ \ \text{ and } \ \ f(1,1,0)$ are having same O/P.
  2. $f(0,0,1) \text{ and } f(1,1,0)$ are having same O/P.
  3. $f(0,1,0) ,f(0,1,1) ,f(1,0,0) ,f(1,0,1) ,$ are independent.

So in these 6 rows of the truth table, we can fill up O/P with 0 or 1. 

$\Rightarrow$ total $2^6$ functions possible.

note : we can also solve by calculating no of minterms and taking combinations of them. 

answered by Veteran (43.9k points)  
selected by
highly appreciated !

question has same logic as Self dual function



Top Users Mar 2017
  1. rude

    4768 Points

  2. sh!va

    3054 Points

  3. Rahul Jain25

    2920 Points

  4. Kapil

    2734 Points

  5. Debashish Deka

    2592 Points

  6. 2018

    1544 Points

  7. Vignesh Sekar

    1422 Points

  8. Akriti sood

    1342 Points

  9. Bikram

    1312 Points

  10. Sanjay Sharma

    1126 Points

Monthly Topper: Rs. 500 gift card

21,508 questions
26,832 answers
61,091 comments
23,146 users