1.

Pranveer Singh Institute of Technology, Kanpur

UNIT-1
Practice Sheet
Digital Electronics
(KOE-039/KOE-049)

DIGITAL SYSTEMS, CODE

CONVERSION, LOGIC GATES &
K-MAP, TABULAR METHOD

DIGITAL ELECTRONICS (UNIT-I) (KOE-039/KOE-049)

1.2

DIGITAL ELECTRONICS
PRACTICE SHEET

1) Do the following conversions:

a) (125608)10= ( )2
b) (1356.25)10= ( )H
c) (11011.011)2= ( )10
d) (7043.06)8= ( )10
e) (7A0B.01F)16= ( )10
f) (10111.01)2= ( )H
g) (1101110.001)2= ( )H
h) (3215.06)10= ( )6
i) (327.04)8= ( )H
j) (1CD.2A)H=( )10=( )2
k) (749.25)10=( )2=( )8=( )H
l) (101.01)2=( )10
m) (10101.0101)2=( )10
n) (62.7)8=( )H
o) (10.10001)2=( )8
p) (0.342)6=( )10
q) (101010.10)4=( )8
r) (23.AB)H=( )8
s) (111011)2 to gray code
t) (101010.10)4=( )8
u) (3451)10=( )2
v) (1745.246)8=( )H
w) (7894.125)10=( )8
x) (5413.237)8=( )16
y) (BC64)H=( )10
z) (2CCD)16=( )5
aa) (7841)9=( )10
bb) (4021.25)10=( )2
cc) (11011.011)10=( )16
dd)(2AC9)16=( )7
ee) (1010.101)10=( )2=( )4
ff) (C3A.47)H=( )8=( )2
gg) (6089.25)10=( )8
hh)(A6B.F5)16=( )2
ii) (375.37)8=( )2

2) Do the following additions:

a) (1011011)2 + (10001.001)2
b) (7571)8 + (4176)8
c) (4F3A)H + (23C1)H
d) (93)H + (DE)H
e) (ABCD)H+(EF12)H
f) (1704.34)8 + (47706.12)8
g) (1A0F11.06)H + (FFB0D.00A)H
h) (23.53)10 + (23.53)10
i) (125.04)6 + (1003.02)6
j) (A4F.EF)16 + (3FD.AB)16

DIGITAL ELECTRONICS (UNIT-I) (KOE-039/KOE-049)

1.3

3) Do the following subtractions:

a) (11000.001)2 – (10111.111)2
b) (1001.11)2 – (1111.01)2
c) (7571)8 –(4176)8
d) (71064.04)8 – (67704.77)8
e) (6488.43)9 – (3837.78)9
f) (FA12.35)16 – (9BCD.EF)16
g) (F0AF67.08)H – (1AF019.89)H
h) (4F3A)H – (23C1)H
i) (7001)8 – (5763)8

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
d) 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
e) 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
DIGITAL ELECTRONICS (UNIT-I) (KOE-039/KOE-049)
1.4

16) Simplify the following Boolean expression and implement it using gates:
a) ABCD + ABCD
b) Y= ((AB) + A + AB)
c) Y=ABC + ABC + ABC
d) Y= (A + BC)(C + AB)
e) Y =(AB + C)(AB +D)

17) Prove the following functions:

a) A + AB= A
b) A + AB= A + B
c) (A + B)(A + C)= A + BC
d) (A + B +AB)(A + B)( AB)=0
e) A +AB + AB= A + B
f) AB + AB +AB +AB=1
g) AB + ABC +AB= A

18) Represent following into the standard SOP:

a) F(A, B, C, D)=ABC + AB + AC
b) Y=AB + AC + BC
c) Y=A + BC + ABC
d) Y=AB + AC +BC
e) F(W, X, Y, Z)= XY + YZ + WX

19) Represent following into the standard POS:

