Skip to main content

Basic Logic Gates / and gate , or gate and many more gate

 

Basic Logic Gates

Logic gates are an important concept if you are studying electronics. These are important digital devices that are mainly based on the Boolean function. Logic gates are used to carry out logical operations on single or multiple binary inputs and give one binary output. In simple terms, logic gates are the electronic circuits in a digital system.

In this lesson, we will further look at the different types of basic logic gates with their truth table and understand what each one is designed for.

Table of Content

Types of Basic Logic Gates

There are several basic logic gates used in performing operations in digital systems. The common ones are;

  • OR Gate
  • AND Gate
  • NOT Gate
  • XOR Gate

Additionally, these gates can also be found in a combination of one or two. Therefore we get other gates such as NAND Gate, NOR Gate, EXOR Gate, EXNOR Gate.

Also Read: Transistor

OR Gate

In OR gate the output of an OR gate attains the state 1 if one or more inputs attain the state 1.

Logic symbol of OR gate

 

The Boolean expression of OR gate is Y = A + B, read as Y equals A ‘OR’ B.

The truth table of a two-input OR basic gate is given as;

ABY
000
011
101
111

AND Gate

In AND gate the output of an AND gate attains the state 1 if and only if all the inputs are in state 1.

Logic Symbol of AND Gate

 

The Boolean expression of AND gate is Y = A.B

The truth table of a two-input AND basic gate is given as;

ABY
000
010
100
111

NOT Gate

In NOT gate the output of a NOT gate attains the state 1 if and only if the input does not attain the state 1.

Logic Symbol of NOT gate

 

 

The Boolean expression is Y =

, read as Y equals NOT A.

The truth table of NOT gate is as follows;

AY
01
10

The three gates (OR, AND and NOT), when connected in various combinations, give us basic logic gates such as NAND, NOR gates, which are the universal building blocks of digital circuits.

NAND Gate

This basic logic gate is the combination of AND and NOT gate.

Logic Symbol of NAND gate

 

The Boolean expression of NAND gate is Y =

The truth table of a NAND gate is given as;

ABY
001
011
101
110

NOR Gate

This gate is the combination of OR and NOT gate.

Logic Symbol of NOR

 

 

The Boolean expression of NOR gate is Y =

The truth table of a NOR gate is as follows;

ABY
001
010
100
110

Exclusive-OR gate (XOR Gate)

Comments

Post a Comment

Popular posts from this blog

What is two transistor model of scr ? Explain SCR

  Power electronics Two Transistor Model of SCR full explain and pdf. Basic operating principle of SCR, can easily be understood by the two transistor model of SCR , as it is a combination of p and n layers. This is a pnpn thyristor. If we bisect it through the dotted line then we will get two transistors i.e. one pnp transistor with J 1 and J 2 junctions and another is with J 2 and J 3 junctions as shown in figure below. The relation between the collector current and emitter current is shown below Here, I C is collector current, I E is emitter current, I CBO is forward leakage current, α is common base forward current gain and relationship between I C and I B is Where, I B is base current and β is common emitter forward current gain. Let’s for transistor T 1 this relation holds And that for transistor T 2 Now, by the analysis of two transistors model we can get anode current, From equation (i) and (ii), we get, If applied gate current is I g then cathode current will b...
1 comment
Read more

If K is the transformation ratio, then the secondary phase voltage of delta-delta connected three phase transformer will be

  Delta-Delta Connection in Three Phase Transformers - MCQs with Answers Q1. If K is the transformation ratio, then the secondary phase voltage of delta-delta connected three phase transformer will be. a. 1 / K times of the primary phase voltage b. Equal to the primary phase voltage c. 1 / K ∧ 2 times of the primary phase voltage d. K times the primary phase voltage ANSWER: d. K times the primary phase voltage
Post a Comment
Read more

BISECTION METHOD (BOLZANO METHOD) / what is BISECTION METHOD (BOLZANO METHOD)

  Explain BISECTION METHOD (BOLZANO METHOD).  Engineering maths The method is applicable for numerically solving the equation  f ( x ) = 0 for the  real  variable  x , where  f  is a  continuous function  defined on an interval [ a ,  b ] and where  f ( a ) and  f ( b ) have opposite signs. In this case  a  and  b  are said to bracket a root since, by the  intermediate value theorem , the continuous function  f  must have at least one root in the interval ( a ,  b ). At each step the method divides the interval in two by computing the midpoint  c  = ( a + b ) / 2 of the interval and the value of the function  f ( c ) at that point. Unless  c  is itself a root (which is very unlikely, but possible) there are now only two possibilities: either  f ( a ) and  f ( c ) have opposite signs and bracket a root, or  f ( c ) and  f ( b...
Post a Comment
Read more