Computer Science · Digital Electronics
कौन सा बूलियन बीजगणितीय नियम या पहचान यह निर्दिष्ट करती है कि दो कथनों के संयोजन (conjunction) का पूरक उनके पूरक के वियोजन (disjunction) के बराबर होता है, जिसे ¬(A ∧ B) = ¬A ∨ ¬B के रूप में दर्शाया जाता है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1वितरण नियम (Distributive law)
- 2वर्गसम नियम (Idempotent law)
- 3डी मॉर्गन का नियम (De Morgan's law)✓
- 4अवशोषण नियम (Absorption law)
सही उत्तर देखें
डी मॉर्गन का नियम (De Morgan's law)
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 Electronics MCQs →Want more practice questions on Digital Electronics?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Digital Electronics