retagged by
527 views
3 votes
3 votes

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$ 
retagged by

1 Answer

Best answer
5 votes
5 votes

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. 

selected by

Related questions

25 votes
25 votes
4 answers
2
makhdoom ghaya asked Nov 7, 2016
4,899 views
The total number of Boolean functions which can be realised with four variables is:$4$$17$$256$$65, 536$
7 votes
7 votes
2 answers
3
go_editor asked Jul 1, 2016
3,675 views
Let $\text{A}$ be a finite set having $x$ elements and let $\text{B}$ be a finite set having $y$ elements. What is the number of distinct functions mapping $\text{B}$ int...