This document discusses Boolean logic and truth tables. It introduces Boolean operations like NOT, AND, OR, and XOR. It explains how to represent conditions and combinations of operations using truth tables. Finally, it discusses applications of Boolean logic in areas like internet searching, databases, and computer programming. Students are assigned a math review as Assignment 5 due in 2 weeks.

1. TRUTH OR CONSEQUENCES
Class 6 –TruthTables and Boolean Logic

2. Introduction
 Logic, Problem Solving, and Creativity
 From Gottlob Frege to Google Search
 George Boole – early 19th century
 Gottlob Frege, Charles Pierce – mid 19th century
 Emil Post, LudwigWittgenstein, and JohnVenn –
late 19th and early 20th centuries
 ENIAC – mid 20th century
 BackRubGoogolGoogle (1997)
 Y2K:World Domination? Google Earth!

3. Agenda
 Review and Debrief
 LateralThinking
 Assignments, etc.
 Boolean Math &TruthTables
 Propositional Logic
 Boolean Operations
 QuestTopic:
 Ruby Math and formatting features
 Project 1: Calculator/Converter

4. Review & Debrief
 Assignment Returned
 Noted
 Challenges, inspirations?
 Website Resources
 LateralThinking

5. Truth Tables
 What is the truth?
 Propositional Logic
 True/false
 Yes/No
 1/0
 On/Off

6. Conditions & Operations
 What is a condition?
 Logical Operations
 NOT (~)
 AND (^)
 OR (v)
 XOR (⊕)

7. Conditions & Operations - NOT
 Condition A = <25 years-old
A ~A
F T
T F

8. Conditions & Operations - NOT
 Condition B = green eyes
B ~B
F T
T F

9. Conditions & Operations - AND
 Condition A=<25 years-old
 Condition B = green eyes
A B A ^ B
F F F
F T F
T F F
T T T

10. Conditions & Operations - OR
 Condition A=<25 years-old
 Condition B = green eyes
A B A v B
F F F
F T T
T F T
T T T

11. Conditions & Operations - XOR
 Condition A=<25 years-old
 Condition B = green eyes
A B A ⊕ B
F F F
F T T
T F T
T T F

12. Combining Operations
 Condition A=<25 years-old
 Condition B = green eyes
A B A ^ B ~( A ^ B )
F F F T
F T F T
T F F T
T T T F

13. Logical Equivalence
 Condition A=<25 years-old
 Condition B = green eyes
A B ~A ~B A ^ B ~( ~A v ~B )
F F T T F F
F T T F F F
T F F T F F
T T F F T T

14. Exercises
 Parenthetic Expressions
 NSCC Grading Policy
 Prior Learning Assessment at NSCC

15. Boolean Operations & Computing
 Boolean Operations in Internet Searches
 Filter and fine-tune searches
 Fewer and better results
 Boolean Operations in Databases
 Filter and fine-tune searches
 Fewer and better results
 Analysis and reporting
 Writing Code
 Conditional logic

16. Summary
 Propositional Math
 Boolean Logic &TruthTables
 Operations
 Negation
 Conjunction
 Disjunction
 Exclusive Disjunction
 Applying to real-world/ computing problems
 Assignment 5 – Math Review

17. Assignment
 Assignment 5: Math Review
 Grade 5%
 Due: 2 weeks