Chapter 4

Logic Gates and Logic Circuits

Introduction

We need to understand about logic and its role in computation. George Boole the man who
invented Boolean logic. Boole’s thinking has become the practical foundation of digital circuits.

George Boole
N o v e m be r 2 , 1 8 1 5 - D e c e m be r 8, 1 8 6 4

Logic proposition: a statement that is either TRUE or FALSE

Problem statement: an informal definition of an outcome which is dependent on one logic

proposition or a combination of two or more logic propositions.

Boolean Operators

Boolean Operators are used to connect and define the relationship between your search terms.

Logic Gates

Logic gates serve as the building blocks to digital circuits using combinational units. Many
electronic circuits operate using logic gates. Logic gates basically process signals which
represent true or false, ON or OFF, 1 or 0.

Basically there are 6 logic gates.

Achintha Pradeep - BSc (Hons), MSc(IT) Computer Science (OL & AS, AL)
 1. NOT gate
2. AND gate Basic Logic Gates
3. OR gate
4. NAND gate
5. NOR gate Combinational Logic Gates
6. XOR gate

Symbols used to represent logic gates

Gate Symbol Operator

NOT gate A (inverse)

AND gate A.B or AB

OR gate A+B

NAND gate A.B or AB

NOR gate A+B

XOR gate A+B

Truth Tables

A table that defines a logic circuit by listing all combination of values and indicating the true
output values for each combination.

The functions of Logic Gates

1. AND Gate
The AND gate has 2 or more inputs. The output is only true (1 or 0) when the input both
A and B are true only.

Achintha Pradeep - BSc (Hons), MSc(IT) Computer Science (OL & AS, AL)
 Inputs Output X = A AND B(Logic Notation)
A B X X = A . B (Boolean Algebra)
0 0 0
0 1 0
1 0 0
1 1 1

2. OR Gate
The OR Gate has 2 or more inputs, the output is true when input A or B are true.

Inputs Output X = A OR B(Logic Notation)

A B X X = A + B (Boolean Algebra)
0 0 0
0 1 1
1 0 1
1 1 1

3. NOT Gate
The NOT gate is unique because it has only one input.

Inputs Output
A X X = NOT A (Logic Notation)
0 1 X = A (Boolean Algebra)
1 0

4. NAND Gate (NOT AND)

This is basically the combination of AND gate and NOT gates.

Achintha Pradeep - BSc (Hons), MSc(IT) Computer Science (OL & AS, AL)
 Inputs Output
A B X X = A NAND B(Logic Notation)
0 0 1 X = A.B(Boolean Algebra)
0 1 1
1 0 1
1 1 0

5. NOR Gate (NOT OR)

This is basically the combination of OR gate and NOT gates.

Inputs Output
A B X X = A NOR B(Logic Notation)
0 0 1 X = A+B(Boolean Algebra)
0 1 0
1 0 0
1 1 0

6. XOR Gate (ExclusiveOR)

The output is true when the inputs are opposite of each other.

Inputs Output
A B X X = A XOR B(Logic Notation)
0 0 o X = (A.B) + (A.B) (Boolean Algebra)
0 1 1
1 0 1
1 1 0

Do the following exercises

 Worked Example 4.01
 Task 4.01

Achintha Pradeep - BSc (Hons), MSc(IT) Computer Science (OL & AS, AL)