Perform each of the following binary arithmetic: i. 1011 x 1101; ii. 11000 —111 (6 marks)craft1 electrical June/July 2020

De Morgan’s theorems are two laws that relate the logical operations of negation (NOT) and conjunction (AND) and disjunction (OR). These laws can be used to manipulate logical expressions and simplify Boolean algebra calculations. The two theorems are:

1. The negation of a conjunction is the disjunction of the negations: ~(A AND B) = ~A OR ~B
2. The negation of a disjunction is the conjunction of the negations: ~(A OR B) = ~A AND ~B

These theorems can be used to simplify logical expressions by replacing a conjunction or disjunction with its negation, and then applying the appropriate theorem to obtain an equivalent expression in a different form.