Logic Gates for ISC Class 11: Truth Tables, Universal Gates, Half and Full Adder
ISC Class 11 Computer Science notes on logic gates: AND, OR, NOT, NAND, NOR, XOR and XNOR with truth tables, why NAND and NOR are universal gates, and half adder and full adder circuits with their Boolean expressions.

Logic gates are the building blocks of every digital circuit, from a calculator to a computer processor. In ISC Computer Science, this chapter links propositional logic in Class 11 with the Boolean algebra and circuit questions in Class 12. These notes cover every gate, the universal gates and the adder circuits.
What is a logic gate?
A logic gate is an electronic circuit that takes one or more binary inputs (0 or 1) and produces one binary output according to a fixed rule. The rule is described by a truth table and a Boolean expression.
The basic gates
NOT gate (inverter)
Has one input, and the output is its complement: Y = A'
A | Y
0 | 1
1 | 0AND gate
The output is 1 only when all the inputs are 1: Y = A · B
OR gate
The output is 1 when at least one input is 1: Y = A + B
A B | AND OR
0 0 | 0 0
0 1 | 0 1
1 0 | 0 1
1 1 | 1 1Derived gates
- NAND (NOT-AND): Y = (A · B)'. The output is 0 only when both inputs are 1.
- NOR (NOT-OR): Y = (A + B)'. The output is 1 only when both inputs are 0.
- XOR (exclusive OR): Y = A ⊕ B = A'B + AB'. The output is 1 when the inputs are different.
- XNOR: Y = (A ⊕ B)' = AB + A'B'. The output is 1 when the inputs are the same.
A B | NAND NOR XOR XNOR
0 0 | 1 1 0 1
0 1 | 1 0 1 0
1 0 | 1 0 1 0
1 1 | 0 0 0 1Universal gates
NAND and NOR are called universal gates because any Boolean function, and therefore every other gate, can be built using only NAND gates or only NOR gates. This matters in practice: a chip maker can produce circuits from a single type of gate.
Building other gates from NAND
- NOT: join both inputs, which gives (A · A)' = A'
- AND: a NAND followed by a NAND used as NOT, which gives ((A · B)')' = A · B
- OR: invert each input with a NAND, then NAND the results, which gives (A' · B')' = A + B (by De Morgan's law)
Building other gates from NOR
- NOT: join both inputs, which gives (A + A)' = A'
- OR: a NOR followed by a NOR used as NOT, which gives ((A + B)')' = A + B
- AND: invert each input with a NOR, then NOR the results, which gives (A' + B')' = A · B
Half adder
A half adder adds two single bits, A and B, and produces a Sum (S) and a Carry (C).
A B | S C
0 0 | 0 0
0 1 | 1 0
1 0 | 1 0
1 1 | 0 1- S = A ⊕ B
- C = A · B
Circuit: one XOR gate for the sum and one AND gate for the carry.
Full adder
A full adder adds three bits: A, B and a carry-in Cin from the previous column. It is used to add multi-bit binary numbers.
A B Cin | S Cout
0 0 0 | 0 0
0 0 1 | 1 0
0 1 0 | 1 0
0 1 1 | 0 1
1 0 0 | 1 0
1 0 1 | 0 1
1 1 0 | 0 1
1 1 1 | 1 1- S = A ⊕ B ⊕ Cin
- Cout = A·B + Cin·(A ⊕ B)
A full adder can be built from two half adders and one OR gate:
- The first half adder adds A and B.
- The second half adder adds that sum to Cin.
- The two carries are ORed together to give Cout.
Exam tips
- Always draw the truth table with every input combination: 2ⁿ rows for n inputs.
- When asked to prove that NAND or NOR is universal, show the NOT, AND and OR constructions, each with its expression.
- XOR and XNOR expressions are frequently asked. Remember that XOR means "different" and XNOR means "same".
Practice questions
- Write the Boolean expression and truth table of a 3-input NOR gate.
- How many NAND gates are needed to build an OR gate?
- For A = 1, B = 1 and Cin = 1, what are the Sum and Cout of a full adder?
Answers:
- Y = (A + B + C)'. Y is 1 only when A = B = C = 0.
- Three: two used as NOT gates, and one NAND.
- S = 1 ⊕ 1 ⊕ 1 = 1, and Cout = 1. In binary, 1 + 1 + 1 = 11.
Revise propositional logic with our ISC Class 11 Propositional Logic and Truth Tables notes, then try the ISC Class 11 Computer Science Sample Paper.
Related Posts
Continue learning with these related articles
Decimal to Binary Conversion in Java: 3 Programs with Examples
How to convert a decimal number to binary on paper and in Java: three programs (String, place value and Integer.toBinaryString), binary to decimal, a dry run and common mistakes.

ISC Class 11 Computer Science Sample Paper 2026-27 with Solutions
A full 70-mark ISC Class 11 Computer Science sample paper for the 2026-27 annual exam: MCQs, number systems, propositional logic, logic gates, Java classes, arrays, strings, searching and sorting, and computing ethics, with complete worked solutions.

Abstract Classes and Interfaces in Java for ISC Class 12 (with Programs)
ISC Class 12 Computer Science notes on abstract classes and interfaces in Java: abstract methods, implementing interfaces, constants in interfaces, multiple interfaces, the key differences, and a solved board-style program.