Download presentation

Presentation is loading. Please wait.

1
**IB Computer Science – Logic**

Truth Tables and Logical Equivalence

2
**Evaluating by truth table**

What is the truth value of the logical expression NOT A AND (A OR B)? We can find this by evaluating the component values with a truth table.

3
**Evaluating by truth table**

NOT A A OR B NOT A AND (A OR B) 1

4
**Evaluating by truth table**

NOT A A OR B NOT A AND (A OR B) 1

5
**Evaluating by truth table**

NOT A A OR B NOT A AND (A OR B) 1

6
**Evaluating by truth table**

NOT A A OR B NOT A AND (A OR B) 1

7
**Evaluating by truth table**

Evaluate (NOT B AND A) AND (B OR NOTA). We can find this by evaluating the component values with a truth table.

8
**Evaluating by truth table**

NOT A NOT B NOT B AND A B OR NOTA (NOT B AND A) AND (B OR NOTA) 1

9
**Evaluating by truth table**

NOT A NOT B NOT B AND A B OR NOTA (NOT B AND A) AND (B OR NOTA) 1

10
**Evaluating by truth table**

NOT A NOT B NOT B AND A B OR NOTA (NOT B AND A) AND (B OR NOTA) 1

11
**Evaluating by truth table**

NOT A NOT B NOT B AND A B OR NOTA (NOT B AND A) AND (B OR NOTA) 1

12
**Evaluating by truth table**

NOT A NOT B NOT B AND A B OR NOTA (NOT B AND A) AND (B OR NOTA) 1

13
**Evaluating by truth table**

NOT A NOT B NOT B AND A B OR NOTA (NOT B AND A) AND (B OR NOTA) 1

14
**Evaluating by truth table**

Similar presentations

© 2024 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google