15.02 - Boolean Algebra

Question 1

Half adder circuit

Answer 1

Carries out binary addition on two bits giving sum and carry

Question 2

Full adder circuit

Answer 2

Two half adders combined to allow the sum of several binary bits

Question 3

Combination circuit

Answer 3

Circuit in which the output depends entirely on the input values

Question 4

Sequential circuit

Answer 4

Circuit in which the output depends on input values produced from previous output

Question 5

Flip-flop circuit

Answer 5

Electronic circuits with two stable conditions using sequential circuits

Question 6

Cross-coupling

Answer 6

Interconnection between two logic gates which make up a flip-flop

Question 7

Positive feedback

Answer 7

The output from the process which influences the next input value to the process

Question 8

Sum of products (SoP)

Answer 8

A Boolean expression containing AND and OR terms

Question 9

Gray codes

Answer 9

Ordering of binary numbers such that successive numbers differ by one bit value only, for example, 00 01 11 10

Question 10

Karnaugh maps (K-maps)

Answer 10

A method used to simplify logic statements and logic circuits - uses Gray codes