CSE 241 Lecture Notes - Lecture 4: George Boole, Commutative Property, Negative Number

• School: University at Buffalo
• Department: Computer Science & Engineering
• Course: CSE 241
• Professor: Ramamurthy Bina

Document Summary

The laws of thought: today we are obsessed with ai intelligent thought. Established boolean algebra: binary logic things are either true (x) or false (not x, operators: and, or, not, basic element: {0, 1} (false, true, axioms basic truths, laws and theorems. Step 1 preparation: find +/- of each a and b. ***make sure there are 8 bits, might have to add a zero in front*** (cid:1005)(cid:859)s (cid:272)o(cid:373)p. Note: you will only get overflow when you add 2 pos or. We carried a 1 in but a 0 out (of our msb) so we have an overflow. We have no overflow, but are left with a negative number. 0 carried into msb, but 1 carried out of msb, so we have an overflow. We ha(cid:448)e (cid:1005)(cid:859)s (cid:272)arried (cid:271)oth i(cid:374)to a(cid:374)d out of msb, so the result is positive. Note: (cid:1006)(cid:859)s (cid:272)o(cid:373)p of a (cid:1006)(cid:859)s (cid:272)o(cid:373)p gi(cid:448)es (cid:455)ou the origi(cid:374)al (cid:374)u(cid:373)(cid:271)er (cid:1006)(cid:859)s (cid:272)o(cid:373)p(cid:894)(cid:1006)(cid:859)s (cid:272)o(cid:373)p(cid:894)(cid:454)(cid:895)(cid:895) gi(cid:448)es (cid:455)ou (cid:454).