Scribd
Upload
3 views

Logic Gates Notes-1

Logic gates are essential for computers to convert high and low voltage states, representing binary values. The document discusses various types of logic gates, including NOT, AND, OR, NAND, NOR, and XOR, and provides truth tables and logic expressions for different scenarios. It illustrates how to derive logic expressions from truth tables using combinations of these gates.

Uploaded by

567 899
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
3 views

Logic Gates Notes-1

Logic gates are essential for computers to convert high and low voltage states, representing binary values. The document discusses various types of logic gates, including NOT, AND, OR, NAND, NOR, and XOR, and provides truth tables and logic expressions for different scenarios. It illustrates how to derive logic expressions from truth tables using combinations of these gates.

Uploaded by

567 899
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Logic Gates Notes

A computer is provided with electricity to function and it needs a way to change this
electricity from high voltage (1) to low voltage (0) and vice versa, to be able to represent
each binary value that is required. It can do this through the use of logic gates. The
reason why this chapter is called Boolean logic is because a Boolean value only has two
different states, e.g. true or false, or in a logic gate’s case 0 or 1.

A computer uses thousands of logic gates to output the high or low voltage that is
needed to process and store the large quantity of data this it is provided with on a daily
basis. The logic gates that you will learn about are the NOT, AND, OR, NAND, NOR and
XOR gates.
Gates Symbols

OR GATE

NOR GATE

AND GATE

NAND GATE

XOR GATE

NOT GATE

Representing Truth Table

a) Produce a logic expression and a logic circuit from the following truth table
A B X
0 0 0
0 1 1
1 0 0
1 1 0
U need to use AND gate to create that output. AT present A=0 and B=1 will not result an output 1 using
AND gate. Therefore, your need to reverse A input into 1 to use AND gate

X = NOT A AND B

b) Produce a logic expression and a logic circuit from the following truth table

A B X
0 0 0
0 1 1
1 0 0
1 1 1
X = (NOT A AND B) OR (A AND B)

c) Produce a logic expression and a logic circuit from the following truth table

A B C X
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 0
1 0 1 1
1 1 0 0
1 1 1 1

X = (NOT A AND NOT B AND C) OR (A AND NOT B AND C) OR (A AND B AND C)


d) Produce a logic expression and a logic circuit from the following truth table

A B C X
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1

X = (NOT A AND NOT B AND C) OR (NOT A AND B AND C) OR ( A AND B AND NOT C) OR (A AND B AND C)

The second output1 has A=0, B=1, C=1, Now you need to look at whether all rows in the table where B
and C have the value 1, the result is an output of 1. The only other place in the table where the inputs
are both1 is row8. This does result in an output of 1 as well. So the two expressions NOT A AND B AND
C) and (A AND B AND C) becomes one like B AND C

The method goes to last two rows, so the two expressions ( A AND B AND NOT C) and (A AND B AND C)
becomes one like A AND B

X = (NOT A AND NOT B AND C) OR (B AND C) OR (A AND B)

You might also like