Scribd
Upload
71 views1 page

Part-A: Sub Code: Ec8392 Sub Name: Digital Electronics Dept/Year/Sem: Ece/Ii/03

This document contains 15 questions related to digital electronics topics like Boolean algebra, Karnaugh maps, combinational logic circuits, adders, encoders, decoders, and comparators. The questions cover simplifying Boolean functions using Quine-McCluskey and K-maps, proving theorems, implementing logic functions with gates, drawing circuits for half adders, full adders, magnitude comparators, and explaining their operations. It also includes questions on binary to decimal conversion, limitations of K-maps, examples of combinational circuits, and comparing encoders and decoders.

Uploaded by

suganya1190
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
71 views1 page

Part-A: Sub Code: Ec8392 Sub Name: Digital Electronics Dept/Year/Sem: Ece/Ii/03

This document contains 15 questions related to digital electronics topics like Boolean algebra, Karnaugh maps, combinational logic circuits, adders, encoders, decoders, and comparators. The questions cover simplifying Boolean functions using Quine-McCluskey and K-maps, proving theorems, implementing logic functions with gates, drawing circuits for half adders, full adders, magnitude comparators, and explaining their operations. It also includes questions on binary to decimal conversion, limitations of K-maps, examples of combinational circuits, and comparing encoders and decoders.

Uploaded by

suganya1190
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

ANNAI TERESA COLLEGE OF ENGINEERING THIRUNAVALUR 12.

(a)Simplify the function using Quine Mc-Cluskey Method


INTERNAL ASSESSMENT –I ODD SEM (2019-20) F=Σ(0,1,2,3,5,7,9,10,11,13,15).
DEPARTMENT OF ELECTRONICS AND COMMUNICATION
ENGINEERING
(Or)
SUB CODE: EC8392 MARKS : 100 (b)Minimize the logic function using K-maps and realize using
SUB NAME: DIGITAL ELECTRONICS TIME :3Hrs logic gates F(A,B,C,D)= m(1,3,5,8,9,11,15)+d(2,13).
DEPT/YEAR/SEM : ECE/II/03 DATE:
13.(a) Using K-map find the MSP form of F=(0-3, 12-15)+d(7,11)
PART-A (Or)
(b)Design a 2-bit magnitude comparator with outputs: A>B,
(10*2= 20 Marks)
A=B, A<B
1. State and prove DeMorgan’s theorem.
2. Prove Boolean theorem x+xy=x. 14.(a) (i) Draw the circuit of a BCD adder and explain its operation.
3. Express the following function in terms of max-terms AB' + (ii) Implement the Boolean function using Multiplexers
A'B'D + A'CD'. F(A,B,C,D) =m(0,1,3,4,8,9,15).
4. Convert the given decimal numbers to their binary (Or)
equivalent 108.364, 268.028. (b) Draw 4-bit magnitude comparator with three outputs : A>B,
5. Show how to connect NAND gates to get an AND gate and A=B, A<B.
OR gate.
6. State the limitations of K-Map. 15.(a)Explain 4-bit binary adder in detail with neat diagram.
7. Give four examples of combinational circuits. (Or)
8. Draw the truth table and the logic circuit of half adder. (b)Implement the full adder using Mux and Demux.
9. Compare the function of Encoder and Decoder.
10. Draw full adder using two half adder.
PART-C
(1*15= 15 Marks)
PART – B 16. (a) Find an expression for the function using Tabulation method
(5 *13=65 Marks) and prove it
11.(a) Using Quine Mc-Cluskey Method using K-Map F(A,B,C,D) = m(1,2,3,4,5,7,9,10,11,13,15).
F=Σ(0,1,2,8,9,15,17,21,24,25,27,31) ,simplify the above function (Or)
(Or) (b) Explain Carry Look-ahead adder or Fast adder with suitable
(b) Using K-Map find the SOP and POS form of diagrams.
F= (0,1,2,3,12,13,14,15)+ d(7,11).

You might also like