Basic logic gates, Computer Engineering

Basic logic gates

Introduce the basic logic gates in terms of

a) their function,

b) their circuit symbol,

c) their truth table and

d) their equivalent in Boolean algebra (a mathematical method based on human reasoning which will be explained later).

 

The NOT gate or inverter.

The NOT gate is the simplest of all logic circuits. It has just one input and one output. If the input is a logic level 1 then the output is a logic level 0. Similarly if the input is 0 then the output is 1 so that the output is the inverse of the input. The circuit symbol is

1351_NOT gate or inverter.png

The truth table for a NOT gate is

A

X

0

1

1

0

The Boolean algebra equivalent is 

X-> ‾A

 

The OR gate.

The output of an OR gate is at logic level 1 when any of the inputs are high otherwise it is at logic level 0. There may be any number of inputs. The circuit symbol for a three input OR gate is

1307_OR gate.png

 

The Boolean algebra equivalent is

X = A + B + C

 

The truth table of a three input OR gate is

A

B

C

X

0

0

0

0

0

0

1

1

0

1

0

1

0

1

1

1

1

0

0

1

1

0

1

1

1

1

0

1

1

1

1

1

 

The AND gate.

The output of an AND gate is only high when all of the inputs are high, otherwise the output is low. There may be any number of inputs just like the OR gate. The circuit symbol for a three input AND gate is

 

1422_AND gate.png

 

 

The truth table for a three input AND gate is

A

B

C

X

0

0

0

0

0

0

1

0

0

1

0

0

0

1

1

0

1

0

0

0

1

0

1

0

1

1

0

0

1

1

1

1

 

The Boolean algebra equivalent is

X = A.B.C

 

Posted Date: 8/20/2012 10:41:18 PM | Location : United States







Related Discussions:- Basic logic gates, Assignment Help, Ask Question on Basic logic gates, Get Answer, Expert's Help, Basic logic gates Discussions

Write discussion on Basic logic gates
Your posts are moderated
Related Questions
What is Algorithm Design Technique? An  algorithm  design  method  is  a  general  approach  to  solving  problems  algorithmically  that  is applicable to a variety of proble

Explain FIFO Page replacement algorithm. FIFO policy: This policy only removes pages in the order they entered in the main memory. By using this policy we simply eliminate a

what is uml ?

Q. Define Logical data as operand data type? Every word or byte is treated like a single unit of data. Whenever an n-bit data unit is considered as comprising n 1-bit items of

Event-based Simulator Digital  Logic  Simulation  method  sacrifices  performance  for  rich  functionality:  each active signal  is  calculated  for  every  device  it  propa

Q. Determine the statement for array? Determine the statement ALIGN A[i] WITH B[i] This statement aligns every A[i] with B[i] as displayed in Figure below. Figure

Grounding a variable - first-order logic: The perform of making ourselves clear about a variable by introducing an exists or a forall sign is called quantifying the variable.


Q. In PRAM model steps required for executing an algorithm? Subsequent steps are performed by a PRAM model whenever executing an algorithm: i) Read phase: First the N proc

Bespoke versus off-the-shelf software Generally software packages are bought off-the-shelf. Though, certain applications (generally for industrial companies, commercial busines