Computer Science · Boolean Algebra
The boolean function F = ( X + Y ) · ( X + Y ) is equivalent to:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1X · Y✓
- 2X + Y
- 3X + Y
- 4X · Y
Correct answer
X · Y
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 Boolean Algebra MCQs →Want more practice questions on Boolean Algebra?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Boolean Algebra