CONSTRUCT A SIMULATOR KEEPING THE LOGICAL BOOLEAN GATES

this project IS made by: swati jindal swedika tanisha sharma tanushree gupta b110010362 b110010363 b110010364 b110010365

with the help of our project guides ms. Richa gautam ms.surbhie kalia ms.ashima mr.kuldeep

ACKNOWLEDGMENT
We would like to thank all four of our project guides. Our regular meetings with our team guides helped us in making this project. Their recomendations and suggestions have been invaluable for this project and for software inmprovement.

week 1 As soon as the project topics were allotted to us, we all worked in a direction to make this project a success. In the first week all four of us searched the internet and gathered information about LOGICAL GATES.

logical gates- introduction

A digital circuit which either allows a signal to pass through or stops it, is called a gate. Such gate allows the signal to pass through only when some logical conditions are satisfied. Hence they are called logical gates. The logical gates are building blocks of a digital system. Each logic gate follows a certain logic relationship between input and output voltages. The basic logic gates are of three types: 1) OR Gate 2) AND Gate 3) NOT Gate

Each basic logic gate is represented by a symbol and its function is defined either by a truth table or by a Boolean expression. In digital circuits, we mostly use junction diodes and transistors as switches to change from one voltage level to another. In the analysis of the digital circuits, we find out whether a voltage is low or high. In digital circuits low and high voltages are often represented by levels 0 and 1 respectively.

TRUTH TABLE- It is table that shows all possible input combinations and the corresponding output combinations for a logic gate. It is also called a table of combinations.

BOOLEAN EXPRESSION- George Boole invented a kind of algebra which deals with logical statements that have only two values, namely either a true or a Boolean variables. The true value of a Boolean variable is denoted by 1 and the false value by 0. It is to be noted that the symbols 1 and 0 have nothing to do with numeric values 1 and 0. In electronic circuits, the symbols 1 and 0 are used to represent the active and passive states(i.e on or off states) of a circuit component, say a diode or a transistor or a switch etc.

week 2
The second step was to grab all the required information regarding our topic Construct a simulator keeping the logical Boolean Gates. Each team member at their own level went through different study materials to have a better know how regarding the project title and serve better to the plan.

types of gates:
1) AND Gate 2) OR Gate 3) NOT Gate 4) NAND Gate 5) NOR Gate 6) XOR Gate 7) XNOR Gate

and gate
The AND gate is a device that combines input1 with input2 to give an output. The AND gate takes two or more inputs and gives one output. The logic symbol for AND gate is:

Input voltages can be low or high depending upon the following truth table.
Input 1 0 0 1 1 Input 2 0 1 0 1 Output 0 0 0 1

The multiplication sign(either * or . ) is referred to as Boolean algebra. The Boolean expression. Input 1*Input 2= output indicates output equals input 1 AND input 2.

OR Gate The OR gate is a device that combines input1 with input2 to give output as the result. The OR gate has two or more inputs and one output. The logic symbol of OR gate is:

Input voltages can be high or low depending upon the following truth table.
Input 1 0 0 1 1 Input 2 0 1 0 1 Output 0 1 1 1

In Boolean algebra addition symbol is referred to as OR. Input 1 + Input 2= Ouput

not Gate
The NOT gate is a device that inverts the inputs. If input is 1, then the output is not 1, but is 0 and if input is 0, then the output is not 0 but 1. The NOT gate is one inpt and one output device. Its logic symbol is:

The truth for NOT gate is

Input 1 Output 0

The bar symbol(-) is referred to as NOT in Boolean algebra. ________ input 1= output Thus, NOT operation is also called negation or inversion.

SoMe useful laws of boolean algebra

(a) Commutative laws (1) input1 + input2 = input2 + input1; (2) input1. input2 = input2. Input1 (b) Associative laws
(1) input1 + (input2 + input3) = (input1 + input2) + input3;

(2) input1. (input2. Input3) = (input1. Input2). Input3

(c) Distributive laws

(1) input1. (input2 + input3) = input1. Input2 + input1. Input3; (2) (input1+input2). (input1+input3)= input1 + input2.input3

week 3: Now the real work begins... There are numerous methods and functions that C language provides to make the program work with ease The key function which we have used in our program is the switch statement. Switch statement is defined across many individual lines using one or two keywords. A typical syntax is: 1) The first line contains the basic keyword,usually switch, case or select, followed by an expression or control variable of the switch statement. 2)Subsequent lines define the actual cases(the value) with corresponding sequences of statements that should be executed when a match occur.

After discussions and suggestions by our guide, Ms. Surbhie Kalia, we came up with the coding of our program.

week 4 Week 4 finally saw our program running without any errors.