From Wikiversity - Reading time: 2 min
| Type classification: this is a lesson resource. |
Welcome! This is a lesson in the Introductory Discrete Mathematics for Computer Science course here at Wikiversity.
Previous lesson: Logical XOR
The conditional operator looks like this:
It is a dyadic operator.
Perhaps I should explain conditional operators through a story. Let's suppose that Joe Lion is given a wildebeest if he beats Handsome Dan XVII. Thus, becomes "Joe Lion beats Handsome Dan" and becomes "Joe Lion is given a wildebeest." The order of p and q are important, and so p and q are given special terms when the conditional operator is used. p is the antecedent. q is the consequent.
There are four possible outcomes in this story:
1. Joe Lion beats Handsome Dan, and is given a wildebeest. (p is true and q is true)
2. Joe Lion beats Handsome Dan, but is not given a wildebeest. (p is true and q is false)
3. Joe Lion does not beat Handsome Dan, yet is given a wildebeest. (p is false and q is true)
4. Joe Lion does not beat Handsome Dan, and is not given a wildebeest. (p is false and q is false)
| T | T | T |
| T | F | F |
| F | T | T |
| F | F | T |
The next lesson is called Biconditional Operator.