Computer Science, asked by nageshsalvankar, 9 months ago

explain. demorgan first and second law with logic symbol truth table and cases

Answers

Answered by Anonymous
0

Answer:

DeMorgan's First theorem proves that when two (or more) input variables are AND'ed and negated, they are equivalent to the OR of the complements of the individual variables. Thus the equivalent of the NAND function and is a negative-OR function proving that A.B = A+B

Similar questions