Register

Asked in Bihar STET 2023 computer science

• retagged by
177 views
0 votes
0 votes

What is the simplified expression for the Boolean function F(A, B, C, D) = Σ(0, 1, 2, 4, 5, 6, 8, 9, 10, 12, 13, 14) using the K-map method?

(A)             A'B'C'D' + A'B'C'D + A'BC'D + AB'C'D + ABCD

(B)              A'B'C'D' + A'BC'D + AB'C'D + ABC'D + ABCD

(C)              A'B'C'D' + A'BC'D + ABC'D + ABCD

(D)            A'B'C'D' + A'BC'D' + A'BCD + ABCD

• retagged by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

495
views
0 answers
2 votes
h4kr asked Dec 28, 2022
495 views
Choosing prime implicants in K-maps
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?
User Avatar
4.4k
views
5 answers
2 votes
Gitika Babbar asked Jun 14, 2019
4,363 views
Minimization doubt in DIGITAL LOGIC
User Avatar
2.6k
views
2 answers
1 votes
Jason asked Mar 21, 2018
2,646 views
Don't Care term in POS
Should we use Don't care terms while calculating POS expression?
User Avatar
857
views
1 answers
0 votes
Tuhin Dutta asked Nov 7, 2017
857 views
Self doubt on literal count in k-map
Find least literal count of POS for the following k-map.X10101X01XX0X00XAns:Minterms= 2 quads + 2 pairs = 2*2 + 3*2 = 10 literalsOR,= 1 quad + 2 ... requirement?Since here minimum no.of literals are asked to find so is 2nd approach correct?
User Avatar
Link Copied!