The Gateway to Computer Science Excellence

+4 votes

Best answer

Answer : Minimal SOP = $CA'$

To Cover all the 1's, We can make a Subcube of Size 4 which covers the cells corresponding to the minterms $1,3,9,11$ And Hence Covers all the 1's. So, Our required Minimal SOP = $CA'$

1. We can't make a Subcube of Size 8 here by covering all the cells marked by $1 \,\,and\,\,\times$ Because that'd be invalid.

2. We are only concerned for covering 1's When we seek minimal expression, So, No need covering all the Don't cares.

3. As @MKUtkarsh mentioned, **NOTE that When Don't cares are involved, We get a class of Functions, Not a Specific Function. So, Unless things like Minimal expression, Minimal EPI etc are asked, We can even say that $AC' + CA'$ is also a Correct SOP for this K-Map. Since there are $5$ Don't Cares, We can have $2^5$ functions for this K-Map. Among which the Minimal SOP would be $A'C$.**

Credit : @MKUtkarsh

0 votes

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,741 questions

57,251 answers

198,061 comments

104,693 users