De-Morgan's Theorems 1 and 2 with their proof using truth table

Описание: Here i am explaining De-morgan's first and second theorem with their proof using truth table.
De-morgan's theorems are useful when we simplify boolean expressions as well as when we implement expressions using universal gates...


1.Logic gates:AND,OR,NOT,NAND,NOR,X-OR,X-NOR
   • Logic Gates symbols,Truth tables,boolean e...  

2.All about AND gate
   • AND gate|Logic Gate|Basic gate  

3.All about NOT gate
   • NOT gate|Truth table,symbol,Boolean expres...  

4.All about OR gate
   • OR gate|Logic gate used for logical additi...  

5.2 & multiple input NAND gate
   • NAND gate 2 input and multiple input|Unive...  

6.2 & multiple input NOR gate
   • NOR gate |2-input and multiple input NOR g...  

7.2 & multiple input EX-OR gate
   • 2-input & multiple-input EX-OR gate|X-OR g...  

8.2 & multiple input EX-NOR gate
   • Exclusive NOR gate|2 and multiple input EX...  

9.De-Morgan's theorem 1 & De-Morgan's theorem 2
   • De-Morgan's Theorems 1 and 2 with their pr...  

10.Boolean laws
   • Boolean laws|AND laws|OR laws|Inversion la...  

11.Duality Theorem
   • Duality Theorem| How to find dual of Boole...  

12.Realization of Basic gates using NAND
   • Basic Gates NOT,AND,OR gate realization or...  

13.Realization of Basic gates using NOR
   • Basic Gates implementation using NOR  univ...  

14.Implement NAND using NOR
   • Design NAND gate using NOR gate  

15.Implement NOR using NAND
   • Design NOR gate using NAND gate  

16.Implement EX-OR using NAND
   • Implement EX-OR gate  using NAND gate  

17.Implement EX-NOR using NAND
   • EX-NOR using NAND gate  


Thanks 🙏🙏🙏🙏🙏 for watching the video.....
If you like the video please click on like,
subscribe the channel and don't forget to hit bell 🔔🔔 icon for recent videos!!!!!!!!