In Boolean algebra, 1 + 1 is not "1 plus 1", it is "1 or 1". Since 1 is like true and 0 is like false, this is like asking "of the two values 1 and 1, is one of them a 1?", or asking "of the to values true and true, is one of them true?". Because there is at least one 1, the expression is 1 (true).
Other examples:
1 + 0 = 1 (There is at least one 1).
0 + 0 = 0 (There is no 1).
1 and 0
Boolean algebra is an area of algebra in which variables are replaced with 1 or 0 to indicate true or false. This form of algebra became the basis for binary computer programming used in digital electronic development.
dfgdfg
Boolean algebra generally deals with design of h/w circuits forms a basis of the computer scientists,since computers can understand only machine level language which is of zeros and one so understanding of boolean algebra is important i think.more over boolean algebra also deals with minimalization of the logic design which has considerably reduced the size of hardware so according to me each and every computer scientist shouldhave a basic understanding of boolean algebra.
You have Boolean operators (such as AND & OR) on variables, rather than mathematical operations (+ - etc). The variables can only have one of two states (values) though (True/False, on/off, 1/0).
Because the 'plus sign' ( + ) in Boolean algebra does not mean the same thing as it does in arithmetic. In the shorthand of Boolean logic operations, the plus sign is used to mean ' OR ' .
1. With boolean algebra, 1 + n is always equal to 1, no matter what the value of n is.
Most likely it is called BOOLEAN ALGEBRA I.
The prototypical Boolean algebra; i.e. the Boolean algebra defined over the Boolean domain, has two elements in it: 0 and 1. For more information about Boolean algebra, please refer to the related link below.
1 plus 1 equals 1 (in Boolean logic) 1 plus 1 equals 10 (in base 2)
If you mean boolean algebra, in mathematics it refers to the subarea of algebra. In boolean algebra the values of the variables are based on true and false (truth values), denoted as 0 and 1 respectively.
Boolean algebra uses the numbers 0 and 1 to represent statements which are False and True respectively.
1 and 0
Boolean algebra is an area of algebra in which variables are replaced with 1 or 0 to indicate true or false. This form of algebra became the basis for binary computer programming used in digital electronic development.
Boolean algebra is the very basis for all of computing. Boolean algebra results in only 2 answers, true or false. To computers, these are represented by 0 and 1. This creates the binary system, which is how all computers operate.
Boolean algebra differs in a major way from ordinary algebra in that boolean constants and variable are allowed to have only two possible values 0 or 1. A Boolean variable is a quantity that may at different times be equal to either 0 or 1. Boolean algebra is used to express the effects that various digital circuits have on logic inputs, and to manipulate logic variable for the purpose of determination of the best method for performing a given circuit function. Because of possibility of only two variables boolean algebra is relatively easy to work with as compared to ordinary algebra. It have only 3 basic operations: 1. Logical Addition- OR 2. Logical Multiplication- AND 3. Logical Complimentation- NOT
1+9+25=35 not 41, this is a false statement