Computer Science · Digital Logic
Consider the Boolean function F(P, Q, R, S) = Σ(0, 2, 5, 7, 8, 10, 13, 15), where minterms 2, 7, 8, and 13 are 'don't care' conditions. The minimal sum-of-products (SOP) form for F is:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1P̄ Q̄ S̄ + P̄ QS + PQS + P Q̄ S̄
- 2Q̄ R̄ S̄ + Q̄ R S̄ + Q R̄ S + QRS
- 3Q̄ S̄ + QS✓
- 4Q S̄ + Q̄ S
Correct answer
Q̄ S̄ + QS
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Digital Logic MCQs →Want more practice questions on Digital Logic?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Digital Logic