3 votes 3 votes if a boolean function having cyclic prime implicants k-map then the function is having how many minimal form?? F(A,B,C) Digital Logic boolean-algebra + – abhishek tiwary asked Nov 23, 2017 • retagged Nov 24, 2017 by Arjun abhishek tiwary 4.6k views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Red_devil commented Nov 23, 2017 reply Follow Share min terms will be (0,1,2,5,6,7) in cyclic prime implicant so either take [(0,1) (5,7),(2,6)] or [(0,2),(7,6),(1.5)] so i think 2 2 votes 2 votes Rishabh Gupta 2 commented Jan 15, 2018 reply Follow Share What is cyclic prime implicant k-map?? 1 votes 1 votes Shamim Ahmed commented Nov 15, 2018 reply Follow Share https://www.youtube.com/watch?v=0KpLQfo3MVk 1 votes 1 votes Please log in or register to add a comment.
Best answer 6 votes 6 votes solution of above questionestion Anurag Tiwari 1 answered Nov 25, 2017 • selected Jan 3, 2018 by abhishek tiwary Anurag Tiwari 1 comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Verma Ashish commented Aug 30, 2018 reply Follow Share I think only two minimal forms are possible for any no. of variables. 3 votes 3 votes Magma commented Aug 30, 2018 reply Follow Share No , you're wrong Verma Ashish –1 votes –1 votes Verma Ashish commented Aug 30, 2018 reply Follow Share What we answer if number of variables is not given?? 1 votes 1 votes Please log in or register to add a comment.
1 votes 1 votes 2minimal form SUBRATO KUMAR answered Jul 20, 2019 SUBRATO KUMAR comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes For the cyclic function of any number of variable, number of minimal boolean expressions are 2. Crackca answered Dec 20, 2021 Crackca comment Share Follow See all 0 reply Please log in or register to add a comment.