Boolean Algebra for Class 11
Boolean algebra is the branch of mathematics that works with only two values: 1 (true) and 0 (false). It was developed by George Boole and forms the logica...
What Boolean Algebra Means
Boolean algebra is the branch of mathematics that works with only two values: 1 (true) and 0 (false). It was developed by George Boole and forms the logical foundation of every digital computer. In the Class 11 Computer Science syllabus, Boolean algebra explains how logical decisions inside a processor are built from simple true/false rules. Variables in Boolean algebra are called Boolean variables, and they can hold only 0 or 1, unlike normal algebra where a variable can be any number.
The Three Basic Operators
There are three fundamental operations. AND (written as A.B or A AND B) gives 1 only when both inputs are 1. OR (A+B) gives 1 when at least one input is 1. NOT (A' or NOT A) reverses the value, so NOT 1 is 0. From these we build truth tables that list every possible input combination and its output. Important laws you must memorise include the Commutative law (A+B = B+A), Associative law, Distributive law (A.(B+C) = A.B + A.C), and De Morgan's theorems: (A.B)' = A' + B' and (A+B)' = A'.B'. De Morgan's laws are heavily tested.
Worked Example and Exam Tip
Example: Simplify A + A.B. Using the absorption law, A + A.B = A. Proof by truth table: when A is 1 the result is 1 regardless of B; when A is 0 the result equals B but the original A+A.B also equals 0, so both sides match. Exam tip: practice drawing full truth tables and proving De Morgan's theorems by comparing both sides row by row. A common board question gives a Boolean expression and asks you to minimise it using the laws, then verify with a truth table. Always show each law you applied beside the step.