ITM 207 Lecture Notes - Lecture 4: Boolean Expression, Boolean Data Type, Kleene Algebra

• School: Ryerson University
• Department: Information Technology Management
• Course: ITM 207
• Professor: Joseph Lee

Document Summary

Intro this would tell u how the computers work. How they work and represent the 0s and the 1s algebra. Boolean variable: take 0 and 1 values only. Boolean expression: evaluates to 0 or 1 only (true or false, x = (a + c)b -> logical boolean expression not regular algebraic. Expression!!!!: the plus represents the or, the brackets represent and, things are very restrictive. Taking the example of the gst, we can represent the relationships as a lookup or a function plot: gst = 0. 13 * price. Just take a few sample for the input and put the output, because the lookup table could be going forever because it is infinite. Whe(cid:374) u sa(cid:455) a a(cid:374)d (cid:271) it"s the sa(cid:373)e thi(cid:374)g as (cid:271) a(cid:374)d a. U have the properties as u would in regular algebra. If u sa(cid:455) a a(cid:374)d a" the(cid:374) its o.