Recognize and appropriately apply Boolean logic along with the construction and use of Truth Tables.

1. Correctly give the Truth Tables for the basic operations of "and" (symbol ∧), "or" (symbol ∨), and "not" (symbol ¬). For example, construct the truth table for a∧b.
   Web Content:
   • Holly Ourso: Truth Table Introduction 4:55 (only need first 3:04)
2. Correctly construct the truth tables for complex Boolean expressions of up to 4 terms possibly using parentheses. For example, construct the truth table for ¬(a∨b)∧(¬a).
   Web Content:
   • Holly Ourso: Truth Table expressions - 1 7:14
   • Holly Ourso: Truth Table expressions - 2 4:52
3. Correctly use truth tables to demonstrate de Morgan's Laws. For example, use truth tables to show that ¬(a∧b) is equivalent to (¬a)∨(¬b).
   Web Content:
   • Shaunteaches: DeMorgan's laws 5:53