EXPERIMENT-1:- LOGIC GATE

❖ Objective:- Determine the truth table of OR,AND,NOT by using logisim app.

❖ Theory :-

There are some Basic gates, universal gates and derived gates.

1. OR Gate :-
It has 2 input pins and 1 output pin. So there are 4 combination forms
available. In OR is the one logic gate that if one of the input has higher input or input as 1 then
the result is 1 or higher output. Else remaining case it is nothing the case of both input has lower
input or input as 0 then result is lower output or output is 0. This is OR gate Boolean operations.
Also OR gate known as Boolean sum.

symbol :- Z = X | Y ( X and Y are as input and z is output)

Truth Table:-

X Y Z

0 0 0

0 1 1

1 0 1

1 1 1

2. AND Gate :-
It has 2 input pins and 1 output pin. So there are 4 combination forms
available. In AND is the one logic gate that if both of the input has higher input or input as 1 then
the result is 1 or higher output. Else the remaining case is nothing; the case of one of input has
lower input or input as 0 then result is lower output or output is 0. This is OR gate Boolean
operations. Also AND gate is known as Boolean product..

symbol :- Z = X & Y ( X and Y are as input and z is output)

Truth Table:-

X Y Z

0 0 0

0 1 0

1 0 0

1 1 1

3. NOT Gate :-
It has only 1 input pin and 1 output pin. It just gives us output as just the opposite
of input. It means that input is 1 then output is 0 and vice-versa also true. It works as a
complement of input.

Symbol:- Y = ~ X

Truth Table:-

X Y

0 1

1 0

● So, these three gates OR, AND , NOT are Basic logic gates because any Boolean
Function can be created by using AND, OR and NOT gates.
● •AND, OR, and NOT gates can be implemented using NAND/NOR Gates

4. NAND Gate :-
It has 2 input pins and 1 output pin. NAND gate is a combination(opposite) of
two basic gates: one is AND and the other is NOT.

NAND = AND + NOT

AS per NOT gate work as complement so in NAND gate return just complement of AND.
In NAND is the one logic gate that if both of the input has higher input or input as 1 then the
result is 0 or lower output. Else the remaining case is nothing; the case of one of input has lower
input or input as 0 then result is higher output or output is 1.

Symbol :-Z = ~(X & Y)

Truth Table:-

X Y Z

0 0 1

0 1 1

1 0 1

1 1 0

5. NOR Gate :-
It has 2 input pins and 1 output pin. NOR gate is a combination of two basic
gates: one is ORand the other is NOT.

NAND = OR + NOT

AS per NOT gate work as complement so in NOR gate return just complement (opposite) of OR.

NOR is the one logic gate that if both of the input has lower input or input as 0 then the result is
1 or higher output. Else the remaining case is nothing but the case of one of input has higher
input or input as 1 then result is lower output or output is 0.

Symbol :-Z = ~(X | Y)

Truth Table:-

X Y Z

0 0 1

0 1 0
 1 0 0

1 1 0
● NOR and NAND are the universal Gate because we can solve all the gates by using only
these two gates

6.XOR gate:-
XOR gate meaning Exclusive OR gate. XOR gate is a digital logic gate that gives a
true means higher output or 1 when both inputs are different. Else case it is nothing but when
both input are same then XOR give output false means lower output or 0. XOR represents the
inequality function, i.e., the output is true if the inputs are not different otherwise the output is
false. A way to remember XOR is "must have one or the other but not both".

Symbol :-Z = X ^ Y

Truth Table:-

X Y Z

0 0 0

0 1 1

1 0 1

1 1 0

7. XNOR Gate:-
XNOR gate meaning Exclusive OR gate. XNOR gate is a digital logic gate that
gives a true means higher output or 1 when both inputs are same. Else case it is nothing but
when both input are different then XOR give output false means lower output or 0. ​The two-input
version implements ​logical equality​, behaving according to the truth table to the right, and hence the
gate is sometimes called an "equivalence gate".

Symbol :- Z = ~(X ^ Y)

Truth Table:-
 X Y Z

0 0 1

0 1 0

1 0 0

1 1 1

❖ Circuit DIagram :-
 ❖ Processure:-

➢ First we open the logisim app.

➢ After we insert two input pins and one output pin for the OR gate. Then we open
the main gate folder and from this folder we insert the OR gate.
➢ We set the number of inputs to 2.
➢ After with the help of the wiring we join input and output pins and OR gate by
wire.
➢ After completing the circuit we use the change value option to change the value
of input.
➢ With the help of this option we do all the combinations which are available for 2
inputs and we note the corresponding output and we make the truth table of the
OR gate.
➢ We repeat the same process for all gates like AND, NOT, NAND,
NOR,XOR,XNOR.
➢ The small change in the NOT gate circuit there is only one input.
➢ After doing this process we get the truth table of all these gates.

❖ Observation Table:-

All truth tables corresponding that gates are shown as below :

1.OR Gate :-
X Y Z

0 0 0

0 1 1

1 0 1

1 1 1

2. AND Gate :-

X Y Z

0 0 0
 0 1 0

1 0 0

1 1 1

3. NOT Gate :-

X Y

0 1

1 0

4. NAND Gate :-

X Y Z

0 0 1

0 1 1

1 0 1

1 1 0

5. NOR Gate :-

X Y Z

0 0 1

0 1 0

1 0 0
 1 1 0

6.XOR gate:-

X Y Z

0 0 0

0 1 1

1 0 1

1 1 0

7. XNOR Gate:-

X Y Z

0 0 1

0 1 0

1 0 0

1 1 1

❖ Conclusion:-
OR gate use for boolean sum, AND gate use for boolean product, NOT use for
investing the input. Basic gates are used for understanding universal gates. Universal
Gates are useful for deriving and understanding all types of gates. XOR is used for
inequality and XNOR is used for equivalence status.