LOGIC GATES

AND
BOOLEAN EXPRESSIONS
 OBJECTIVES
Recall the logic gates
Analyze and create a logic circuit for a statement
 NOT

NOT gates are the only gate that has a single input. Input Output

They reverse the input:

1 0
If 1 is passed in, then 0 is passed out
If 0 is passed in, then 1 is passed out 0 1

Draw a Truth Table for a NOT gate.

 AND

AND gates have two inputs and a single output.

X = A AND B (logic notation) Input A Input B Output
X = A . B (Boolean algebra

1 1 1
They only output true if BOTH inputs are true
1 0 0
In the case of logic gates, 0 1 0
1 = True and 0 = False
0 0 0
Draw a Truth Table for an AND gate.
 OR

Input A Input B Output

OR gates have two inputs and a single output.
1 1 1
They output true if EITHER of the inputs are true 1 0 1
0 1 1

Draw a Truth Table for an OR gate. 0 0 0

 NAND

NAND gates are a combination of a NOT & an AND gate

They output true if EITHER of the inputs are NOT True

Draw a Truth Table for a NAND gate. Input Input B Output

A
1 1 0
1 0 1
0 1 1
0 0 1
 NOR

NOR gates are a combination of a NOT & an OR gate Input Input B Output
A
They output true if BOTH of the inputs are False 1 1 0
1 0 0
Draw a Truth Table for a NOR gate. 0 1 0
0 0 1
 XOR

XOR gates are a special gate known as Exclusive OR

They output true if one input is True and the other is False
X=(NOT A AND B)+(A AND NOT B) or X=A ⊕ B Input Input B Output
In a Boolean Expression, these are A
written as ⊕
1 1 0
Draw a Truth Table for a XOR gate. 1 0 1
0 1 1
0 0 0
Draw the circuit diagram that will represent the expression P = NOT (A AND B)
Create a logic circuit for the given logic
statement.
1. Y = NOT((A and B) OR (NOT C))
Create a truth table for the given logic
circuit A B C D E F Y
0 0 0 0 1 1 0

0 0 1 0 0 0 1
0 1 0 0 1 1 0
0 1 1 0 0 0 1
1 0 0 0 1 1 0
1 0 1 0 0 0 1
1 1 0 1 1 1 0
1 1 1 1 0 1 0
https://www.bitsofbytes.co/exam-questions---logic-gates.html