Scribd
Upload
6 views24 pages

Bachelor of Information Technology: Logic Gates and Boolean Algebra

The document discusses the fundamentals of logic gates and Boolean algebra, which are essential for understanding binary operations in computers. It covers basic logic gates such as AND, OR, NOT, NAND, and NOR, along with their corresponding truth tables and Boolean expressions. Additionally, it includes exercises for drawing logic circuits and writing Boolean expressions for given circuits.

Uploaded by

dulakshichathurika08
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views24 pages

Bachelor of Information Technology: Logic Gates and Boolean Algebra

The document discusses the fundamentals of logic gates and Boolean algebra, which are essential for understanding binary operations in computers. It covers basic logic gates such as AND, OR, NOT, NAND, and NOR, along with their corresponding truth tables and Boolean expressions. Additionally, it includes exercises for drawing logic circuits and writing Boolean expressions for given circuits.

Uploaded by

dulakshichathurika08
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 24

Bachelor of Information Technology

Logic Gates and Boolean Algebra


What are logic networks
Computers deals with binary (only 1, 0)
A “logic-gate” is a hardware component that can perform
various operations on logic values.
Boolean Algebra
 George Boole – The scientist
For the basic gates/functions
AND
◦ Z =AB
◦ X=CDE 3 input gate
◦ Y=FGHK 4 input gate

OR
◦ Z =A+B
◦ Y=F+G+H+K 4 input gate

NOT
◦ Z=A
◦ Y = (F G H K)
Boolean Algebra – Basic Operations

A Boolean operator can be completely described using


a truth table.
The truth table for the Boolean operators AND OR are
shown at the right.
The AND operator is also known as a Boolean product.
The OR operator is the Boolean sum.
AND Gate
AND
X Y Z
X 0 0 0
0 1 0
Z
1 0 0
Y 1 1 1

Z = X.Y
OR Gate
OR
X Y Z
X 0 0 0
Z 0 1 1
Y 1 0 1
1 1 1
Z = X + Y
NOT Gate -- Inverter

NOT
X Y X Y
0 1
Y = ~X 1 0
NAND Gate
NAND
X Y Z
X 0 0 1
0 1 1
Z
1 0 1
Y 1 1 0
NOR Gate
NOR
X Y Z
X 0 0 1
Z 0 1 0
Y 1 0 0
1 1 0
For Knowledge…
Draw a logic circuit for (A + B)C. Draw a logic circuit for (A + B)(C + D)C.

Draw a logic circuit for A + BC + D.


Write the Boolean expressions for following circuits

You might also like