Review of Boolean logic, selection statements, iteration loops, and string algorithms for AP Computer Science A.
20 cards
Front
Short-Circuit Evaluation
Back
The process where the result of a logical AND (&&) or OR (||) operation is determined without evaluating both operands. In (A && B), if A is false, B is not evaluated. In (A || B), if A is true, B is not evaluated.
Front
De Morgan's Laws
Back
Rules used to simplify complex Boolean expressions. They state that !(A && B) is equivalent to !A || !B, and !(A || B) is equivalent to !A && !B. Useful for negating if conditions.
Front
Precedence of Logical Operators
Back
The order in which logical operators are evaluated: NOT (!) has the highest precedence, followed by AND (&&), and then OR (||). Parentheses () should always be used to ensure the intended order of operations.
Front
Compound Boolean Expressions
Back
Expressions that combine multiple Boolean values using logical operators. Example: (x > 0 && x < 10) checks if x is between 0 and 10.
Front
Relational Operators
Back
Operators that compare two values and return a boolean result. They include == (equal to), != (not equal to), < (less than), > (greater than), <= (less than or equal to), and >= (greater than or equal to).
Sign up to access the full deck with spaced repetition review.
Sign Up — Free