Scribd
Upload
27 views2 pages

Industrial Automation Assignment: Boolean Algebra

The document discusses a Boolean algebra assignment involving logic gates. It includes: 1) A statement that if certain Boolean expressions are false, then E will be true. 2) A Boolean logic expression for E in terms of variables A through F. 3) A truth table showing the output of the expression for all possible inputs.

Uploaded by

reza
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
27 views2 pages

Industrial Automation Assignment: Boolean Algebra

The document discusses a Boolean algebra assignment involving logic gates. It includes: 1) A statement that if certain Boolean expressions are false, then E will be true. 2) A Boolean logic expression for E in terms of variables A through F. 3) A truth table showing the output of the expression for all possible inputs.

Uploaded by

reza
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Mohammad Alfian Ghiffari

0241 16 40000 075 / Q-CLASS

INDUSTRIAL AUTOMATION ASSIGNMENT:


BOOLEAN ALGEBRA

1. If A is false and B is true, are false, or if, C is true while D is false or E is false and F is true, are false, then E
will be true.
2. Boolean Logic:

=
. +
+ .
.
3. Truth table:

A B C D E F
.
. . + .
.
.
. + .
. +
. + .
0 0 0 0 0 0 1 1 1 0 0 0 0 1 1 1
0 0 0 0 0 1 1 1 1 0 0 1 1 1 0 1
0 0 0 0 1 0 1 1 0 0 0 0 0 1 1 1
0 0 0 0 1 1 1 1 0 0 0 0 0 1 1 1
0 0 0 1 0 0 1 0 1 0 0 0 0 1 1 1
0 0 0 1 0 1 1 0 1 0 0 1 1 1 0 1
0 0 0 1 1 0 1 0 0 0 0 0 0 1 1 1
0 0 0 1 1 1 1 0 0 0 0 0 0 1 1 1
0 0 1 0 0 0 1 1 1 0 1 0 1 1 0 1
0 0 1 0 0 1 1 1 1 0 1 1 1 1 0 1
0 0 1 0 1 0 1 1 0 0 1 0 1 1 0 1
0 0 1 0 1 1 1 1 0 0 1 0 1 1 0 1
0 0 1 1 0 0 1 0 1 0 0 0 0 1 1 1
0 0 1 1 0 1 1 0 1 0 0 1 1 1 0 1
0 0 1 1 1 0 1 0 0 0 0 0 0 1 1 1
0 0 1 1 1 1 1 0 0 0 0 0 0 1 1 1
0 1 0 0 0 0 1 1 1 1 0 0 0 0 1 1
0 1 0 0 0 1 1 1 1 1 0 1 1 0 0 0
0 1 0 0 1 0 1 1 0 1 0 0 0 0 1 1
0 1 0 0 1 1 1 1 0 1 0 0 0 0 1 1
0 1 0 1 0 0 1 0 1 1 0 0 0 0 1 1
0 1 0 1 0 1 1 0 1 1 0 1 1 0 0 0
0 1 0 1 1 0 1 0 0 1 0 0 0 0 1 1
0 1 0 1 1 1 1 0 0 1 0 0 0 0 1 1
0 1 1 0 0 0 1 1 1 1 1 0 1 0 0 0
0 1 1 0 0 1 1 1 1 1 1 1 1 0 0 0
0 1 1 0 1 0 1 1 0 1 1 0 1 0 0 0
0 1 1 0 1 1 1 1 0 1 1 0 1 0 0 0
0 1 1 1 0 0 1 0 1 1 0 0 0 0 1 1
0 1 1 1 0 1 1 0 1 1 0 1 1 0 0 0
0 1 1 1 1 0 1 0 0 1 0 0 0 0 1 1
0 1 1 1 1 1 1 0 0 1 0 0 0 0 1 1
1 0 0 0 0 0 0 1 1 0 0 0 0 1 1 1
1 0 0 0 0 1 0 1 1 0 0 1 1 1 0 1
1 0 0 0 1 0 0 1 0 0 0 0 0 1 1 1
1 0 0 0 1 1 0 1 0 0 0 0 0 1 1 1
1 0 0 1 0 0 0 0 1 0 0 0 0 1 1 1
1 0 0 1 0 1 0 0 1 0 0 1 1 1 0 1
1 0 0 1 1 0 0 0 0 0 0 0 0 1 1 1
1 0 0 1 1 1 0 0 0 0 0 0 0 1 1 1
1 0 1 0 0 0 0 1 1 0 1 0 1 1 0 1
1 0 1 0 0 1 0 1 1 0 1 1 1 1 0 1
1 0 1 0 1 0 0 1 0 0 1 0 1 1 0 1
1 0 1 0 1 1 0 1 0 0 1 0 1 1 0 1
1 0 1 1 0 0 0 0 1 0 0 0 0 1 1 1
1 0 1 1 0 1 0 0 1 0 0 1 1 1 0 1
1 0 1 1 1 0 0 0 0 0 0 0 0 1 1 1
1 0 1 1 1 1 0 0 0 0 0 0 0 1 1 1
1 1 0 0 0 0 0 1 1 0 0 0 0 1 1 1
1 1 0 0 0 1 0 1 1 0 0 1 1 1 0 1
1 1 0 0 1 0 0 1 0 0 0 0 0 1 1 1
1 1 0 0 1 1 0 1 0 0 0 0 0 1 1 1
1 1 0 1 0 0 0 0 1 0 0 0 0 1 1 1
1 1 0 1 0 1 0 0 1 0 0 1 1 1 0 1
1 1 0 1 1 0 0 0 0 0 0 0 0 1 1 1
1 1 0 1 1 1 0 0 0 0 0 0 0 1 1 1
1 1 1 0 0 0 0 1 1 0 1 0 1 1 0 1
1 1 1 0 0 1 0 1 1 0 1 1 1 1 0 1
1 1 1 0 1 0 0 1 0 0 1 0 1 1 0 1
1 1 1 0 1 1 0 1 0 0 1 0 1 1 0 1
1 1 1 1 0 0 0 0 1 0 0 0 0 1 1 1
1 1 1 1 0 1 0 0 1 0 0 1 1 1 0 1
1 1 1 1 1 0 0 0 0 0 0 0 0 1 1 1
1 1 1 1 1 1 0 0 0 0 0 0 0 1 1 1

4. Pascal program:

IF NOT (NOT A AND B) OR NOT ((C AND NOT D) OR (NOT E AND F)) THEN
E := TRUE
ELSE
E := FALSE

5. Boolean logic gate

A
B
E
C
D
E
F

You might also like