Scribd
Upload
15 views2 pages

Digital Fundamental Chapter - 2

The document outlines various tasks related to Boolean algebra and digital logic design, including minimizing Boolean functions using K-maps, converting expressions to canonical forms, and designing circuits like BCD-to-7-segment decoders and adders. It also covers topics such as quantization, encoding, and De Morgan's theorems, alongside practical implementations of combinational circuits. Additionally, it includes exercises on truth tables, logic circuit designs, and simplification methods for Boolean functions.

Uploaded by

sagarchauhan8411
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
15 views2 pages

Digital Fundamental Chapter - 2

The document outlines various tasks related to Boolean algebra and digital logic design, including minimizing Boolean functions using K-maps, converting expressions to canonical forms, and designing circuits like BCD-to-7-segment decoders and adders. It also covers topics such as quantization, encoding, and De Morgan's theorems, alongside practical implementations of combinational circuits. Additionally, it includes exercises on truth tables, logic circuit designs, and simplification methods for Boolean functions.

Uploaded by

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

DF Chapter-2

1. Minimize following Boolean function using K-map: X(A,B,C,D) = Σ m(0, 1, 2, 3, 5, 7, 8,9, 11,
15)
2. 1. Convert Y = AB + AC’ + BC into canonical SOP form. 2. Convert Z = (A+B)(A+C)(B+C’) into
canonical POS form.
3. Write a brief note on BCD-to-7-segment decoder/driver. Set up a single 7-segement LED
display using 7447 BCD-to-7-segment decoder/driver.
4. Write a brief note on full subtractor with the help of its TT. Also design full subtractor logic
circuit using 3 x 8 decoder and OR gates. Use X, Y, & Z as input variables and D & B as output
variables.
5. List out various methods of simplifying a given Boolean function. Solve F = AB + AB’ using any
two methods.
6. Minimize the following logic function using K-map: F(A,B,C,D) = Σ m(1, 3, 5, 8, 9, 11, 15) +
d(2,13)
7. Write a brief note on quantization and encoding.
8. Implement the following Boolean function using MUX a) F(A,B,C) = ∑(1,3,6) b) F(A,B,C) =
π(2,3,5)
9. Design a Combinational circuit that convert 8- 4 -2 -1 code to BCD.
10. Compare Half adder and Full adder.
11. Implement 2-bit Magnitude comparator.
12. Simplify Boolean function using K-MAP F(A, B, C, D)=ABC’D’ + ABC’D + ABCD’ + AB’CD’
13. Explain 4 bit Binary Parallel Adder.
14. Explain Minterm and Maxterm.
15. Explain the half subtractor with logic circuit.
16. Minimized the boolean expression using K-map f (A, B, C, D) = ∑m (0, 1, 5, 6, 7, 8, 9) + d(10,
11, 12, 13, 14, 15)
17. Design BCD to excess-3 converter.
18. Design a circuit which compare two binary number whether A>B, A=B or A<B.
19. State and explain De Morgan’s theorems with truth tables.
20. Express the Boolean function F = A + B’C in a sum of minterms.
21. Reduce the expression F = A [ B + C’ (AB + AC’)’]
22. Simplify the following Boolean function by using the tabulation method. F (A, B, C, D) = Σ m
(0, 1, 2, 8, 10, 11, 14, 15).
23. Simplify the Boolean function F (w, x, y, z) = Σ m (0, 1, 2, 4, 5, 6, 8, 9, 12, 13, 14)
24. Design 1 - bit Magnitude Comparator.
25. Design a full adder and realize full adder using 3X8 Decoder and 2 OR gates.
26. Simplify the Boolean function F = A’B’C’ + B’CD’ + A’BCD’ + AB’C’
27. Explain 4 – bit parallel adder.
28. Implement the following function using 8X1 MUX F (A, B, C, D) = Σ m (0, 1, 3, 4, 8, 9, 15)
29. State and prove De-Morgan’s theorems using truth-tables.
30. Construct Hamming code for BCD 0110. Use even parity.
31. Given a logic function: Z = ABC + BC’D + A’BC. (i) Make a truth table. (ii) Simplify using K-map.
(iii)Realize simplified function using NAND gates only.
32. Draw the logic diagram of 1-digit BCD adder.
33. Minimize following Boolean function using K-map: Y(A,B,C,D) = Σ m(0, 1, 2, 3, 5, 7, 8, 9, 11,
14)
34. Draw truth table of 2-bit digital comparator.
35. Minimize following Boolean function using K-map: F(A,B,C,D) = Σ m(1, 3, 7, 11, 15) + d(0, 2, 5)

You might also like