Use app×
Join Bloom Tuition
One on One Online Tuition
JEE MAIN 2025 Foundation Course
NEET 2025 Foundation Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
0 votes
1.2k views
in Computer by (49.9k points)
closed by

State De Morgan’s law and verify it, using a truth table.

1 Answer

+1 vote
by (48.9k points)
selected by
 
Best answer

The two theorems suggested by De Morgan which are extremely useful in Boolean Algebra are as following: 

Theorem 1 

\(\over A . B\) = \(\bar A \) + \(\bar B\)

NAND = Bubbled 

OR 

Table showing verification of the De Morgans’s first theorem

Theorem 2 

\(\over A + B\)\(\bar A\)\(\bar B\)

NOR = Bubbled AND 

Table showing verification of the De Morgans’s second theorem

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

Categories

...