1.4.3: Boolean Algebra

Question 1

What is a Truth Table?

Answer 1

• A table showing every possible output for inputs of a logic gate

Question 2

What are all of De Morgan’s Laws?

Answer 2

• A ^ (B V C) = (A ^ B) V (A ^ C)
• A V (B ^ C) = (A V B) ^ (A V C)
• A ^ (B ^ C) = (A ^ B) ^ (A ^ C)
• A V (B V C) = (A V B ) V (A V C)
• (A ^ B) ^ C = A ^ (B ^ C) = A ^ B ^ C
• (A V B) V C = A V (B V C) = A V B V C

Question 3

What is a D-Type Flip Flop?

Answer 3

• A type of logic circuit which can store the value of one bit

Question 4

What inputs does a Flip Flop have?

Answer 4

• Two inputs: A Control Signal, and a Clock Input

Question 5

What is a Clock Input?

Answer 5

• The regular pulse of the CPU used to coordinate operations
• The pulse rises and falls, with edges labelled rising or falling

Question 6

When does the output of a D-Type Flip Flop change?

Answer 6

• Only at a Rising Edge, the start of a clock tick

Question 7

What is a Flip Flop?

Answer 7

• A basic unit of memory

Question 8

What can Flip Flops be combined to form?

Answer 8

• Registers

Question 9

How do Half Adders work?

Answer 9

• When both A and B are False, both outputs are False
• When either A or B are True, Sum (S) is True
• When both inputs are True, Carry (C) is True

Question 10

Why can Full Adders be chained together?

Answer 10

• Because Full Adders have the Carry input, circuits can be chained together to form Ripple Adders