Consider the following Boolean expression of a function F : F(P, Q) = ( P + Q) ⊕ ( PQ) Which of the following expressions is/are equivalent to F ?
Topic-wise GATE CS PYQs with verified steps
GATE CSE 2026 Set 1 · Q21
Time
Select all that applyOne or more correct
Solution
Official answer: A) P ⊕ Q; C) P ⊕ Q
Boolean Algebra and MinimizationGiven the function:
Let and . Recall the definition of XOR: .
Calculate :
Calculate :
Combine terms:
This is the standard XNOR function, which can be written as:
(Option A)
(Option C)
Options B and D represent XOR ( and ), which are the negation of .
Hence, the correct options are A and C.
Try the question first, then check your work.
Examiner trap
Simplify the XOR expression using to see whether it represents the XNOR or XOR of and .
This Boolean Algebra and Minimization previous year question is Q21 of the GATE CSE 2026 Set 1 paper. Find more GATE CSE PYQs on Boolean Algebra and Minimization in Digital Logic, or browse all GATE CSE PYQs.
Free diagnostic
Take the 20-minute diagnostic: the 3 topics that cost you the most marks, and a rank range. Or sit 5 related Boolean Algebra and Minimization PYQs now with no account.
An official question by email at 7 AM IST, with a link to its verified solution. Unsubscribe in one click.
Boolean Algebra and Minimization has 36 GATE CSE PYQs across 23 papers from 2011 to 2026. 5 of them are 1-mark MSQs like this one, and GATE CSE 2026 Set 1 has 2.
How GATE tests Boolean Algebra and MinimizationIndependent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.