Computer Science · Digital Logic & Boolean Algebra
Let ⊕ denote the XOR operation. Let 1 and 0 denote the binary constants and F is the Boolean expression over two variables P and Q: F(P, Q) = ((1 ⊕ P) ⊕ (P ⊕ Q)) + ((P ⊕ Q) ⊕ (Q ⊕ 0)) Which of the following expressions is equivalent to F?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1P ⊕ Q✓
- 2P + Q
- 3P + Q
- 4P ⊕ Q
Correct answer
P ⊕ Q
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 & Boolean Algebra MCQs →Want more practice questions on Digital Logic & Boolean Algebra?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Digital Logic & Boolean Algebra