Fundamental of Digital Computers QB

You might also like

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 1

1. Define 1's compliment with suitable example.

2. Illustrate 2 input OR logic Gate using logical expression


3. Summarize De-Morgan's theorem using an example
4. Define Octal number system using appropriate example
5. Illustrate the truth table of 2 input NOR Gate using logical symbol.
6. Summarize Distribution theorem using an example.
7. Define Hexadecimal number system with an example
8. Illustrate the truth table of 2 input NAND Gate using logical symbol
9. Summarize transposition theorem with an example.
10. Demonstrate min term with truth table of 2 variable A and B and output (Y)
11. Show and explain Basic logic Gates using truth tables, symbol, and logical expressions.
12. Develop the circuit using basic Gates related to the mentioned Boolean function F
and construct truth-table.
F=AC+BD
13. Simplify the logical expression using Karnaugh map method
f(A, B,C)=∑m(2,3,6,7)
OR
Simplify the logical expression using Karnaugh map method
f(A, B,C)=∑m(2,4,5,6)
14. Demonstrate POS form using truth table of 2 variable A and B and output logical
expression(Y).
15. Explain NOR and NAND logic Gates with truth tables, symbol and logical output.
16. Develop logical circuits corresponding to the following Boolean functions and construct truth
table. F=AB+BC+CD
17. Simplify the logical expression using Karnaugh map method
f(A, B,C)=∑m(1,2,3,5,7)
OR
Simplify the logical expression using Karnaugh map method
f(A, B,C)=πM(1,2,3,5,6,7)
18. Show and explain canonical, standard and minimal SOP form related to truth table of 3
variable A,B and C.
19. Explain special function circuits (Ex-OR and Ex-NOR) with truth tables, symbol and logical
output.
20. Develop logical circuits related to the mentioned Boolean functions and construct truth tables
(i) F=C+AB (ii) F=A+BC
21. Simplify the logical expression using Karnaugh map method
f(A, B,C)=∑m(1,2,3,4,6,7)
OR
Simplify the logical expression using Karnaugh map method
f(A, B,C)=∑m(1,2,5,6,7)
22. Construct Full adder and analyze using truth table and logical expression.
23. Construct D flip flop and T flip flop and compare using truth table and characteristic table.
24. Develop 3 bit Ripple up counter using truth table and circuit diagram
OR
Develop 3-bit Ripple down counter using truth table and circuit diagram
25. Construct circuits of 2×1 and 4×1 Multiplexer and analyze using truth table and output.
26. Construct SR latch using NAND and NOR Gates and compare using truth tables
27. Develop D flip flop using truth table, characteristics table and excitation table.
OR
Develop Toggle flip flop with respective truth table, characteristics, and excitation table.
28. Analyze the circuit of Full subtractor using truth table and logical expression.
29. List the difference between synchronous and asynchronous counter with suitable examples.
Also conclude Ripple counter in brief.
30. Develop J K flip flop using NAND latch with truth table and circuit diagram
OR
Develop Toggle flip flop using truth table and characteristics table.

31. Classify the different types of memories with suitable examples

You might also like