nashik cambridge school

NASHIK CAMBRIDGE SCHOOL(Affiliated to CBSE, Delhi Up to Senior Sec Level)

NASHIKACADEMIC YEAR: 2012-2013

A PROJECT REPORT ON “DESIGNING AN APPROPRAITE LOGIC

GATE COMBINATION FOR GIVEN TRUTH TABLE”

BY:-TEJASWINI AHIRE

Under the Guidance ofMs.SAPNA PANDEY

DEPARTMENT OF PHYSICS

E- MAIL:nashikcambridge2004@rediffmail.comTELEPHONE NO. : 0253-2377638\2377639

NASHIK CAMBRIDGE SCHOOL(Affiliated to CBSE, Delhi up to Sr. Secondary Level)

C e r t i f i c a t eThis is to certify that the project report entitled

“DESIGNING AN APPROPRAITE LOGIC GATE COMBINATION FOR GIVEN TRUTH TABLE”

Has been successfully submitted by

TEJASWINI AHIREProject guide PrincipalMs.Sapna Pandey Mr.C.Somu

External Examiner

ACKNOWLEDGEMENT

We the class XII students of Nasik Cambridge school were able to present the project work before you with the

help of Head of department of Physics Ms.Sapna& grateful & valuable

contribution of our respected principal Mr.C.Somu. We also acknowledge the

contribution of the individuals & staff of our Physics Department

CONTENTS

INTRODUCTION

REQUIREMENTS

THEORY

PROCEDURE

RESULT

BIBLIOGRAPHY

INTRODUCTION:

Logic Gates:

The digital circuit that can be analyzed with the help of Boolean Algebra is called logic

Gate or logic circuit. A logic gate can have two or more inputs But only one output. There are 3 fundamental logic gates namely OR gate, AND gate and NOT gate.

Truth Table:

The operation of a logic gate or circuit can be represented in a table which contains all possible inputs and their corresponding Outputs are called a truth table. If there are n inputs in any logic gate, then there will be n2 possible input Combinations. 0 and 1 inputs are taken in the order of ascending binary numbers for easy Understanding and analysis.

REQUIREMENTS: A battery of 6V

Two switches

Torch bulb

Connecting wires

THEORY:

(d) NOR gate:

The NOR gate is constructed by combining the OR gate and the NOT gate (OR + NOT = NOR). Here the output of the OR gate is given as input to the NOT gate

w

PROCEDURE:1. Write product term for each input (minterm). Combination where Boolean function has input 1. While writing minterm, complement that variable whose value is 0 otherwise write it in direct form (without complement).2. Add all the minterms to obtain the Boolean function.3. Draw the circuit using BASIC LOGIC Gates.

Example:(a).

X Y F MINTERM 0 0 1 x.y 0 1 0 - 1 0 0 - 1 1 1 x.y

The Boolean function F(X, Y) is obtained as:

F(X, Y) =X.Y+X.Y

(b).

X Y Z F MINTERM 0 0 0 0 - 0 0 1 1 XYZ 0 1 0 1 XYZ 0 1 1 0 - 1 0 0 1 XYZ 1 0 1 0 - 1 1 0 1 XYZ 1 1 1 0 -The Boolean function F(X, Y) is given as:

F(X, Y) =XYZ+XYZ+XYZ+XYZ

RESULT:A logic gate is prepared from the given truth table.

BIBLIOGRAPHY: 1. www.wikipedia.org3. 2. Comprehensive Practical Chemistry for Class XII