370 views

2 Answers

Best answer
2 votes
2 votes

Here according to the equation we need to see how the constraint works here actually..

Given ,

f(x,y,z)  =  f(x',y,z')

So f(0,0,0)  =  f(1,0,1)

     f(0,0,1)  =  f(1,0,0)

     f(0,1,0)  =  f(1,1,1)

     f(0,1,1)  =  f(1,1,0)

   

So we can see that each minterm(possible combination of x,y,z) is covered exactly once..

Now say f(0,0,0) can be 0 or 1..But 

             f(0,0,0)  = f(1,0,1)

So having selected f(0,0,0) we have one choice for f(1,0,1)..

Likewise for other 3 pairs also..

Hence number of functions possible  = 2 * 2 * 2 * 2 [ 2 choices for each pair ]

                                                      = 16 functions

Hence B) should be the correct answer..

selected by

Related questions

0 votes
0 votes
0 answers
1
0 votes
0 votes
2 answers
2
Sandeep652025 asked Sep 20, 2023
317 views
0 votes
0 votes
1 answer
3
Priyankalora asked Jul 30, 2023
826 views
Find the complement of the following Boolean functions and reduce them to a minimum number of literalsa) (BC'+A'D)(AB'+CD')b)B'D+A'BC'+ACD+A'BCc)[(AB)'A][(AB)'B]d)AB'+C'D...
4 votes
4 votes
1 answer
4
Harikesh Kumar asked Jan 14, 2018
2,359 views
Explain each term in detailed