BOOLEAN LOGIC B

DAY 1 – REVIEW OF BOOLEAN LOGIC A

separator-blank.png

DAY 1 – THEORY REVIEW

PART A – READ OVER BOOLEAN LOGIC A LESSONS

Start by reading over the lessons in Boolean Logic A. 

PART B – ANSWER THE FOLLOWING QUESTIONS

Do the following review work:

QUESTION #1
What is the logic gate symbol for:

a)    AND

b)    OR

c)     NOT

d)    NOR

e)    NAND

f)      XOR

g)    XNOR



QUESTION #2
What is the truth table for each of the gates listed in #1?


QUESTION #3
Answer the following questions:

a) Which gate only has one input?

b) Which gate outputs 1 only if both inputs are 1?

c) Which gate outputs 0 only if both inputs are 1?

d) Which gate outputs 1 if either of its two inputs are 1?

e) Which gate outputs 1 only if its two inputs are different?

f) Which gate outputs 1 only if its two inputs are the same?

g) Which gate is equivalent to an AND followed by NOT?

h) Which gate is also called an inverter?

i) Instead of using TRUE and FALSE, we use ____ and ____.

j) If a circuit has 2 inputs, how many rows will its truth table have?

k) If a circuit has 3 inputs, how many rows will its truth table have?

l) If a circuit has 4 inputs, how many rows will its truth table have?

m) If a circuit has n inputs, how many rows will its truth table have?


QUESTION #4
Draw the circuit diagram for the following equations:

a) A AND B = Q

b) NOT(A XOR B) = Q

c) A OR (B NAND C) = Q

d) NOT(A) XNOR B = Q


QUESTION #5

Draw the truth table (logic table) for each circuit diagram in #4.


QUESTION #6

a) How does one check if two circuits are equivalent?

b) Are the following two circuits equivalent?  Show your work.

          A NOR (B AND C) = Q

          (B XOR C) AND NOT(A) = Q

QUESTION #7
There are only 16 possible 2-input truth table output columns.  This means that all 2-input circuits is equivalent to one of these 16 basic circuits.  We can use this to simplify 2-input circuits.

Simplify the following:

a) A OR B AND A = Q

b) NOT(A) AND NOT(B) = Q

c) NOT (A AND B) = Q

separator-campeau.png