Introduction

A logic gate is an idealized or physical device implementing a Boolean function, that is, it performs a logical operation on one or more logical inputs, and produces a single logical output. Depending on the context, the term may refer to an ideal logic gate, one that has for instance zero rise time and unlimited fan-out, or it may refer to a non-ideal physical device. Logic gates are primarily implemented using diodes or transistors acting as electronic switches, but can also be constructed using electromagnetic relays (relay logic), fluidic logic, pneumatic logic, optics, molecules, or even mechanical elements. With amplification, logic gates can be cascaded in the same way that Boolean functions can be composed, allowing the construction of a physical model of all of Boolean logic, and therefore, all of the algorithms and mathematics that can be described with Boolean logic. Logic circuits include such devices as multiplexers, arithmetic logic units (ALUs), and computer memory, all the way up through complete microprocessors, which may contain more than 100 million gates. In practice, the gates are made from field-effect transistors (FETs),

particularly MOSFETs (metaloxidesemiconductor fieldeffect transistors). Compound logic gates AND-OR-Invert (AOI) and ORAND-Invert (OAI) are often employed in circuit design because their construction using MOSFETs is simpler and more efficient than the sum of the individual gates. Logic gates are of three types:1) The OR Gate 2) The AND Gate 3) The NOT Gate

AIM
To create a logic gate combination for a given truth table using torch bulb, battery and switches.

APPARATUS
Torch bulb, battery, connecting wires. switches,

1. The OR Gate
Procedure
Consider a parallel combination of two switches connected in series with a bulb and battery.

Observation

The bulb will glow when either or both of the switches S1 and S2 are closed but it will not glow when both are open. The functioning of the circuit is summarized below:

The OR operation

SWITCH S1

SWITCH S2

BULB GLOWS

Open Open Closed Closed

Open Closed Open Closed

No Yes Yes Yes

4

This action of the switches is called OR operation. Now let S1 be called input A and S2 input B .Let the state of the bulb be called output Y. then the OR operator may described by the following Boolean equation or expression :

Y=A+B

which is read as Y equals A or B . Now if the ON value of Boolean variable is denoted by 1 and OFF value by 0, then the above table table can rewritten as follows: Truth table of OR operation Input A 0 0 1 1 Input B 0 1 0 1 Output Y=A+B 1 1 1 1

This table is called the truth table of the OR operation. Obviously, the output is 1 when any of the inputs is 1.

2. The AND Gate Procedure Consider two switches S1 and S2 connected in series with a bulb and a battery.

Observation
The bulb can glow only if both the switches S1 and S2 are closed. The operation of the circuit is below: The AND operation

SWITCH S1

SWITCH S2

BULB GLOWS

open open closed

Open Closed Open

No No No

closed

Closed

Yes

This action of the switches is called AND operation. The AND operator two output variables A and B to give a new output variable Y and is described by the Boolean expression: Y= A. B which is read as Y equals A and B . Thus the truth table of AND operator will be as follows: Truth table for AND operation
Input A Input B Output Y= A. B 0 0 0 1

0
0 1 1

0
1 0 1

Obviously, the output of AND operator is 1 only when both the inputs are 1.
7

3. The NOT Gate Procedure Consider a bulb short circuited by a switch S.

Observations When the switch S is open, the current flow through the bulb and it glows. When then switch S is closed, the current goes through the switch and the bulb is off (assuming zero resistance of the closed switch). The function of the circuit can be summarized in the following table. Switch S Open Closed Bulb Glows Yes No
8

This action of the circuit is called NOT operation. Let the switch S be called input A and state of the bulb be called output Y. Then the NOT operator may be described by the Boolean expression: Y= A Which is read as Y equals not A or Y equals negation A. Thus the truth table of NOT operator will be follows: Truth table for NOT operation

Input A 0 1

Output Y=A 1 0

Conclusion
Working of logic gates can be successfully explained/demonstrated by above demonstration.

10

Bibliography
1) www.wikipedia.com 2) www.google.com 3) Physics laboratory manual

11

12