M S Engineering College: Digital Electronics Lab Manual
M S Engineering College: Digital Electronics Lab Manual
M S Engineering College: Digital Electronics Lab Manual
Dr. Venkateshappa
Professor& Head
Department of Electronics and Communication Engineering
M. S. Engineering College, Bengaluru – 562110
M S Engineering College
Vision
M.S.Engineering College shall blossom into a technical institution of national
importance with global network.
Mission
• To be the leading institution in imparting Quality Engineering Education with value
systems amongst students to face global challenges.
Quality Policy
Striving for Excellence in Quality Engineering Education.
Our commitment to comply with mandatory requirements.
Vision
To equip students with strong technical knowledge by logical and innovative
thinking in Electronics and Communication Engineering domain to meet expectations
of the industry as well as society.
Mission
To educate a new generation of Electronics and Communication Engineers by
providing them with a strong theoretical foundation, good design experience and
exposure to research and development to meet ever changing and ever demanding
needs of the Electronic Industry in particular, along with IT & other inter disciplinary
fields in general.
Provide ethical and value based education by promoting activities addressing the
societal needs.
To build up knowledge and skills of students to face the challenges across the globe
with confidence and ease.
Quality Policy
Our quality policy is to develop an effective source of technical man power with
the ability to adapt to an intellectually and technologically changing environment to
contribute to the growth of nation with the participative efforts of the management, staff,
students and industry while keeping up ethical and moral standards required
Program Outcomes:
1. Engineering knowledge: Apply the knowledge of mathematics, science, engineering
fundamentals, and an engineering specialization to the solution of complex engineering
problems.
5. Modern tool usage: Create, select, and apply appropriate techniques, resources, and
modern engineering and IT tools including prediction and modeling to complex
engineering activities with an understanding of the limitations.
6. The engineer and society: Apply reasoning informed by the contextual knowledge to
assess societal, health, safety, legal and cultural issues and the consequent
responsibilities relevant to the professional engineering practice.
12. Life-long learning: Recognize the need for, and have the preparation and ability to
engage in independent and life-long learning in the broadest context of technological change.
PSO-Program Specific Objectives
IA Evaluation
Record Conduction of Lab Internals Total
maintenance
Write up Execution of the Viva
(weekly submission) required Result
10M 10M 15M 5M 40M
Theorem 2: The compliment of the sum of two variables is equal to the product of the
compliment of each variable. Thus according to De Morgan’s theorem if A and B are the two
variables then,
De-Morgan's laws can also be implemented in Boolean algebra in the following steps:-
1. While doing Boolean algebra at first replace the given operator. That is (+) is replaced
with (.) and (.) is replaced with (+).
2. Compliment of each of the term is to be found.
Procedure:
1. Realize the Demorgans theorem using logic gates.
2. Connect VCC and ground as shown in the pin diagram.
3. Make connections as per the logic gate diagram.
4. Apply the different combinations of input according to the truth tables.
Verify that the results are correct.
Procedure:
1. Verify that the gates are working.
2. Construct a truth table for the given problem.
3. Draw a Karnaugh Map corresponding to the given truth table.
4. Simplify the given Boolean expression manually using the Karnaugh Map. A.
Implementation Using Logic Gates:
5. Realize the simplified expression using logic gates.
6. Connect VCC and ground as shown in the pin diagram.
7. Make connections as per the logic gate diagram.
8. Apply the different combinations of input according to the truth tables.
Verify that the results are correct.
B. Implementation Using Universal Gates:
1. Convert the AND-OR logic into NAND-NAND and NOR-NOR logic.
2. Realize the simplified Boolean expressions using only NAND gates, and then using only
NOR gates.
3. Connect the circuits according to the circuit diagrams, apply inputs according to the truth
table and verify the results.
Result:
S =A⊕B C = A.B
Full-Adder: The half-adder does not take the carry bit from its previous stage into account.
This carry bit from its previous stage is called carry-in bit. A combinational logic circuit that
adds two data bits, A and B, and a carry-in bit, Cin , is called a full-adder. The Boolean
functions describing the full-adder are:
Truth Table
A B C S C=
=A⊕B⊕C A.B+C(A+B)
0 0 0 0 0
0 0 1 1 0
0 1 0 1 0
0 1 1 0 1
1 0 0 1 0
1 0 1 0 1
1 1 0 0 1
1 1 1 1 1
Realization using basic gates
Half Subtractor: Subtracting a single-bit binary value B from another A (i.e. A-B) produces
a difference bit D and a borrow out bit Br. This operation is called half subtraction and the
circuit to realize it is called a half subtractor. The Boolean functions describing the half-
Subtractor are:
Truth Table
A B D =A⊕B Br = A.B
0 0 0 0
0 1 1 1
1 0 1 1
1 1 0 0
D =A ⊕ B Br= A’.B
Truth Table
A B C S C=
=A⊕B⊕C A’.B+A’.C+B.C
0 0 0 0 0
0 0 1 1 1
0 1 0 1 1
0 1 1 0 1
1 0 0 1 0
1 0 1 0 0
1 1 0 0 0
1 1 1 1 1
Procedure:
1. Verify for working of the gates.
2. Make the connections as per the circuit diagram for the half adder circuit, on the trainer
kit.
3. Switch on the VCC power supply and apply the various combinations of the inputs
according to the respective truth tables.
4. Verify that the outputs are according to the expected results.
5. Repeat the procedure for the full adder circuit, the half subtractor and full subtractor
circuits.
6. Verify that the sum/difference and carry/borrow bits are according to the expected values.
Result:
OR
Procedure:
1. Check all the components for their working.
2. Insert the appropriate IC into the IC base.
3. Make connections as shown in the circuit diagram. 4. Apply 0 for the bits A5, A6, A7,
B5, B6, B7 OR ground them. 5. Apply given data to the rest of the bits.
6. Verify the results and observe the outputs.
Result:
Procedure:
1. The connection is made as shown in the diagram.
2. Here, S1 and S0 are the channel selection lines,I0, I1, I2, I3 are the respective data lines of
the channels and Y is the output.
3. Based on the selection lines one of the inputs will be selected at the output, and thus the
truth table is verified.
Result:
Procedure:
1. For the given expression, a truth table is to be written.
2. An expression in SOP format is to be written.
3. The connection is made according to the obtained expression.
4. The truth table is verified for that particular expression.
Result:
Procedure:
1. For the given Boolean expression, a truth table is to be written.
2. An expression in SOP format is to be written.
3. The connection is made according to the obtained expression.
4. The truth table is verified for that particular expression.
Result:
Theory:
A ring counter is a circular shift register which is initiated such that only one of its
flip-flops is the state one while others are in their zero states.
A ring counter is a Shift Register with the output of the last one connected to the input
of the first, that is, in a ring. Typically, a pattern consisting of a single bit is circulated
so the state repeats every n clock cycles if n flip-flops are used. It can be used as a
cycle counter of n states.
A Johnson counter (or switch tail ring counter, twisted-ring counter, walking-ring
counter, or Moebius counter) is a modified ring counter, where the output from the
last stage is inverted and fed back as input to the first stage. The register cycles
through a sequence of bit-patterns, whose length is equal to twice the length of the
shift register, continuing indefinitely. These counters find specialist applications,
including those similar to the decade counter, digital-to-analog conversion, etc. They
can be implemented easily using D- or JK-type flip-flops.
Procedure:
1. Make the connections as shown in the respective circuit diagram.
2. Initial condition is set by setting up the circuit as shown in the figure.
3. Apply clock and observe the output after each clock pulse, record the observations
and verify that they match the expected outputs from the truth table.
4. Repeat the same procedure as above for the Johnson Counter circuit and verify its
operation.
Result:
Result:
Result: