Docsity
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Docsity AI
Docsity AI
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search for your university

Find the specific documents for your university's exams

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

Logic Gates: Fundamentals and Applications in Digital Circuits, Exercises of Logic

Swansea UniversityLogic

Boolean algebra: it is Boolean expression for particular gate. Basically logic gates are OR gate, AND gate, NOT gate, NOR gate, NAND gate and XOR gate.

Typology: Exercises

2021/2022

Uploaded on 09/12/2022

stifler
stifler 🇮🇹

4

(7)

215 documents

1 / 7

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
LOGIC GATES
A Logic Gate is an elementary building block of a digital circuit.
Most Logic Gates have two inputs and one output.
At any given moment, every terminal is one of the two binary conditions
LOW (0) or HIGH (1) represented by different voltage levels.
In most logic gates, low state is approximately zero volt (0 V), while the
high state is approximately five volts positive (+5 V).
Basic logic circuits with one or more inputs and only one output are known
as gates
Representing Logic Functions
There are several ways of representing logic functions
Symbol to represents the gates
Truth tale
Boolean algebra
Logic expression of symbol: input variables are A, B and the output variable
is Y, then the logic expression for particular gate.
Truth Table: Truth table is table, which represents all the possible values of
logical variable/statements along with all the possible results of given
combinations of values.
Boolean algebra: it is Boolean expression for particular gate.
Basically logic gates are OR gate, AND gate, NOT gate, NOR gate, NAND gate
and XOR gate.
pf3
pf4
pf5

Partial preview of the text

Download Logic Gates: Fundamentals and Applications in Digital Circuits and more Exercises Logic in PDF only on Docsity!

LOGIC GATES

 A Logic Gate is an elementary building block of a digital circuit.  Most Logic Gates have two inputs and one output.  At any given moment, every terminal is one of the two binary conditions LOW (0) or HIGH (1) represented by different voltage levels.  In most logic gates, low state is approximately zero volt (0 V), while the high state is approximately five volts positive (+5 V).  Basic logic circuits with one or more inputs and only one output are known as gates Representing Logic Functions There are several ways of representing logic functions  Symbol to represents the gates  Truth tale  Boolean algebra Logic expression of symbol: input variables are A, B and the output variable is Y, then the logic expression for particular gate. Truth Table: Truth table is table, which represents all the possible values of logical variable/statements along with all the possible results of given combinations of values. Boolean algebra: it is Boolean expression for particular gate. Basically logic gates are OR gate, AND gate, NOT gate, NOR gate, NAND gate and XOR gate.

OR – GATE

OR gate symbol is Boolean expression is A+B (“A or’ d with B”) Logic expression: Input variable are A,B and the output variable is Y, then the logic expression for OR gate is Y = A+B. Circuit diagram: Truth table:  This circuit will give high output (1), if any input is high (1) , otherwise the output is low (0) Input (A) Input (B) Output (Y= A+B) 0 0 0 0 1 1 1 0 1 1 1 1

NOT – GATE

OR gate symbol is Boolean expression is A invert Logic expression: Input variable is A and the output variable is Y, then the logic expression for NOT gate is YA Circuit diagram: Truth table:  This is the simplest gate it just inverts the input, if input is high the output will be low and conversely Input (A) (^) Output (Y= A ) 0 1 1 0 YA

NOR Gate  NOR is a combination of OR gate and NOT gate  i.e., OR gate +NOT gate = NOR gate  The NOR gate works opposite to the OR gate  Its Boolean algebra representation is Y A^ B Logic Symbol: or Truth table:  This circuit will give high output (1), if both inputs is low (0), otherwise the output is low (0)  The symbol is an OR gate with a small circle on the output. The small circle represents inversion. Input (A) Input (B) (^) Output( ) 0 0 1 0 1 0 1 0 0 1 1 0

Y A  B

Y A  B Y A^ B

XOR- Gate  XOR gate also refer to represented as exclusive - OR gate  it is a digital logic gate with two or more inputs and one output that performs exclusive disjunction  One element clearly missing from the set of Boolean operations is that of Exclusive-OR, often represented as XOR. Whereas the OR function is equivalent to Boolean addition, the AND function to Boolean multiplication, and the NOT function (inverter) to Boolean complementation, there is no direct Boolean equivalent for Exclusive-OR. Logic Symbol: Truth Table: The output of an XOR gate is high (1) only when exactly one of its inputs is high (1). If both of an XOR gate's inputs are low (0), or if both of its inputs are high (1), then the output of the XOR gate is low. Input (A) Input (B) Output

Y  A  B

B

A

Y  A  B