Computer Science · Digital Logic
The Boolean function (X + Y + Z) · (X + Y + Z) · (X + Z) can be minimized to which of the following forms?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1X + (Y + Z)
- 2X + (Y + Z)
- 3X + (Y · Z)✓
- 4X + Y
Correct answer
X + (Y · Z)
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