Computer Science · Boolean Algebra
बूलियन बीजगणितीय प्रमेयों का उपयोग करके बूलियन व्यंजक Z = A̅B̅C̅D + A̅BCD̅ + AB̅C̅D + ABC̅D̅ को निम्नलिखित में से किस व्यंजक में न्यूनतम (minimize) किया जा सकता है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Z = A̅BCD̅ + B̅C̅D + AB
- 2Z = A̅BCD̅ + B̅D + BC̅D̅
- 3Z = A̅BCD̅ + B̅C̅D + ABC̅D̅✓
- 4Z = A̅BC + B̅C̅D + ABC̅D̅
सही उत्तर देखें
Z = A̅BCD̅ + B̅C̅D + ABC̅D̅
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