Make use of Quine-McCluskey Method :
Prime Implicants are the crossed one $(\times)$ : $m_{2}+m_{10}|m_{4}+m_{5}|m_{0}+m_{2}+m_{4}+m_{6}$
Total of 3 Prime implicants.
Quine-McCluskey Method :
not required for GATE
As you can see that there is one $4$ -set and two $2$ -set that are covering the star marked $1's$ (i.e. the ones that are not covered by any other combinations).
So, the answer is $3$.
(Can be solved using K-Map also. )
Place all minterms that evaluate to one in a minterm table.
Input (first column for no. of 1's)
Combine minterms with other minterms. If two terms vary by only a single digit changing, that digit can be replaced with a dash indicating that the digit doesn't matter. Terms that can't be combined any more are marked with a "*". When going from Size 2 to Size 4, treat '-' as a third bit value. For instance, -110 and -100 or -11- can be combined, but -110 and 011- cannot. (Trick: Match up the '-' first.)
First Comparison
Second Comparison
Prime Implicants
Answer: Total number of prime implicants
Source: Finding prime implicants - Quine-McCluskey algorithm - Wikipedia
all the min terms can only be covered by three diffrernt color so there is only three prime imlecants
I think this is bit easier to understand. The hint here is that we try to find the minimum number of groups(octa(eight 1's) ,quad (four 1's),dual(two 1's) that can be formed and that represents the minimum number of implicants that covers F which is Prime Implicant.
Here, we can form 1 quad and 2 duets.3 prime implicants.
64.3k questions
77.9k answers
244k comments
80.0k users