retagged by
4,619 views
3 votes
3 votes
  1. if a boolean function having cyclic prime implicants k-map then the function is having how many minimal form?? F(A,B,C)
retagged by

3 Answers

Best answer
6 votes
6 votes

solution of above questionestion

selected by
1 votes
1 votes
For the cyclic function of any number of variable, number of minimal boolean expressions are 2.

Related questions

0 votes
0 votes
1 answer
1
dvlken asked Oct 16, 2023
343 views
2. Simplify the following Boolean expressions to a minimum number of literals: (a + b + c’)(a’b’ + c) 3. Draw logic diagrams of the circuits that implement the orig...
1 votes
1 votes
0 answers
2
jatin khachane 1 asked Nov 4, 2018
406 views
What is DUAL for FunctionF = AB + CFd = (A + B).C Or Fd = A + (B.C)OR >AND and AND >OR but what about precedence ??
0 votes
0 votes
1 answer
3
smsubham asked Aug 8, 2018
590 views
Which if the following are correct? (Multiple Possible)A ExNOR (BC) = (A ExNOR B) (A ExNOR C)A ExOR (B + C) = (A ExOR B) + (A ExOR C)A ExNOR (B + C) = (A ExNOR B) + (A Ex...
0 votes
0 votes
3 answers
4
Devshree Dubey asked Jul 20, 2018
1,270 views
As per the Boolean identity x+x=x,similarly does it hold for the following expression with XOR operation too?((P⊛Q)⊛(P⊛Q))=P⊛Q