BASIC RULES OF BOOLEAN ALGEBRA
1. X = 0 or X = 1 2. 0.0 = 0 3. 1+1 =1 4. 0 + 0 = 0 5. 1.1 = 1 6. 1.0 = 0.1 =0 7. 1 + 0 = 0 + 1 =1 The above stated Jaws of Boolean algebra can be verified using some simple examples.
1. X = 0 or X = 1 2. 0.0 = 0 3. 1+1 =1 4. 0 + 0 = 0 5. 1.1 = 1 6. 1.0 = 0.1 =0 7. 1 + 0 = 0 + 1 =1 The above stated Jaws of Boolean algebra can be verified using some simple examples.
Mathematical analyses of digital circuits are usually performed using Boolean algebra. With it, we can simplify logic functions and minimize the number of logic gates needed in a logic network. Boolean algebra uses the addition and multiplication operation. Subtraction and division are not permitted. Since Boolean algebra is a system of mathematics, there are fundamental …
The nineteenth century mathematician, George Boole developed Boolean algebra. It is the mathematical technique used when dealing with problems of logical unit. There are many use of Boolean algebra which include: Used in logic design Used as conventional algebra to equate and manipulate variable quantities which are represented by symbols e.g. A, B, C, 0, …