3 Aoi Circuit
-
Upload
sohil-vohra -
Category
Documents
-
view
109 -
download
1
description
Transcript of 3 Aoi Circuit
![Page 1: 3 Aoi Circuit](https://reader031.fdocuments.in/reader031/viewer/2022020115/546a657eb4af9f321e8b46bc/html5/thumbnails/1.jpg)
DIGITAL ELECTRONICS (331102)
14 | P a g e SOHIL VOHRA (LECTURER - SHRI K.J. POLYTECHNIC COLLEGE, BHARUCH (C.E. DEPTT))
PRATICAL: 03
STUDY OF AND – OR – INVERT CIRCUIT
1.0 AIM :
To design and realize an AND-OR-INVERT logic.
2.0 PRIOR CONCEPTS :
Knowledge of working of AND, OR, NOT gate.
Student should be able to make a truth table.
Concept of K – Maps.
Minimization using Boolean algebra.
3.0 INTRODUCTION
All the circuits in the digital electronics can be constructed using the basic three
logic gates namely, AND, OR and NOT (AOI).
The basic concept to design the circuit can be implemented using K – Maps or the
truth tables of given combinations.
4.0 HOW TO REALIZE THE CIRCUITS?
A digital circuit is often constructed from small electronic circuits called logic
gates.
Each logic gate represents a function of boolean logic. A logic gate is an
arrangement of electrically controlled switches.
The classical way to represent a digital circuit is with an equivalent set of logic
gates.
Another way, often with the least electronics, is to construct an equivalent system
of electronic switches (usually transistors). One of the easiest ways is to simply
have a memory containing a truth table. The inputs are fed into the address of
the memory, and the data outputs of the memory become the outputs.
Once the Boolean logic is provided, we can easily design the circuit using the
Boolean logic on the circuit.
Simplification of the circuit can be easily realized by using different Boolean Laws.
![Page 2: 3 Aoi Circuit](https://reader031.fdocuments.in/reader031/viewer/2022020115/546a657eb4af9f321e8b46bc/html5/thumbnails/2.jpg)
DIGITAL ELECTRONICS (331102)
15 | P a g e SOHIL VOHRA (LECTURER - SHRI K.J. POLYTECHNIC COLLEGE, BHARUCH (C.E. DEPTT))
5.0 EXERCISE :
5.1 State the Associative laws of Boolean Algebra.
Ans :
5.2 State the Commutative laws of Boolean Algebra.
Ans :
5.3 State the Distributive laws: of Boolean Algebra.
Ans :
5.4 State the Idempotent laws of Boolean Algebra.
Ans :
5.5 State the Involution law of Boolean Algebra.
Ans :
5.6 State the Consensus theorem of Boolean Algebra.
Ans :
5.7 Draw the AOI circuit for Ex-OR and Ex-NOR circuit.
Ans :
![Page 3: 3 Aoi Circuit](https://reader031.fdocuments.in/reader031/viewer/2022020115/546a657eb4af9f321e8b46bc/html5/thumbnails/3.jpg)
DIGITAL ELECTRONICS (331102)
16 | P a g e SOHIL VOHRA (LECTURER - SHRI K.J. POLYTECHNIC COLLEGE, BHARUCH (C.E. DEPTT))
6.0 ASSIGNMENTS :
6.1 Draw the equivalent AOI circuit for the circuit shown below. Also provide
the truth table of the same :
6.2 Draw the equivalent AOI circuit for the circuit shown below. Also provide
the truth table of the same :
6.3 Use Boolean algebra theorems and identities to simplify the following
equation. After that, draw the equivalent AOI logic circuit.
6.4 Prove the following using different Boolean Theorems and Laws:
(A + B) (A + C) = A + BC
Grades for Exercise: .................................................
Grades for Assignment: .................................................
Signature of Lab Co-ordinators: .................................................