0% found this document useful (0 votes)
500 views

Presentation of Logic Gates

The document describes basic logic gates including AND, OR, NAND, NOR, and NOT gates. It provides their Boolean algebra representations and truth tables. It then demonstrates how to use a logic converter tool to derive the truth table of a given logic gate circuit. Students are instructed to draw circuits for various logic gate combinations in a simulator and fill in their truth tables.
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
500 views

Presentation of Logic Gates

The document describes basic logic gates including AND, OR, NAND, NOR, and NOT gates. It provides their Boolean algebra representations and truth tables. It then demonstrates how to use a logic converter tool to derive the truth table of a given logic gate circuit. Students are instructed to draw circuits for various logic gate combinations in a simulator and fill in their truth tables.
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Presentation

Hamza Tanveer

Basic logic Gates (AND, OR, and NOT gates)

AND and NAND gates

This gate gives high output (1) if all the inputs are 1’s. otherwise the output will be low (0).

Its Boolean algebra representation is: C=A.B


And it’s truth table and schema as following:

A B C
0 0 0
0 1 0
1 0 0
1 1 1
The NAND gate works opposite to the AND gate. Its Boolean algebra representation is: C=(A.B)’
And it’s truth table and schema as following:

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

OR and NOR gates

This circuit will give high output (1) if any input is high (1).

Its Boolean algebra representation is: C=A+B


and it’s truth table and schema as following.
A B C
0 0 0
0 1 1
1 0 1
1 1 1
The NOR gate works opposite to the OR gate. Its Boolean algebra representation is: C=(A+B)’
And it’s truth table and schema as following:

A B C
0 0 1
0 1 0
1 0 0
1 1 0
NOT gate

This is the simplest gate it just inverts the input, if the input is high the output will be low and conversely.
So B=A’

A B
0 1
1 0

The AND and NAND gates

In EWB, draw the following two circuits and fill the truth table below
A B A.B (A.B)’
0 0
0 1
1 0
1 1

The AND-NOT combination

In EWB, draw the following circuit and fill the truth table
A B (A.B)’
0 0
0 1
1 0
1 1
The OR and NOR gates

In EWB, draw the following two circuits and fill the truth table below

A B A+B (A+B)’
0 0
0 1
1 0
1 1
The NOR-NOT combination

A B ((A+B)’)’
0 0
0 1
1 0
1 1

Finding the truth table of a gate using the logic converter

The logic converter can be found in the Instruments toolbox. It can be used to derive a truth table from a
circuit schematic:
1. Attach the input terminals of the logic converter to up to eight input points in the circuit.
2. Connect the single output of the circuit to the output terminal on the logic converter icon.
The truth table for the circuit appears in the logic converter's display.

In the following circuit, we will be examining the AND gate. The two inputs of the gate are attached the A
and B inputs of the logic converter. The circuit output C is connected to Out line of the logic converter.

After clicking on the Truth Table button of the logic converter, the logic converter tries
all possible combinations of the circuit input and derives its truth table.

Finding the truth table of a gate using the logic converter

Repeat what you did in task 5 for the NOR gate. Show your connections in the circuit below.
A B A+B (A+B)’
0 0
0 1
1 0
1 1

A B C D
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1

Finding the truth table of a given circuit using the logic converter

Find the truth table of the following circuit:


A B C D F
0 0 0 0
0 0 0 1
0 0 1 0
0 0 1 1
0 1 0 0
0 1 0 1
0 1 1 0
0 1 1 1
1 0 0 0
1 0 0 1
1 0 1 0
1 0 1 1
1 1 0 0
1 1 0 1
1 1 1 0
1 1 1 1
View publication stats

You might also like