DIGITAL ASSIGNMENT 1

(Last date for submission:12.09.2021)

1. Simplify the following expression using 4 variable map

F(A,B,C,D)= ∑(1,5,9,10,11,14,15)

2. Simplify the following Boolean expression using four variable maps

X’Z+W’XY’+W(X’Y+XY’)

3. Simplify the following Boolean expression using four variable maps

AB’C+B’C’D’+BCD+ACD’+A’B’C+A’BC’D

4. Simplify the following Boolean function to Product of Sums

F(w,x,y,z)= ∑(0,1,2,5,8,10,13)

5. Simplify the Following Boolean function to Sum of Products

F(a,b,c,d)= π(1,3,6,9,11,12,14)

6. Simplify the following Boolean expressions F together with the don’t care
condition d and then express the simplified function in sum of minterms form

F(w,x,y,z)=∑(0,6,8,13,14)

d(w,x,y,z)= ∑(2,4,10)

7. Using a decoder and external gates design the combinational circuit defined
by the following Boolean functions

F1=(y’+x)z

8. Using a decoder and external gates design the combinational circuit defined
by the following Boolean functions

F2=y’z’+xy’+yz’

9. Using a decoder and external gates design the combinational circuit defined
by the following Boolean functions

F3=(x’+y)z

10. Implement the following function using a multiplexer

F(A,B,C,D)=∑(0,2,5,7,11,14)