Logic De Morgans Law Truth Tables Short Circuit

Logic De. Morgan’s Law Truth Tables Short Circuit Evaluation

De. Morgan’s Law § Let’s revisit the following code: § boolean teenager = 13 <= age && age < 20; § boolean senior = age >= 65; § if( !teenager && !senior )

De. Morgan’s Law § Someone who is not a teenager AND not a senior looks like this in a truth table: T S !T && !S T T F F F T § Notice that in the !T && !S column only one entry is True § If you’re really clever, you might even recognize that the column appears very similar to an OR truth table

De. Morgan’s Law § Logically, we can conclude that !T && !S == !(T || S) T S !T && !S T || S !(T || S) T T F T F F F T § On a number line: 0 13 20 65

De. Morgan’s Law § Equivalence gives us a way of knowing our code is correct § Also gives us an alternative way to describe a conditional statement that may be simpler § Here is someone that is not a teenager: § if(! (( age >= 13 ) && ( age < 20)) ) § Note the extra parenthesis required since NOT would be done first! § if( !(age >= 13 ) || !(age < 20) )//De. Morgan’s Law § if( age < 13 || age >= 20 ) § Not a teenager is also someone who is less than 13 or at least 20 § In general, it is always best to use the simplest statement!

De. Morgan’s Law – Venn Diagrams De. Morgan’s Law § !(A && B) = !A || !B § Similarly, § !(A || B) = !A && !B

Converting § You might have done something like this in math: § 3 x 2 + 6 = 3(x 2 + 2) § You can think of De. Morgan’s Law in a similar way § Here’s the process § “Factor” out the ! § Flip the Operator (AND/OR)

Converting § Ex. § !A && !B § !(A && B) //Factor out the ! § !(A || B) //Flip the operator § !A && !B == !(A||B)

Converting § Ex. § A || !B § It appears challenging to factor out a ! In this example since A does not have one § A == !!A § A || !B == !!A || !B § !(!A || B) //Factor out the ! § !(!A && B) //Flip the operator § A || !B == !(!A&&B)

Converting – You try and Verify § Ex. § !A && B

Converting – You try and Verify § Ex. § !A && B !A && !!B !(A && !B) !(A || !B) A B !A !B !A && B A||!B !(A||!B) T T F F F T F T F F T T

Practice § For each statement, use De. Morgan’s Law to construct 2 logical expressions (check 1 with a truth table) § R = It is raining § C = It is cold § If it is not raining and it is not cold § “Go to the park” § If it is not raining and it is cold § “Bring a jacket to the park” § If it is raining and it is not cold § “Bring an umbrella to the park” § If it is raining and it is cold § “Stay home”

Practice § For each statement, use De. Morgan’s Law to construct 2 logical expressions § R = It is raining § C = It is cold § !R && !C == !(R || C) § “Go to the park” § !R &&C == !(R||!C) § “Bring a jacket to the park” § R &&!C == !(!R||C) § “Bring an umbrella to the park” § R&&C == !(!R||!C) § “Stay home”

Practice § For each statement, use De. Morgan’s Law to construct 2 logical expressions (check 1 with a truth table) § T = Restaurant serves Thai food § C = Restaurant accepts coupons § If the restaurant does not serve Thai or the restaurant does not accept coupons § “Mr Joyce would prefer to eat somewhere else” § If the restaurant serves Thai food or the restaurant does not accept coupons § “Mr Joyce won’t complain” § If the restaurant does not serve Thai food or the restaurant accepts coupons § “Mr Joyce would be willing to try it” § If the restaurant serves Thai food or the restaurant accepts coupons § “Mr Joyce will be happy”

Practice § For each statement, use De. Morgan’s Law to construct 2 logical expressions § T = Restaurant serves Thai food § C = Restaurant accepts coupons § !T || !C == !(T&&C) § “Mr Joyce would prefer to eat somewhere else” § T || !C == !(!T&&C) § “Mr Joyce won’t complain” § !T || C == !(T&&!C) § “Mr Joyce would be willing to try it” § T || C == !(!T&&!C) § “Mr Joyce will be happy”

Short Circuit Evaluation § Let’s look at the truth tables for AND and OR: X T T F F n n Y T F X AND Y T F F F X T T F F Y T F X OR Y T T T F Notice that when one value is true, it does not matter what the others are, OR will be true Notice that when one value is false, it does not matter what the others are, AND will be false

Java is Lazy? § Java uses short circuit evaluation to evaluate conditions. § This means that: § if( TRUE || (other conditions) ) § Java ignores everything after the || since the result will be true no matter what else is combined § if( FALSE && (other conditions) ) § Java ignores everything after the && since the result will be false no matter what else is combined

Short Circuit Evaluation § This is a useful programming feature to prevent errors from happening: § Ex. § if(100 / number < 10) { programming statements… } § As good programmers we should check that we’re not going to divide by 0 § if( (number != 0) && (100 / number < 10)) { programming statements… } § Due to short circuit evaluation, the division will not happen if number == 0 since that makes the statement number != 0 false and the rest is ignored § Greenfoot example: § if( character. get. World() != null && character. is. Touching( Enemy. class) )

Nesting statements § Nesting conditions can make it easier to understand § Using && is equivalent to nesting an if statement § This is thanks to short circuiting § Here is the condition of a teenage boy if(gender. equals(“male”) && (13 <= age) && (age <= 19)) { programming statements… } § Is equivalent to: if(gender. equals(“male”))//must be male to make it in {} { if(13 <= age) && (age <= 19))//teenager { programming statements… } } § Which is equivalent to: if(gender. equals(“male”))//must be male to make it in {} { if(13 <= age) //must be >= 13 { if(age <= 19)//teenager { programming statements… } } }

