Consider the following Boolean expression for F:

F(P, Q, R, S) = PQ + P̅QR + P̅QR̅S

The minimal sum-of-products form of F is  

This question was previously asked in
GATE CS 2014 Official Paper: Shift 1
View all GATE CS Papers >
  1. PQ + QR + QS
  2. P + Q + R + S
  3. P̅ + Q̅ + R̅ + S̅ 
  4. P̅R + P̅R̅S + P

Answer (Detailed Solution Below)

Option 1 : PQ + QR + QS
Free
GATE CS Full Mock Test
65 Qs. 100 Marks 180 Mins

Detailed Solution

Download Solution PDF

F(P, Q, R, S) = PQ + P̅QR + P̅QR̅S

F(P, Q, R, S) = PQ(R + R̅)(S + S̅) + P̅QR(S + S̅) + P̅QR̅S  

F(P, Q, R, S) = PQRS + PQRS̅ + PQR̅S + PQR̅S̅ + P̅QRS + P̅QRS̅ + P̅QR̅S

F(P, Q, R, S) = ∑ (15 + 14 + 13 + 12 + 7 + 6 + 5)  

K-Map:

F(P, Q, R, S) = PQ + QR + QS

Latest GATE CS Updates

Last updated on Jan 8, 2025

-> GATE CS 2025 Admit Card has been released on 7th January 2025.

-> The exam will be conducted on 1st February 2025 in 2 shifts.

-> Candidates applying for the GATE CE must satisfy the GATE Eligibility Criteria.

-> The candidates should have BTech (Computer Science). Candidates preparing for the exam can refer to the GATE CS Important Questions to improve their preparation.

-> Candidates must check their performance with the help of the GATE CS mock tests and GATE CS previous year papers for the GATE 2025 Exam.

Hot Links: teen patti gold old version teen patti casino lucky teen patti happy teen patti