a) F(A, B, C, D)= (A+B).(C+D).(A+D)
b) Y=(A + B)(A + C)(B + C)
c) Y=(A + B)( B + C)
d) F(A, B, C, D)= (A+B+C+D).(A+C+D).( A+D)
20) Solve the following using K-map:
a) Y= ABC + ABC +ABC + ABC
b) Y=ABCD + ABCD + ABC + ABD + AC + B
c) Y=∑m(1,3,5,9,11,13) minimize it and realize it using the basic gates also solve for POS form.
d) Y=∑m(0,2,5,6,7,8,10,13,15) minimize it and realize it using the basic gates also solve for POS
form.
e) F(W, X, Y, Z) = ∑(0,1,2,4,5,6,8,9,12,13,14)
f) F(A,B,C,D) = ∑(0,6,9,10,13) + d (1,3,8)
g) F(A,B,C,D) = ∑(0,1,2,4,5,6,9) + Φ (10,11,12,13,14,15)
h) F(A,B,C,D) = π(0,4,5,6,7,13,14,15)
i) Y= ∑m(1,3,7,11,15) + d (0,2,5)
j) Y= 𝑴 (0,2,3,7)
k) Y= 𝑴 (0,2,3,5,7)
l) F(A,B,C,D) = π(0,1,2,4,5,6,9) + d (10,11,12,13,14,15)
m) F= ABD + ACD +ABC
d= ABCD +ACD +ABD
n) F(A,B,C,D)=ABC + BCD + ACD + AB + A , also find the POS Canonical form of the given
function.
o) F(A, B, C)= abc + bc + abc + abc
p) X= ABC + ACD + AB
q) F(A, B, C, D)= ∑m(0,1,2,3,5,7,8,9,11,14)
DIGITAL ELECTRONICS (UNIT-I) (KOE-039/KOE-049)
1.5

r) F(A, B, C, D)= 𝑴 (0,1,2,5,8,9,10)

s) F(A, B, C, D)=∑m(0,1,2,11,12,14,15) + d(3,5,6,13)
t) F(x, y, z, w)= 𝑴 (0,2,5,7,8,10,13,15)
u) F(A, B, C, D)= ∑m(0,2,3,5,7,12,15) + ∑d(1,4,8,11)
v) F(A, B, C, D)= ∑m(1,2,5,7,9,15) + ∑d(0,3,4,6)
w) F(A, B, C, D)= 𝑴 (0,1,3,6,7,8,9,11,13,14,15)
x) F(a, b, c, d)=∑m(0,1,3,4,7,9,10,14,15)

21) Solve the following using K-map (5 variable):

a) F (A, B, C, D, E) = ∑m(0,2,5,7,8,10,16,21,23,24,27,31)
b) 𝒇 𝐀, 𝐁, 𝐂, 𝐃, 𝐄 = 𝐦 𝟎, 𝟐, 𝟒, 𝟔, 𝟗, 𝟏𝟏, 𝟏𝟑, 𝟏𝟓, 𝟏𝟕, 𝟐𝟏, 𝟐𝟓, 𝟐𝟕, 𝟐𝟗, 𝟑𝟏
c) 𝒇 𝐀, 𝐁, 𝐂, 𝐃, 𝐄 = 𝐦 𝟎, 𝟏, 𝟕, 𝟗, 𝟏𝟏, 𝟏𝟑, 𝟏𝟓, 𝟏𝟔, 𝟏𝟕, 𝟐𝟑, 𝟐𝟓, 𝟐𝟕
d) 𝒇 𝐀, 𝐁, 𝐂, 𝐃, 𝐄 = 𝐦 𝟎, 𝟐, 𝟓, 𝟕, 𝟏𝟑, 𝟏𝟓, 𝟏𝟖, 𝟐𝟎, 𝟐𝟏, 𝟐𝟑, 𝟐𝟖, 𝟐𝟗, 𝟑𝟏
e) 𝒇 𝐀, 𝐁, 𝐂, 𝐃, 𝐄 = 𝐦 𝟎, 𝟏, 𝟐, 𝟑, 𝟏𝟎, 𝟏𝟐, 𝟏𝟑, 𝟏𝟒, 𝟐𝟎, 𝟐𝟏, 𝟐𝟐, 𝟐𝟑, 𝟐𝟔, 𝟐𝟕, 𝟐𝟖, 𝟐𝟗, 𝟑𝟎, 𝟑𝟏
f) 𝒇 𝐱, 𝐲, 𝐳, 𝐰, 𝐩 = 𝐦 𝟏𝟑, 𝟏𝟓, 𝟏𝟕, 𝟏𝟖, 𝟏𝟗, 𝟐𝟎, 𝟐𝟏, 𝟐𝟑, 𝟐𝟓, 𝟐𝟕, 𝟐𝟗, 𝟑𝟏 + 𝐝 𝟏, 𝟐, 𝟏𝟐, 𝟐𝟒
g) 𝑓 x, y, z, w, 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) = 𝑴 (0,1,2,5,8,9,10)
i) F (A, B, C, D, E) = ∑m(0,2,4,6,9,13,21,23,25,29,31)

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)

DIGITAL ELECTRONICS (UNIT-I) (KOE-039/KOE-049)