Professional Documents
Culture Documents
De (Unit-1) (Practice Sheet) Psitcoe
De (Unit-1) (Practice Sheet) Psitcoe
1 @ANKIT JAIN
@ANKIT JAIN
DIGITAL ELECTRONICS (UNIT-I) (KOE-039/KOE-049) @ANKIT JAIN
1.2 @ANKIT JAIN
DIGITAL ELECTRONICS
PRACTICE SHEET
4) Do the following :
a) Obtain the 1’s complement and 2’s complement forms of (10111000)2
b) Express the decimal numbers +25 and –25 in 8 bit sign magnitude, 1’s complement and 2’s
complement forms.
c) Given two binary numbers X=1010100 and Y=1000011, perform the subtraction using 1’s and 2’s
complements.
(i) X–Y (ii) Y–X
e) Solve by 9’s and 10’s complement
(i) (52532)10 – (3250)10
(ii) (3250)10 – (72532)10
(iii) (83)10 – (21)10
(iv) (52)10 – (89)10
f) Perform BCD addition
(i) (52532)10 – (3250)10
(ii) (3250)10 – (72532)10
(iii) (83)10 – (21)10
5) Write all Boolean postulates and Boolean theorems.
6) State and prove De Morgan’s theorem.
7) What do you mean by canonical forms?
8) Write short note on Minterms and Maxterms.
9) What is the difference between canonical form and standard form?
10) What is BCD? Where is it used? Give the advantages and disadvantages of BCD.
11) What are universal gates and why they are called universal gates prove it?
12) Implement AND, OR, NOT, NOR, EX-OR and EX-NOR using NAND gate only.
13) Implement AND, OR, NOT, NAND, EX-OR and EX-NOR using NOR gate only.
14) Draw the following gates and write the output expression with truth table:
a) AND gate
b) OR gate
c) NOT gate
d) Ex-OR gate
e) Ex-NOR gate
f) NAND gate
g) NOR gate
15) Implement using NAND gate only using NOR gate only
a) Y= AB + CD
b) Y=(AB +BC)C
c) Y=(ABC +BC)C
d) Y=(AB + C) D
e) Y=((AB) + (A + B))AB
f) Y=ABC + BCD + ABC
g) Y=A + AB + AB
20) Minimize the given Boolean function using k-Map and Implement the minimized function only
using NAND gates.
a) F(A, B, C, D)=∑m(3,4,5,7,9,13,14,15) + d(0,2,8)
b) F(A, B, C, D)=∑m(1,3,4,6,8,9,11,13,15) + d(0,2,14)
c) F(A, B, C, D)=∑m(0,1,3,4,9,11,14) + d(5,12,15)
21) Obtain a reduced expression for the following multiple output system, and realize the minimized
function using NOR gates only.
a) F1(A, B, C, D)=∑m(0,1,2,5,7,8,9,10,13,15)
b) F2(A, B, C, D)=∑m(0,1,2,8,10,11,14,15)
22) Simply the following Boolean expression using the Quine-McClusky method and verify it using
K-map.
a) F(A,B,C,D) = ∑m(0,1,3,7,8,9,11,15)
b) F(A,B,C,D) = ∑m(0,1,2,3,5,7,8,9,11,14)
c) F(A,B,C,D) = ∑m(1,5,6,12,13,14) + d(2,4)
d) F(A,B,C,D) = ∑m(0,1,4,6,8,9,10,12) + d(5,7,14)
e) F(A,B,C,D) = ∑m(2,4,8,11,15) + ∑m (1,10,12,13)
f) F(A,B,C,D) = ∑m(1,2,3,9,12,13,14) +∑ d(0,7,10)
g) F(W,X,Y,Z,P) = ∑m(13,15,17,18,19,20,21,23,25,27,29,31) +∑ d(1,2,12,24)
h) F(A,B,C,D,E) = ∑m(0,1,2,3,6,7,14,15,16,19,31)
i) F(x1, x2, x3, x4) = ∑m(0,5,7,8,9,10,11,14,15)
j) F(x1, x2, x3, x4,x5) = ∑m(0,1,2,8,9,15,17,21,24,25,27,31)
k) F(x1, x2, x3, x4,x5) = ∑m(0,2,4,5,6,7,8,10,14,17,18,21,29,31) +∑d(11,20,22)