Class 12 Computer Science Study Guide: Class 12 Boolean Algebra Revision Notes
Access comprehensive study materials and useful resources for Boolean Algebra using the Class 12 Boolean Algebra Revision Notes. Designed to align with the 2026-27 CBSE academic guidelines, these advanced resources help Class 12 Computer Science students reinforce core concepts beyond standard textbooks.
Download Boolean Algebra Study Material PDF
View or download the dedicated Class 12 Boolean Algebra Revision Notes resource below. Engaging with these advanced study guides under focused conditions ensures continuous academic progress and mastery of the 2026-27 curriculum for Boolean Algebra.
These Class 12 Computer Science revision notes on Boolean Algebra (Unit IV, Chapter 8) cover truth tables, logical operators, the NOT, OR and AND logic gates, the principle of duality, basic theorems, De Morgan's theorems, minterms and maxterms, canonical SOP and POS forms, conversion between canonical forms, and simplification using the algebraic method and Karnaugh maps, with solved examples and practice questions.
UNIT-IV: BOOLEAN ALGEBRA
TRUTH TABLE
A truth table is a table which represents all the possible values of logical variables/statements along with all the possible results of given combinations of values.
LOGICAL OPERATORS
Logical operators are derived from Boolean algebra, which is the mathematical representation of the concepts without going into the meaning of the concepts.
1. NOT Operator - Operates on a single variable. It gives the complement value of the variable.
2. OR Operator - It is a binary operator and denotes logical addition operation and is represented by "+" symbol.
3. AND Operator - AND operator performs logical multiplication and its symbol is (.) dot.
BASIC LOGIC GATES
A gate is simply an electronic circuit, which operates on one or more signals to produce an output signal. Gates are digital circuits because the input and output signals are either low (0) or high (1). Gates are also called logic circuits.
There are three types of logic gates:
1. Inverter (NOT gate)
2. OR gate
3. AND gate
1. NOT gate: This gate takes one input and gives a single output. It is used to obtain the complement of a value.
[Figure: NOT gate symbol with input X and output Y = X']
If X = 0, then X' = 1.
The truth table for NOT gate is:
| X | X' |
|---|---|
| 0 | 1 |
| 1 | 0 |
2. OR gate: The OR gate has two or more input signals but only one output signal. If any of the input signals is 1 (high), the output signal is 1 (high).
Truth table and circuit diagram for two input OR gate:
| X | Y | Z = X + Y |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 1 |
[Figure: Two input OR gate with inputs X and Y and output Z = X + Y]
3. AND gate: The AND gate has two or more than two input signals and produces one output signal. When all the inputs are 1 (high), the output is 1; otherwise the output is 0.
Truth table and circuit diagram for two input AND gate:
| X | Y | F = X.Y |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 0 |
| 1 | 0 | 0 |
| 1 | 1 | 1 |
[Figure: Two input AND gate with inputs X and Y and output Z = X . Y]
PRINCIPLE OF DUALITY
This principle states that we can derive a Boolean relation from another Boolean relation by performing simple steps. The steps are:
1. Change each AND (.) with an OR (+) sign.
2. Change each OR (+) with an AND (.) sign.
3. Replace each 0 with 1 and each 1 with 0.
For example: 0 + 0 = 0 has the dual 1 . 1 = 1, and 1 + 0 = 1 has the dual 0 . 1 = 0.
BASIC THEOREMS OF BOOLEAN ALGEBRA
Basic postulates of Boolean algebra are used to define basic theorems of Boolean algebra that provide all the tools necessary for manipulating Boolean expressions.
1. Properties of 0 and 1: 0 + X = X, 1 + X = 1, 0 . X = 0, 1 . X = X
2. Idempotence Law: X + X = X, X . X = X
3. Involution Law: (X')' = X
4. Complementarity Law: X' + X = 1, X . X' = 0
5. Commutative Law: X + Y = Y + X, X . Y = Y . X
6. Associative Law: X + (Y + Z) = (X + Y) + Z, X(YZ) = (XY)Z
7. Distributive Law: X(Y + Z) = XY + XZ, X + YZ = (X + Y)(X + Z)
8. Absorption Law: X + XY = X, X(X + Y) = X
DE MORGAN'S THEOREMS
De Morgan's First Theorem: This rule states that the complement of the OR of two operands is the same as the AND of the complements of those operands. Mathematically it can be written as: (A + B)' = A'.B'
De Morgan's Second Theorem: This rule states that the complement of the AND of two operands is the same as the OR of the complements of those operands. Mathematically it can be written as: (A.B)' = A' + B'
Algebraic proof of De Morgan's First Theorem: (a + b)' = a'b'
First part: prove (a + b) + (a'b') = 1
1. (a + b) + (a'b') = (a + b + a')(a + b + b') (Distributive law)
2. = (1 + b)(a + 1) (Complement law)
3. = 1 (Properties of 1)
Second part: prove (a + b)(a'b') = 0
1. (a + b)(a'b') = (a'b')(a + b) (Commutative law)
2. = a'b'a + a'b'b (Distributive law)
3. = 0.b' + a'.0 (Complement law; x.0 = 0)
4. = 0 + 0 = 0
Note: De Morgan's second theorem is just the complement of the first theorem.
MINTERMS AND MAXTERMS
A minterm is the product of all the literals, with or without bar, within a logical system. For example, if we have two literals A and B, the possible minterms are AB, A'B, AB' and A'B'.
A maxterm is the sum of all the literals, with or without bar, within a logical system. For example, if we have two literals A and B, the possible maxterms are A + B, A' + B, A + B' and A' + B'.
n variables can be combined to form 2n minterms or maxterms.
Minterms and maxterms for three binary variables:
| x | y | z | Minterm Term | Shorthand | Maxterm Term | Shorthand |
|---|---|---|---|---|---|---|
| 0 | 0 | 0 | x'y'z' | m0 | x + y + z | M0 |
| 0 | 0 | 1 | x'y'z | m1 | x + y + z' | M1 |
| 0 | 1 | 0 | x'yz' | m2 | x + y' + z | M2 |
| 0 | 1 | 1 | x'yz | m3 | x + y' + z' | M3 |
| 1 | 0 | 0 | xy'z' | m4 | x' + y + z | M4 |
| 1 | 0 | 1 | xy'z | m5 | x' + y + z' | M5 |
| 1 | 1 | 0 | xyz' | m6 | x' + y' + z | M6 |
| 1 | 1 | 1 | xyz | m7 | x' + y' + z' | M7 |
SOP AND POS FORMS FROM A TRUTH TABLE
A Boolean function may be represented algebraically from a given truth table by forming a minterm for each combination of the variables that produces a 1 in the function, and then taking the OR of all those terms.
A Boolean function may be represented algebraically from a given truth table by forming a maxterm for each combination of the variables that produces a 0 in the function, and then taking the AND of all those terms.
| x | y | z | F |
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 1 |
| 0 | 1 | 0 | 0 |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 0 | 1 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 |
For this function:
SOP form: F = x'y'z + xy'z' + xyz
POS form: F = (x + y + z)(x + y' + z)(x + y' + z')(x' + y + z')(x' + y' + z)
Example: Express the Boolean function F(A,B,C) = AB + C as a sum of minterms.
Answer:
1. Each term must contain all the variables.
2. AB = AB(C + C') = ABC + ABC'
3. C = C(A + A') = AC + A'C = AC(B + B') + A'C(B + B') = ABC + AB'C + A'BC + A'B'C
4. OR all the new terms, eliminating duplicates: F(A,B,C) = A'B'C + A'BC + AB'C + ABC' + ABC
5. F(A,B,C) = m1 + m3 + m5 + m6 + m7 = Σ(1, 3, 5, 6, 7)
Teacher's Note:
a) Every term of a sum of minterms must contain every variable, so missing variables are added with (X + X') = 1.
b) Remove duplicate minterms after expanding; the list of numbers is the final answer.
c) Each number is the decimal value of the binary pattern of the variables, for example ABC' is 110 = 6.
Example: Express the Boolean function F(x,y,z) = x'y + xz as a product of maxterms.
Answer:
1. Convert the function into OR terms using the distributive law: F(x,y,z) = (x'y + x)(x'y + z) = (x + x')(y + x)(x' + z)(y + z) = (y + x)(x' + z)(y + z)
2. Each term must contain all the variables:
y + x = y + x + zz' = (x + y + z)(x + y + z')
x' + z = x' + z + yy' = (x' + y + z)(x' + y' + z)
y + z = y + z + xx' = (x + y + z)(x' + y + z)
3. AND all the new terms, eliminating duplicates: F(x,y,z) = (x + y + z)(x + y + z')(x' + y + z)(x' + y' + z)
4. F(x,y,z) = M0 M1 M4 M6 = Π(0, 1, 4, 6)
Teacher's Note:
a) Apply the distributive law first, then add the missing variables to each OR term.
b) A maxterm list is written with Π, and the numbers are the rows where F is 0.
CONVERSION BETWEEN CANONICAL FORMS
The complement of a function expressed as the sum of minterms equals the sum of the minterms missing from the original function. This is because the original function is expressed by those minterms that make the function equal to 1, whereas its complement is 1 for those minterms that make the function 0.
Example: Convert F(A,B,C) = Σ(0, 2, 4, 6, 7) into a product of maxterms.
Answer:
1. F'(A,B,C) = Σ(1, 3, 5) = m1 + m3 + m5
2. Take the complement of F' by De Morgan's theorem: F(A,B,C) = (m1 + m3 + m5)' = m1' . m3' . m5' = M1 M3 M5
3. Hence F(A,B,C) = Π(1, 3, 5)
Teacher's Note:
a) The numbers missing from the original list give the complement function.
b) Minterm numbers of the complement become maxterm numbers of the original function.
c) To convert from one canonical form to the other, interchange the symbols Σ and Π and list the numbers that are missing from the original form.
MINIMIZATION OF BOOLEAN EXPRESSIONS
After obtaining SOP and POS expressions, the next step is to simplify the Boolean expression. There are two methods of simplification of Boolean expressions:
1. Algebraic Method
2. Karnaugh Map (K-Map)
1. Algebraic method: This method makes use of Boolean postulates, rules and theorems to simplify the expression.
Example: Simplify AB'CD + A'BCD' + ABCD + ABCD'
Answer:
1. Working with the terms AB'CD + AB'CD' + ABCD + ABCD' (the second term is taken as AB'CD' in the solution below)
2. = AB'C(D + D') + ABC(D + D') (Distributive law)
3. = AB'C.1 + ABC.1 (D + D' = 1)
4. = AC(B' + B) (Distributive law)
5. = AC.1 = AC
Teacher's Note:
a) The source prints the second term as A'BCD', but the working needs AB'CD' to reach AC; with A'BCD' the answer would be ABC + AB'CD + A'BCD'.
b) Look for a pair of terms that differ in only one variable, then combine them with (X + X') = 1.
2. Karnaugh Map (K-Map): A Karnaugh map is a graphical display of the fundamental products in a truth table.
Rules for using a K-Map:
● Put a 1 in the box for any minterm that appears in the SOP expansion.
● Basic idea is to cover the largest adjacent blocks you can, whose side length is some power of 2.
● Blocks can wrap around (map rolling) the edges.
● Redundant groups should be avoided.
Sum of Products (SOP) reduction using K-Map
For reducing the expression, first mark octets, then quads, then pairs, and then single cells.
● Pair: Two adjacent 1s make a pair. A pair removes one variable.
● Quad: Four adjacent 1s make a quad. A quad removes two variables.
● Octet: Eight adjacent 1s make an octet. An octet removes three variables.
Reduction of expression: When moving vertically or horizontally in a pair, a quad or an octet, only one variable changes, and that variable can be eliminated directly from the expression.
Q1. Reduce the following Boolean expression using K-Map: F(A,B,C,D) = Σ(0, 2, 3, 4, 6, 7, 8, 9, 10, 12, 13, 14)
Answer:
1. There is 1 octet and 2 quads after eliminating the redundant groups.
2. Octet (m0, m2, m4, m6, m8, m10, m12, m14) reduces to D'.
3. Quad (m2, m3, m6, m7) reduces to A'C.
4. Quad (m8, m9, m12, m13) reduces to AC'.
5. Hence F(A,B,C,D) = D' + A'C + AC'.
Teacher's Note:
a) Start with the octet, because it covers the most cells with the fewest terms.
b) Inside the octet every cell has D = 0, so the single term is D'.
c) Each quad keeps only the variables that do not change across its four cells.
Product of Sums (POS) reduction using K-Map
For POS reduction, the 0s of the K-Map are grouped in octets, quads and pairs, and each group gives a sum term. A variable that is 0 in the group appears without a bar, and a variable that is 1 appears with a bar.
Q1. Reduce the following Boolean expression using K-Map: F(A,B,C,D) = Π(0, 3, 5, 6, 7, 8, 11, 15)
Answer:
1. There is 1 quad and 3 pairs after eliminating the redundant groups.
2. Quad (M3, M7, M11, M15) reduces to C' + D'.
3. Pair (M5, M7) reduces to A + B' + D'.
4. Pair (M6, M7) reduces to A + B' + C'.
5. Pair (M0, M8) reduces to B + C + D.
6. Hence F(A,B,C,D) = (C' + D')(A + B' + D')(A + B' + C')(B + C + D).
Teacher's Note:
a) The quad covers the four cells where C = 1 and D = 1, so both A and B drop out.
b) Check that every 0 in the map is covered by at least one group.
c) Pairs are written with a bar on each variable that is 1 in the group.
PRACTICE QUESTIONS
2 Marks Questions
1. Write the equivalent Boolean Expression for the following Logic Circuit [2 Marks]
[Figure: Logic circuit with inputs P and Q. P passes through a NOT gate into an OR gate whose second input is Q. Q passes through a NOT gate into a second OR gate whose second input is P. The outputs of the two OR gates feed a two input AND gate, which gives the output.]
Second logic circuit of the question:
Structure of the second circuit: inputs X and Y feed a two input AND gate. The input X also goes along a separate line to a NOT gate, which gives X'. The output of the AND gate goes to a second NOT gate, which gives (X.Y)'. The outputs of both NOT gates are the two inputs of an OR gate, and the OR gate gives the output.
Hence the Boolean expression of the second circuit is F = X' + (X.Y)' = X' + X' + Y' = X' + Y'.
Answer:
1. The first OR gate has inputs P' and Q, so its output is (P' + Q).
2. The second OR gate has inputs P and Q', so its output is (P + Q').
3. The AND gate combines both outputs: F = (P' + Q).(P + Q').
4. Expanding: F = P'P + P'Q' + QP + QQ' = P'Q' + PQ.
5. Hence the equivalent Boolean expression is F = (P' + Q)(P + Q') = PQ + P'Q'.
Teacher's Note:
a) Read each gate from the inputs towards the output and write its expression.
b) Expanding with P'P = 0 and QQ' = 0 removes two terms, leaving the XNOR form PQ + P'Q'.
2. Draw a logical circuit diagram for the following Boolean expression: A.(B+C') [2 Marks]
Answer:
1. The expression has a NOT gate on C, giving C'.
2. B and C' are the inputs of a two input OR gate, giving (B + C').
3. The output of the OR gate and the input A go to a two input AND gate.
4. The output of the AND gate is A.(B + C').
[Figure: diagram to be added. Two input AND gate with inputs A and the output of a two input OR gate; the OR gate has inputs B and the output of a NOT gate whose input is C.]
Teacher's Note:
a) Draw the innermost part of the bracket first, which here is the NOT gate on C.
b) The final gate is the one with the outermost operator, which is AND here.
3. Prove x'.y' + y.z = x'yz + x'yz' + xyz + x'yz algebraically. [2 Marks]
Answer:
1. The statement as printed is not an identity. The correct right side is x'y'z + x'y'z' + xyz + x'yz.
2. Left side: x'.y' + y.z = x'y' + yz
3. Make each term contain all variables: x'y' + yz = x'y'(z + z') + (x + x')yz (Complement law)
4. = x'y'z + x'y'z' + xyz + x'yz (Distributive law)
5. Hence x'.y' + y.z = x'y'z + x'y'z' + xyz + x'yz.
Teacher's Note:
a) The printed right side repeats x'yz and omits x'y'z and x'y'z'; the correct right side is x'y'z + x'y'z' + xyz + x'yz.
b) Multiply each term by (z + z') or (y + y') to add a missing variable.
3 Marks Questions
1. If F(a,b,c,d) = Σ(0, 2, 4, 5, 7, 8, 10, 12, 13, 15), obtain the simplified form using K-Map. [3 Marks]
Answer:
1. Place a 1 in the cells for m0, m2, m4, m5, m7, m8, m10, m12, m13 and m15.
2. Quad (m0, m2, m8, m10) covers b = 0 and d = 0, giving b'd'.
3. Quad (m4, m5, m12, m13) covers b = 1 and c = 0, giving bc'.
4. Quad (m5, m7, m13, m15) covers b = 1 and d = 1, giving bd.
5. Each quad is needed, because m0, m4 and m7 are covered by only one quad each.
6. Hence F(a,b,c,d) = b'd' + bc' + bd.
Teacher's Note:
a) Group the 1s into quads first, because each quad removes two variables.
b) Cells m0, m4 and m7 each appear in only one group, so those groups are essential.
c) The expression b'd' + bc' + bd covers all ten minterms with three terms.
2. Obtain a simplified form for a Boolean expression F(U,V,W,Z) = Π(0, 1, 3, 5, 6, 7, 10, 14, 15). [3 Marks]
Answer:
1. The listed numbers are the 0s of F, so these cells are grouped for the POS form.
2. Pair (m0, m1) gives U + V + W.
3. Quad (m1, m3, m5, m7) gives U + Z'.
4. Pair (m10, m14) gives U' + W' + Z.
5. Quad (m6, m7, m14, m15) gives V' + W'.
6. Each group is essential, because m0, m3 and m10 are covered by one group each.
7. Hence F(U,V,W,Z) = (U + V + W)(U + Z')(U' + W' + Z)(V' + W').
Teacher's Note:
a) Use the 0 cells, not the 1 cells, when the question gives a product of maxterms.
b) A variable that is 1 throughout a group appears with a bar in its sum term.
c) Four sum terms are needed, because no three groups cover all nine zeros.
Free study material for Computer Science
Useful Resources and Notes for Class 12 Computer Science Boolean Algebra
Essential Notes for Class 12 Computer Science
Access comprehensive study material for Boolean Algebra, including revision notes, concept maps, and high-probability questions. These resources are designed in alignment with the latest 2026 CBSE syllabus for Class 12 Computer Science to support effective exam preparation.
Verified Solutions for Class 12 Computer Science
Each resource draws directly from authorized textbooks to maintain academic accuracy. Evaluating solved examples allows Class 12 students to master the formal presentation and answer-writing standards expected in upcoming school exams.
Enhance Accuracy with Online Tests
Maximize your grade potential by utilizing Class 12 Computer Science practice papers in tandem with these structured notes. All printable assignments and interactive mock tests on our platform are updated for the 2026 session and available free of charge.
FAQs
Our advanced study package for Boolean Algebra includes detailed concepts, diagrams, Mind Maps, and explanation of complex topics to ensure Class 12 students learn as per syllabus for 2026 exams.
The Mind Maps provided for Boolean Algebra act as visual anchors which will help faster recall during high-pressure exams.
Yes, teachers use our Class 12 Computer Science resources for lesson planning as they are in simple language and have lot of solved examples.
Yes, You can download the complete, mobile-friendly PDF of the Computer Science Boolean Algebra advanced resources for free.
Yes, our subject matter experts have updated the Boolean Algebra material to align with the rationalized NCERT textbooks and have removed deleted topics and added new competency-based questions.