Build truth tables AND, OR, NOT, NAND, NOR, XOR

1.

2.

build truth tables AND, OR,
NOT, NAND, NOR, XOR
learning objectives
Evaluation
criteria
• can explain the logical operations
• can solve logical problems
• can build circuits for logical
operations

3.

Boolean functions derive their name from
the remarkable English mathematician
George Boole (1815-1864), who first
began to apply mathematical methods in
logic.

4.

conjunction
disjunction
inversion
exclusive disjunction

5.

Fill the truth table
Input A
Input B
0
0
0
1
1
0
1
1
The truth table reflects the fundamental property
of the AND gate: the output of A AND B is 1 only if
A and B are both 1
Output C

6.

Fill the truth table
Input A
Input B
0
0
0
1
1
0
1
1
The truth table reflects the fundamental property of
the OR gate: the output of A OR B is 1 if at least one
of inputs is equal to 1
Output C

7.

8.

The NAND gate is an amalgamation of the AND and NOT gates,
which inverts the output of the AND gate
Fill the truth table
Input A
Input B
0
0
0
1
1
0
1
1
Output C

9.

Fill the truth table
Input A
Input B
0
0
0
1
1
0
1
1
This gate only produces an output of true when both
inputs are false
Output C

10.

Fill the truth table
Input A
Input B
0
0
0
1
1
0
1
1
Output C
This gate is similar to the OR
gate but excludes the condition
where A and B are both true

11.

Write the Boolean expression for the following
schemes
x
x
y
y
Answer:
xy
xy
xy

12.

Websites for drawing diagrams
https://logic.ly/demo
https://circuitverse.org/simulator
Example: Q= (A*B)+not B

13.

Work in pairs
Draw a diagram and fill the truth table to the following expressions
1
4
2
5
3
6

14.

What has been learned?
What remained unclear?
What is necessary to work on?