Scribd
Upload
33 views

Assignment I DF

The document is an assignment for a digital fundamentals course. It contains 20 questions covering various topics in digital logic including number conversion between binary and hexadecimal, implementing logic gates using NAND gates, Boolean algebra, minimizing logic functions using Karnaugh maps, and coding systems. Students are asked to complete tasks like converting numbers between bases, proving theorems, minimizing logic functions, obtaining truth tables, and modeling real-world scenarios using logic expressions.

Uploaded by

Priyanshu
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
33 views

Assignment I DF

The document is an assignment for a digital fundamentals course. It contains 20 questions covering various topics in digital logic including number conversion between binary and hexadecimal, implementing logic gates using NAND gates, Boolean algebra, minimizing logic functions using Karnaugh maps, and coding systems. Students are asked to complete tasks like converting numbers between bases, proving theorems, minimizing logic functions, obtaining truth tables, and modeling real-world scenarios using logic expressions.

Uploaded by

Priyanshu
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Digital Fundamentals (102040303)

AY: 2022 -23 (Odd Semester)


ASSIGNMENT I

1. Convert the following numbers form given base to the base indicates.
a) (AEF2.B6)16 = (_______)2 b) (110110.1011)2 = (________)16
2. Implement NOT, AND, & OR gates using NAND gates only.
3. State & prove De Morgan’s theorems with the help of truth tables.
4. Using laws of Boolean algebra prove that AB + BC + A'C = AB + A'C.
5. Minimize the logic function X = A (B' + C') (A + D). Also realize the reduced function using NOR
gates only.
6. Converts the following nos.
a) (5C7)16 = ( )10 b) (11011.101)2 = ( )10
7. Simplify Using Boolean laws and draw the logic diagram for the simplified expression
F = (ABC)’ + (AB)’ C + A’BC’ + A (BC)’ + AB’C
8. Obtain the truth table of the function: F= xy + xyʹ + yʹz.
9. Show that (A + C) (A + D) (B + C) (B + D) = AB + CD
10. What are the different types of the codes used in digital systems? Explain them.
11. Reduce the expression F = ((AB)’+A’+AB)’
12. Show that A⊙ B = AB + A’B’ = (AB)’ = (AB’+A’B)’. Also construct the logic diagrams.
13. Minimize the following Boolean expressions.
a) X = ( (A'B'C')' + (A'B)' )'
b) Y = AB + ABC' + A'BC + A'BC'
14. Reduce the expression 𝐹 = ∑ m(0,2,3,4,5,6) using K-map and implement using NAND gates only.
15. Minimize following Boolean function using K-map & design the simplified function using logic
gates.
F = Σ m(1, 2, 4, 6, 7, 11, 15) + Σ d(0, 3)
16. 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)
17. Convert to minterms: A + B'C'
18. Convert to maxterms: A(A' + B)(C')
19. Reduce the following expression using K-map.
𝐹(𝐴, 𝐵, 𝐶, 𝐷) = ∏ 𝑀(1, 4, 5, 11, 12, 14) ∙ 𝑑(6, 7, 15)

20. A bank locker has three locks with different key for each lock. Each key is owned by a different person. In
order to open the door, at least two persons must insert their keys into the assigned locks. The signal lines
A, B, and C are 1 if there is a key inserted into lock 1, 2, or 3 respectively.
1. Prepare the truth table and write an equation for the variable Z which is 1 if and only if the door
should open.
2. Express the output Z as a minterm expansion.
3. Express the output Z as a maxterm expansion.

You might also like