MODULE-1
1. State and explain De Morgan’s theorems with truth tables. OR State and prove De Morgan Theorem.
2. Define: 1) Fan in 2) Noise Margin 3) Propagation Delay 4) Power Dissipation
3. Discuss Universal gates. Obtain AND, OR gate using NAND and NOR gates.
4. Perform the Given subtraction using 2’s complement method.
5. Draw the truth table of full adder and implement it using a minimum number of logic gates.
6. Explain Excess-3 code and Gray Code.
7. Express the Boolean function F = AB + A’C in a product of maxterm.
8. Simplify the following Boolean function by means of the Tabulation Method. F(A,B,C,D) = ∑(1,2,3,5,6,7,8,9,12,13,15)
9. Give comparison of TTL and CMOS family. OR Compare TTL, ECL, & CMOS logic families
10. Explain Moore machine
11. Implement NOT, AND, & OR gates using NAND gates only.
12. Convert 1000 0110 (BCD) to decimal, binary & octal.
13. Minimize the logic function X = A(B' + C')(A + D). Also realize the reduced function using NOR gates only.
14. Design a 3-bit even parity generator circuit using XOR gates only.
15. Using suitable decoder & OR gates, design 4-bit binary to Gray code converter
16. List out problems of asynchronous circuits. Also exemplify any two problems with suitable examples.
17. List out various logic families. Also list the characteristics of digital ICs.
18. Design a counter for following binary sequence 0-1-3-4-6-0
19. Implement the following function with NAND and NOR Gate. F(a,b,c) = Σ (0,6)
20. Discuss the advantages and disadvantages of TTL Logic Family.
21. Determine the minimum state table equivalent shown in following table and draw the reduce state diagram
22. Design a 3-bit gray to binary code converter. Implement it using suitable PROM. Draw the necessary diagrams and tables.
23. Obtain canonical Sum of Product form of following function: F=AB+ACD.
24. Implement AND, OR, & EX-OR gates using NAND & NOR gates.
0 Comments