Lesson 1011: Introduction to Electronic Gates
There are two different ways to represent Boolean expressions. The
first you already have learned in the very beginning of this course.
Now you will learn electronic gate notation. In this form of notation,
each Boolean operator is represented by a different symbol. It is
important to memorize the symbols or print this chart out, because
it will become useful as you move along the lesson.
| AND | ![]() |
| OR | ![]() |
| NOT | ![]() |
| NAND | ![]() |
| XOR | ![]() |
| EQUIV | ![]() |
| NOR | ![]() |
Check your progress
DIGital