Scribd
Upload
3 views

Tutorial(Digital logic)

Uploaded by

dipendra.077bel003
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
3 views

Tutorial(Digital logic)

Uploaded by

dipendra.077bel003
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Tutorial: 2

1. Perform the following code conversions:


a) (1110)gray = (?)BCD
b) (1430)10 = (?)Excess-3
c) (37.432)10 = (?)2
d) (10.0101)2 = (?)H
e) (101001001)2 = (?)gray
f) (93)10 = (?)x3
g) (10.001)2 – (11.101)2 using 2’s complement method.
h) Subtract (16)10 from (14)10 using 2’s complement method.
i) Perform the following addition using 2’s complement -5 + 12
j) (11110)2 – (1001)2 using 2’s complement method.
k) (100010)2 – (10011)2 using 2’s complement method.
2. Prove that positive NOR is equivalent to negative NAND.
3. Prove that negative XNOR is equivalent to Positive XOR.
4. State and prove that De-Morgan’s theorem with necessary diagrams.
5. What are the major difference between binary code and BCD code?
6. Describe commutative, Associative, distributive and duality laws of Boolean algebra with examples.
7. Implement XOR gate by using minimum number of2-input NAND gates only.
8. Define the digital operation with examples.
9. Implement the following Boolean function using NAND gate .
a) F = ABC’ + ABC + A’BC
b) F = AB + CDE + F
c) F = AB + C’ (D +E)
d) F = (A + B) (C + D) E using NOR gate only.
e) F = (A’ + B + C) (A + B) D using NOR gate only.
f) F’ = X’Y + XY’ + Z using NOR gate only

Tutorial: 3
1. What do you mean by min term and Max term with examples?
2. Simplify A + A’B = A + B
3. Convert the following term into standard min term and Max term. A + B’C
4. Prove that:
a) ABC + A’B’C +A’BC + ABC’ +A’B’C’ = A’B’ + B (A + C)
b) BC +AC’ +AB + ABD = BC +AC’
c) [(CD)’ + A]’ + A + CD + AB = A + CD
d) (A + C +D) (A + C + D’) (A + C’ +D) (A + B’) = A + B’CD
5. Convert the following to the standard form:
a) F(x,y,z) = ∑(1,3,7)
b) F (A,B,C,D) = ∑(0,2,6,11,13,14)
c) F(x,y,z) = π(0,3,6,7)
d) F(a,b,c,d) = π(0,1,2,3,4,6,12)
6. Simplify the Boolean function using k-map and draw the logic circuit of the simplified Boolean
expression using NAND gates only. Also convert the result into standard min term:
a) X’YZ + X’YZ’ + XY’Z’ + XY’Z
b) X’YZ + XY’Z’ + XYZ + XYZ’
c) A’C + A’B + AB’C + BC
d) F = ∑(0,2,5,6)
e) F = ∑(0,1,2,4,5,6,8,9,12,13,14)
f) F = A’B’C’ + B’CD’ + A’BCD’ + AB’C’
g) F = ∑(1,3,7,11,15) + D(0,2,5)
h) F = ∑(0,4,8,10,11,12) +D(2,3,6,9,15)
7. Design a combinational logic circuit whose input is 4-bit number and the output is the 2’s
complement of the input number.
8. Design a combinational logic circuit that convert BCD code into Excess-3 code and vice versa.
9. Design a combinational logic circuit that convert 4- bit binary number into 4-bit gray code and vice
versa.
10. Design a combinational logic circuit whose output is high when the sum of the 4-bit input number
is greater than 9.
11. Design a combinational logic circuit with 3 input variables that will produce logic high output when
more than one input variables are logic low.
12. Design a 3-bit magnitude comparator with truth table.
13. Design a 3-bit even parity generator and 4-bit even parity checker circuit.
14. Implement a full adder circuit using 4:1 multiplexer.
15. Design a combinational circuit that accepts a 3-bit input and generates an output binary number
equal to square of the input number.

You might also like