Yes Ans 1 should be correct .

The Gateway to Computer Science Excellence

0 votes

**I think option A is also **__correct __!

if we take minterm and complement it to get POS then option A can also be the answer

0

Using the K-map we can easily get option $(C))$

$f(A,B,C,D)=\overline{A}\cdot C\cdot\overline{D}+A\cdot\overline{B}\cdot C\cdot\overline{D}+A\cdot\overline{B}\cdot \overline{C}\cdot\overline{D}$

$f(A,B,C,D)=\overline{A}\cdot C\cdot\overline{D}+A\cdot\overline{B}\cdot C\cdot\overline{D}+A\cdot\overline{B}\cdot \overline{C}\cdot\overline{D}$

+1

In the solution : If we expand the scond term i.e **A.Com(B).Com(D)** as **A.Com(B).Com(D) { C + Com(C) } **then we get option C.

NOTE: here **Com() ~ refers as Complement !**

0

@Shawn Frost @Lakshman Patel RJIT Given answer is correct.. Are you getting same expression with normal POS and complement of SOP as you did ?

- 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,737 questions

57,297 answers

198,263 comments

104,977 users