Boolean Algebra

Question 1

What is De Morgan’s First Law ?

Answer 1

¬(A v B) == ¬A ^ ¬B

Question 2

What is De Morgan’s Second Law?

Answer 2

¬(A ^ B) == ¬A v ¬B

Question 3

What is Commutation?

Answer 3

A ^ B == B ^ A

A v B == B v A

Question 4

What is Absorption?

Answer 4

A v (A ^ B) == A
A ^ (A v B) == A

Question 5

What is Distribution?

Answer 5

A ^ (B v C) == (A ^ B) v (A ^ C) ^ (C v D) == (A ^ C) v (A ^ D) v (B ^ C) V (B ^ D)

Question 6

What is Double Negation?

Answer 6

¬¬A == A

Question 7

How does a Full Adder Work?

Answer 7

A Full adder is used to calculate binary additions A and B are the two values, whereas C is the carry. The XOR gates are used in order to block two ones, in order to simulate the fact that they are carried, as the and gates are used to determine if there is a carry value, as if both A and B are on, then the value will be a carried, due to an overflow error and blocked from the main output and put into the carry

Question 8

What is the layout for a Full Adder?

Answer 8

Link to an Image

– https://circuitglobe.com/wp-content/uploads/2015/12/HALF-ADDER-FULL-ADDER-FIG-2-compressor.jpg –

Question 9

What is a Flip-Flop?

Answer 9

Flip flops are Boolean gates, that can trap a value. The circuit is updated every clock cycle. If the input is on and the clock cycle is on a rise, the input will be on, however if the clock is off or not on a rise, then it will not update the output regardless of the clock.

Question 10

What is the purpose of a Flip-Flop?

Answer 10

To store data of a bit between clock cycles