Perform each of the following binary arithmetic:

i. 1011 x 1101;

ii. 11000 —111 (6 marks)craft1 electrical June/July 2020

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

i. 1011 x 1101;

1011

* 1101

—–

1011

1011

1101

—–

11100

ii. 11000 —111

1011

* 1101

—–

1011

1011

1101

—–

11100

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:

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.