Electronics Engineering · Boolean Minimization
Minimize the Boolean expression: Y = f(A,B,C,D) = Σm(0, 1, 2, 6, 7, 10, 14) + d(3, 8, 11, 15), where 'd' denotes the don't-care conditions.
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Y = A'B' + C
- 2Y = B' + C
- 3Y = A'BC + AB'C + CD'
- 4Y = A'B' + B'D' + C✓
Correct answer
Y = A'B' + B'D' + C
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 Electronics Engineering?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Boolean Minimization MCQs →Want more practice questions on Boolean Minimization?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Electronics Engineering · Boolean Minimization