0% found this document useful (0 votes)
6 views1 page

Asiignment 1

Uploaded by

tupiprasanna1507
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
0% found this document useful (0 votes)
6 views1 page

Asiignment 1

Uploaded by

tupiprasanna1507
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/ 1

BCS302: Digital Design and Computer Organization

Assignment 1
1. Define binary logic. Explain the three basic logic operations.
2. List and explain all the basic Postulates and Theorems of Boolean Algebra.
3. Using the basic theorems and postulates of Boolean algebra, simplify the following Boolean expression:
F = x′y′z + xyz + x′yz + xy′z.
4. Show the two mplementations of the Boolean function with gates:

5. Draw the graphic symbols and truth tables of following gates: AND, OR, invertor, buffer, NAND, NOR, XOR,
XNOR.
6. Differentiate between positive and negative logic.
7. Realize the basic gates using NAND and NOR gates with graphic symbols
8. Implement the Boolean function F = xz + x′z′ + x′y with (a) NAND and inverter gates, and (b) NOR and inverter
gates
9. Simplify the Boolean function a) F (x, y, z) = Σ(2, 3, 4, 5
b)F (x, y, z) = Σ(3, 4, 6, 7) using k-map method.

10. Design 8-3 priority encoder with truth table

11. Simplify the Boolean function F(w, x, y, z) = Σ(0, 1, 2, 4, 5, 6, 8, 9, 12, 13, 14) using 4- variable k-map.

12. Simplify the Boolean function F = A′B′C′ + B′CD′ + A′BCD′ + AB′C′ using 4- variable k-map.

13. Define: prime implicant and essential prime implicant with an example.

14. Find the prime implicants of the Boolean function F(w, x, y, z) = Σ(0, 2, 4, 5, 6, 7, 8, 10, 13, 14, 15).

15. Simplify the Boolean function F(w, x, y, z) = Σ(1, 3, 7, 11, 15) which has the don’t-care conditions

d (w, x, y, z) = Σ(0, 2, 5)

16. What is multiplexer,? Discuss implementation of 8-1 MUX


17. Discuss: Overlapping, Rolling, Redundancy in K-maps

18. Implement the function F = A(CD + B) + BC’ using AND-OR gates and NAND gates.

19. What is a Hardware description language? Explain its importance.

20. Write Verilog code for 1.Half subtractor


2.Full subtractor

Dept of CSE, RNSIT

You might also like