Rearrange the expression § Rewrite the expression to take advantage of short circuiting § if( (is. Tall. Enough || has. Parent) && has. Tickets )//can ride § Here are some examples to help your decision: § is. Tall. Enough = false § has. Parent = true § has. Tickets = false

Rearrange the expression § Rewrite the expression to take advantage of short circuiting § if( ((student || senior) && has. ID) || has. Coupon || is. Employee)//get discount § Here are some examples to help your decision: § § § student = false senior = true has. ID = false has. Coupon = false is. Employee = true

What’s wrong? § Rewrite the expression to fix it § String key = Greenfoot. get. Key(); § if((k. compare. To(“left”) == 0 || key. compare. To(“a”) == 0) && key != null) § set. Location(get. X() – speed_, get. Y());

Minterms § Minterms give us a way to construct a logical statement from a truth table § It is not always the simplest or most efficient way § Minterms exploit the way § && is true only when ALL statements are true § || is true when any of the statements are true

Minterms § Suppose we had the following problem to code: § Goldilocks will sneak into your home if: § She is hungry and you have 3 bowls of porridge (S, M, L) § She needs to rest and you have 3 chairs (S, M, L) § She is tired and you have 3 beds (S, M, L) § Let’s write a method: § public boolean visit( boolean is. Hungry, boolean needs. Rest, boolean is. Tired, int bowls, int chairs, int beds)

Minterms § Let’s list the situations where Goldilocks WILL visit § is. Hungry && bowls == 3 § needs. Rest && chairs == 3 § is. Tired && beds == 3 § Each of these is what we call a minterm § The result of her visit is when one of them is true § (is. Hungry && bowls == 3) || (needs. Rest && chairs == 3) || (is. Tired && beds == 3) § OR will be true when one is true

Java code public boolean visit( boolean is. Hungry, boolean needs. Rest, boolean is. Tired, int bowls, int chairs, int beds) { return (is. Hungry && bowls == 3) || (needs. Rest && chairs == 3) || (is. Tired && beds == 3); } § Other code is possible (and even preferable) but this method will generate one of the answers

Ex. 2 § Wayne likes to play hockey (you might say he’s “great” at it). § If it is a school night and he doesn’t have homework and he is home by 10 pm (22 on a 24 hour clock), his parents will drive him to the rink. If it is not a school night his parents will drive him to the rink if he is home by 11 pm (23 on a 24 hour clock) public boolean will. Drive(boolean school. Night, boolean homework, int home. By)

Ex. 2 § If it is a school night and he doesn’t have homework and he is home by 10 pm (22 on a 24 hour clock), his parents will drive him to the rink. § schoo. Night && !homework && home. By <= 22 § If it is not a school night his parents will drive him to the rink if he is home by 11 pm (23 on a 24 hour clock) § !school. Night && home. By <= 23 public boolean will. Drive(boolean school. Night, boolean homework, int home. By) { return (schoo. Night && !homework && home. By <= 22) || (!school. Night && home. By <= 23); }

In reality § Minterms are useful for very complex logic § When you struggle to capture the logic § In reality my code would have looked something like this: public boolean will. Drive(boolean school. Night, boolean homework, int home. By) { if(school. Night) { return !homework && home. By <= 22; } else //not a school night { return home. By <= 23; } }

Ex. 3 § Before 1752 the world did not count leap years § Leap years are any year that are: § Divisible by 4 and not divisible by 100 § Divisible by 400 § public boolean is. Leap(int year)

Ex. 3 § Before 1752 the world did not count leap years § year >= 1752 § Leap years are any year that are: § Divisible by 4 and not divisible by 100 § year % 4 == 0 && year %100 != 0 § Divisible by 400 § year % 400 == 0 public boolean is. Leap(int year) { return (year >= 1752 && year % 4 == 0 && year %100 != 0) || (year >= 1752 && year % 400 == 0); }

Ex. 3… in reality § Before 1752 the world did not count leap years § year >= 1752 § Leap years are any year that are: § Divisible by 4 and not divisible by 100 § year % 4 == 0 && year %100 != 0 § Divisible by 400 § year % 400 == 0 public boolean is. Leap(int year) { if(year >=1752) { if(year % 4 == 0 && year %100 != 0) return true; else if(year % 400 == 0) return true; else return false; }

Ex. 4 § Ice cream can be plain (0), OK (1), or amazing(2) § If the ice cream is served in a waffle cone with at least 3 toppings it’s amazing. If it’s not in a waffle cone then it can still be amazing if it costs more than $5. 00 and has at least 5 toppings. § If the ice cream is served in a waffle cone it can’t be plain. Ice cream with 1 topping or less is plain or if it costs less than $2 it must be plain § All other combinations are considered just OK. § public int ice. Cream(int toppings, double cost, boolean waffle)

Ex. 4 § If the ice cream is served in a waffle cone with at least 3 toppings it’s amazing. If it’s not in a waffle cone then it can still be amazing if it costs more than $5. 00 and has at least 5 toppings. § waffle && toppings >= 3 § !waffle && cost > 5 && toppings >= 5 § If the ice cream is served in a waffle cone it can’t be plain. Ice cream with 1 topping or less is plain or if it costs less than $2 it must be plain § !waffle && toppings <= 1 § !waffle && cost <= 2 § All other combinations are considered just OK. public int ice. Cream(int toppings, double cost, boolean waffle) { if(waffle && toppings >= 3 || !waffle && cost > 5 && toppings >= 5) return 2; //amazing else if(!waffle && toppings <= 1 || !waffle && cost <= 2) return 0; //plain else//every other combination return 1; //OK }