Page 85 - Toucpad robotics C11

Let’s understand the three primary Boolean operators: AND, OR, and NOT.

The Boolean Operators and Their Meaning:
To understand these operators, we often use truth tables, which show all possible input combinations and the resulting
output.

AND Operator
Meaning: The AND operator checks if all conditions connected by it are True. The overall result is True ONLY IF all
u
input conditions are True. If even one input condition is False, the output will be False.
Symbol: Often represented by ‘^’ (logical AND), ‘•’ (multiplication dot), or simply by no symbol between variables
u
(like AB). In programming languages, it is usually written as && (in C, C++, Java) or and (in Python).
Truth Table:
u
Input A Input B A AND B
False (0) False (0) False (0)

False (0) True (1) False (0)
True (1) False (0) False (0)
True (1) True (1) True (1)

Analogy: Think of needing both a specific key and a password to open a locked door. If you have only the key, or only
u
the password, or neither, you cannot open the door. You need both (or all) conditions to be met.
OR Operator

Meaning: The OR operator checks if at least one of the conditions connected by it is True. The overall result is True IF
u
any of the input conditions is True. The output is False ONLY IF all input conditions are False.
Symbol: Often represented by ‘v’ (logical OR), ‘+’ (addition sign), or ‘||’ or or in programming.
u
Truth Table:
u
Input A Input B A OR B

False (0) False (0) False (0)
False (0) True (1) True (1)

True (1) False (0) True (1)
True (1) True (1) True (1)

Analogy: Think of a shop that accepts payment by cash OR credit card. If you have cash, you can pay. If you have a
u
credit card, you can pay. If you have both, you can still pay. You can only NOT pay if you have neither.
NOT Operator
Meaning: The NOT operator inverts the logical state of a single condition. If the input is True, the output is False. If the
u
input is False, the output is True.
Symbol: Often represented by ‘¬’ (logical NOT), a bar over the variable (A), or ‘!’ or not in programming.
u
Truth Table:
u
Input A Not A

False (0) True (1)
True (1) False (0)

Analogy: If the traffic light is NOT green, then it must be red or yellow.
u
83
Computing System