5,251 views
0 votes
0 votes

Given explanation.

I am not able to understand what is asked in the question. Please explain.

2 Answers

0 votes
0 votes
There is two types of K-Maps 1) All Possible Type  2) Minimal Type

 All Possible Type

  Every combination we have to count  17  

Minimal Type

only minimal we have to count     14
0 votes
0 votes

SOP for this KMAP is.  $BD+A'C'D+A'BC+ABC'+ACD+AB'C$

So, total number of literal  $17.$

Note: literal counts every symbol including duplicate

Related questions

374
views
2 answers
0 votes
vivek1211 asked Nov 18, 2023
374 views
498
views
0 answers
2 votes
h4kr asked Dec 28, 2022
498 views
I got a K-map with the following boolean function: F(A,B,C,D) = ΠM[3,4,6,9,11,14]+ Σd[0,7,8,10,13,15]In the following K-map following prime-implicants ... $C$+$D$)So we get different f in the two cases or am I making a mistake somewhere?
616
views
1 answers
1 votes
LavTheRawkstar asked Jun 26, 2016
616 views
Simplify E(x,y,z,t)=Σ (0,2,7,8,10,15) using K-maps.