Computer Sciences > Gate 2014 Set-1 > Logic Function and Minimization
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__________
A
PQ + QR + QS
B
P + Q + R + S
C
P’ + Q’ + R’ + S’
D
P’R + P’R’S + P

Correct : a

Given Boolean Expression:
F(P, Q, R, S) = PQ + P'QR + P'QR'S
Simplify the last two terms using the absorption law.
• Focus on P'QR + P'QR'S.
• Factor out the common term P'Q:
    P'Q(R + R'S)
• Apply the Boolean identity (X + X'Y = X + Y). Here, X = R and Y = S.
    So, (R + R'S) simplifies to (R + S).
• Substitute this back:
    P'Q(R + S) = P'QR + P'QS
• The expression now becomes:
    F = PQ + P'QR + P'QS
Simplify the first two terms using the absorption law.
• Focus on PQ + P'QR.
• Factor out the common term Q:
    Q(P + P'R)
• Apply the Boolean identity (X + X'Y = X + Y). Here, X = P and Y = R.
    So, (P + P'R) simplifies to (P + R).
• Substitute this back:
    Q(P + R) = PQ + QR
• The expression now becomes:
    F = PQ + QR + P'QS
Simplify the remaining expression.
• We have F = PQ + QR + P'QS.
• Factor out the common term Q from all terms:
    F = Q(P + R + P'S)
• Focus on the terms inside the parenthesis: (P + R + P'S).
• Rearrange to group P with P'S: (P + P'S + R).
• Apply the Boolean identity (X + X'Y = X + Y). Here, X = P and Y = S.
    So, (P + P'S) simplifies to (P + S).
• Substitute this back into the parenthesis:
    (P + S + R)
• Now substitute this back into the full expression for F:
    F = Q(P + S + R)
• Distribute Q:
    F = QP + QS + QR
• Rearrange the terms for standard form:
    F = PQ + QR + QS

Similar Questions

A palindrome is a word that reads the same forwards and backwards. In a game of words, a player has the following two plates painted with letters. From...
#1 MCQ
Which number does not belong in the series below? 2, 5, 10, 17, 26, 37, 50, 64
#4 MCQ
Choose the word that is opposite in meaning to the word “coherent”.
#5 MCQ

Related Topics

Boolean expression minimal sum-of-products logic minimization SOP form digital logic GATE Computer Sciences 2014 GATE CS 2014 Set-1 Q5 simplify Boolean expression

Unique Visitor Count

Total Unique Visitors

Loading......