AP CSP Day 54: Bandwidth Limits

Big Idea 3: Algorithms & Programming
Cycle 2 • Day 54 Practice • Hard Difficulty
Focus: Boolean Logic

Practice Question

Consider the Boolean expression:

NOT (p AND q) OR (p AND NOT q)

For which combination of p and q does this expression evaluate to false?

Why This Answer?

When p=true and q=true: NOT(true AND true) OR (true AND NOT true) = NOT(true) OR (true AND false) = false OR false = false. This is the only combination that produces false.

Why Not the Others?

B) p=false, q=true: NOT(false AND true) OR (false AND NOT true) = NOT(false) OR (false AND false) = true OR false = true. C) p=false, q=false: NOT(false AND false) OR (false AND NOT false) = NOT(false) OR (false AND true) = true OR false = true. D) The expression does evaluate to false when both p and q are true.

Common Mistake
Watch Out!

Students try to simplify the expression algebraically and make errors, or they evaluate NOT(p AND q) without completing the full OR with the second sub-expression.

AP Exam Tip

For complex Boolean expressions, test each answer choice by substituting the values and evaluating step by step. Work inside-out: evaluate innermost expressions first.

Keep Practicing!

Consistent daily practice is the key to AP CSP success.

AP CSP Resources Get 1-on-1 Help
Back to blog

Leave a comment

Please note, comments need to be approved before they are published.