Mathematical operators like +, -, /, * are used with variables to form algebraic expressions, like, a + b - c*d.
NOT, AND and OR are logical operators used to form logical expressions, such as, NOT French, English AND German, English OR German.
NOT operator
Not French - the only specification is that the person should not be French.
The Venn diagram below shows X as the set of French persons, the rest of the area, leaving X, represents those other than French, i.e. X. Thus, the bar negates X, or stands for the complement of X.
X
_
X
0
1
1
0
Truth Table for NOT operator
NOT operates on a single variable hence is a unary operator.
The AND operator
English AND German - our search is narrowed, as we can consider only those who know English as well as German. The logical AND operator is represented by '.' and is called logical multiplication. The Venn diagram shows the rectangle as all the available people, F is English speakers, H is German speakers and the overlapping part is people who know both. AND allows us to pick up only from the overlapped part.
X
Y
X . Y
0
0
0
0
1
0
1
0
0
1
1
1
Truth Table for AND operator
The truth table shows that if X and Y both, are 1, the result of X.Y is 1.
The OR operator
English OR German - our search is broadened, as we can consider people who know English, those who know German, or both. The logical OR operator is represented by '+' and is called logical addition. The Venn diagram shows the rectangle as all the available people, F is English speakers, H is German speakers and the overlapping part is people who know both. OR allows us to pick up from any of the areas covered by F and H.
Truth Table for OR operator
X
Y
X + Y
0
0
0
0
1
1
1
0
1
1
1
1
The truth table shows that if X or Y is 1, the result of X + Y is 1.
And, or, not, xor, nand, nor. There are a few others, too.
And, or, not , Those are the three key words
1 = * 2 = ? 3 = *?
The package Truth Tables and Boolean Algebra set out the basic principles of logic. Any Boolean algebra operation can be associated with an electronic circuit in which the inputs and outputs represent the statements of Boolean algebra. Although these circuits may be complex, they may all be constructed from three basic devices. These are the AND gate, the OR gate and the NOT gate.
There are three logical operators in C; AND (&), OR (|), and NOT (^). These are the bitwise versions. The combinatorial versions are &&, , and !.
Logical Operators are those that are used for doing logical operations. There are a total of 6 logical operators (&, |, ^, !, &&, and ‖) Of the six logical operators listed above, three of them (&, |, and ^) can also be used as "bitwise" operators. There are two non-short-circuit logical operators. • & non-short-circuit AND • | non-short-circuit OR There are two short-circuit logical operators • && short-circuit AND • short-circuit OR
What,How,When
5k 7 3k is a string of terms: it is not an equation (or inequality) and so cannot have an answer. It is not even an expression since there are no operators between the three terms.5k 7 3k is a string of terms: it is not an equation (or inequality) and so cannot have an answer. It is not even an expression since there are no operators between the three terms.5k 7 3k is a string of terms: it is not an equation (or inequality) and so cannot have an answer. It is not even an expression since there are no operators between the three terms.5k 7 3k is a string of terms: it is not an equation (or inequality) and so cannot have an answer. It is not even an expression since there are no operators between the three terms.
that is what even i am searching for?
Administrators Backup Operators Replicator
Yes
That's a list of three numbers. If you actually mean 'and' like in the Boolean operator and you write the numbers as binaries, then the result is zero.