CMPUT272 Lecture Notes - Lecture 4: Codomain, Boolean Expression, Boolean Function
14 Oct 2014
School
Department
Course
Professor
Document Summary
The mappings of elements from one set to another. Boolean functions will have a domain of {0,1}^n where n is the n- variables of input. Boolean functions always have a co-domain of {0,1} Because computers are based on electrical circuits of power-on/power-of they are inheriently boolean in nature. Each program can be defined as being the mapping of every possible input to every possible output. A number is an abstract mathamatical concept or object. Sound (e. g. the word "three" when said aloud) Dots marked on a page { o o o } 5439 = (5 * 10^3) + (4 * 10^2) + (3 * 10^1) + (9 * 10^0) Base b>1, b n: digits are: 0, 1, , b-1. Base is denoted by adding a subscript to a numeral. For convience, when base is > 10, use [n] to represent numerals larger than 9.
