Introduction: Making Sense of Logic

In your journey through Unit 2, you have learned how to use Selection to make decisions in code. But sometimes, there are multiple ways to write the same "question" or condition. Comparing Boolean Expressions is all about determining if two different-looking pieces of code actually do the same thing. This is a vital skill for the AP exam, especially when you are asked to simplify code or identify equivalent logic in the Multiple-Choice section.

Don't worry if logic feels like a brain-teaser at first! Think of this chapter as learning how to "translate" between different logical "dialects" to find the simplest way to say what you mean.

What are Equivalent Expressions?

Two boolean expressions are considered equivalent if they always produce the same result (either true or false) for every possible value of the variables involved.

Example: The expression "Is it NOT raining?" is equivalent to "Is it sunny OR cloudy OR snowing?" (assuming those are the only options). In Java, we often look for ways to rewrite complex logic to make it easier for humans to read without changing how the computer behaves.

The Secret Weapon: De Morgan’s Law

One of the most important tools for comparing and simplifying boolean expressions is De Morgan’s Law. Named after the mathematician Augustus De Morgan, these rules tell us how to "distribute" a NOT (the \( ! \) operator) across a compound expression.

There are two primary rules to memorize:

  1. Rule 1: \( !(A\ \&\&\ B) \) is equivalent to \( !A\ ||\ !B \)
  2. Rule 2: \( !(A\ ||\ B) \) is equivalent to \( !A\ \&\&\ !B \)
The "Flip" Trick

When you move a NOT (the \( ! \)) inside the parentheses, you must perform three steps:

  1. Apply the NOT to the first term.
  2. Flip the operator (AND becomes OR; OR becomes AND).
  3. Apply the NOT to the second term.

Quick Analogy: Imagine your parents say, "You cannot have both cake AND ice cream." That is the same as saying, "You must NOT have cake OR you must NOT have ice cream." If you have neither, you followed the rule. If you have only one, you followed the rule. The only way to break the rule is to have both!

Key Takeaway: When distributing a \( ! \), always remember to flip your \( \&\& \) to \( || \) (and vice versa)! This is the most common mistake students make on the AP exam.

Negating Relational Operators

When comparing boolean expressions that involve numbers, you often need to negate relational operators like \( < \) or \( == \). It’s important to remember that the "opposite" of a comparison must cover all possibilities.

Here is a quick reference guide:

  • The negation of \( < \) (less than) is \( >= \) (greater than or equal to).
  • The negation of \( > \) (greater than) is \( <= \) (less than or equal to).
  • The negation of \( == \) (equal to) is \( != \) (not equal to).

Did you know? A common trap is thinking the negation of "less than" is simply "greater than." But what if the numbers are exactly equal? That is why you must include the "or equal to" part when negating \( < \) or \( > \).

Example:
Suppose we have: \( !(x < 5\ \&\&\ y == 10) \)
Using De Morgan's Law, we distribute the \( ! \) and flip the operator:
Result: \( (x >= 5\ ||\ y != 10) \)

Proving Equivalence with Truth Tables

If you are ever unsure if two expressions are equal, you can use a Truth Table. This is a chart that lists every possible combination of true (T) and false (F) for your variables.

Let's prove \( !(A\ \&\&\ B) == !A\ ||\ !B \):

\( \begin{array}{|c|c|c|c|c|c|c|} \hline A & B & A\ \&\&\ B & !(A\ \&\&\ B) & !A & !B & !A\ ||\ !B \\ \hline T & T & T & \mathbf{F} & F & F & \mathbf{F} \\ \hline T & F & F & \mathbf{T} & F & T & \mathbf{T} \\ \hline F & T & F & \mathbf{T} & T & F & \mathbf{T} \\ \hline F & F & F & \mathbf{T} & T & T & \mathbf{T} \\ \hline \end{array} \)

Since the column for \( !(A\ \&\&\ B) \) and the column for \( !A\ ||\ !B \) are identical, we have mathematically proven they are equivalent!

Common Pitfalls to Avoid

  • The "Lazy Not": Forgetting to negate the second half of the expression. \( !(A\ \&\&\ B) \) is not \( !A\ \&\&\ B \).
  • The "No-Flip": Forgetting to change the \( \&\& \) to \( || \) when distributing a NOT.
  • Redundant Logic: Writing expressions like if (isRaining == true). Since isRaining is already a boolean, if (isRaining) is equivalent and cleaner!

Quick Review

Practice Question: Which of the following is equivalent to \( !(x\ !=\ 3\ ||\ y\ >\ 2) \)?

Step 1: Apply NOT to the first part: \( !(x\ !=\ 3) \) becomes \( x\ ==\ 3 \).
Step 2: Flip the operator: \( || \) becomes \( \&\& \).
Step 3: Apply NOT to the second part: \( !(y\ >\ 2) \) becomes \( y\ <=\ 2 \).
Answer: \( x\ ==\ 3\ \&\&\ y\ <=\ 2 \)

Key Takeaways Summary:
  • Equivalent expressions always yield the same result for the same inputs.
  • De Morgan's Law: \( !(A\ \&\&\ B) \equiv\ !A\ ||\ !B \) and \( !(A\ ||\ B) \equiv\ !A\ \&\&\ !B \).
  • When negating comparisons, always remember the "boundary" (e.g., the negation of \( > \) is \( <= \)).
  • Truth Tables are a foolproof way to check if two expressions are the same.