ASSIGNMENT:-3

K-map:-

1. simplify the following boolean function into

a) sum of product form and
b)product of sum form.:
F(A,B,C,D)=∑(0,1,2,5,8,9,10)

2. simplify the following boolean function into

a) sum of product form and
b)product of sum form.:
F(A,B,C,D)=∑(0,1,2,5,8,9,10)

3.simplify the boolean function

F(w,x,y,z)=∑(1,3,7,11,15)
which has the don’t care condition.
d(w,x,y,z)=∑(0,2,5)

4.impliment the following boolean function with NAND gate:

F(x,y,z)=(1,2,3,4,5,7)

PROBLEMS:-

3.1 simplify the following boolean function using three variable maps:
F(x,y,z)=∑(0,2,4,5,6)

3.2 simplify the following boolean function using three variable maps:
a) F(x,y,z)=∑(0,1,5,7)
b) F(x,y,z)=∑(1,2,3,6,7)

3.3 simplify the following boolean function using three variable maps:
a) xy+x’y’z’+x’yz’
b) x’y’+yz+x’yz’

3.4 simplify the following boolean function using karnaugh maps:

a) F(x,y,z)=∑(2,3,6,7)
b) F(A,B,C,D)=∑(3,7,11,13,14,15)
c) F(w,x,y,z)=∑(2,3,12,13,14,15)
3.5 simplify the following boolean function using four variable maps:
F(w,x,y,z)=∑(1,4,5,6,12,14,15)

3.6 simplify the following boolean function using four variable maps:
a) A’B’C’D’+AC’D’+B’CD’+A’BCD+BC’D
b) x’z+w’xy’+w(x’y+xy’)

3.7 simplify the following boolean function using four variable maps:
 a) w’z+xz+x’y+wx’z
b) AB’C+B’C’D’+BCD+ACD’+A’B’C+A’BC’D

3.8 find the minterms of the following boolean expression by first plotting each function in a map
a) xy+yz+xy’z
b) C’D+ABC’+ABD’+A’B’D

3.12 simplify the following boolean function:

F(A,B,C,D)=∏(1,3,5,7,13,15)

3.13 simplify the following expression to (1)sum of product and (2) product of sum
a) x’z’+y’z’+yz’+xy
b) (A’+B+D’)(A’+B’+C’)(A’+B’+C)(B’+C+D’)

3.15 simplify the following boolean function F, together with the don’t care condition d,and then
express the simplified function in sum of minterms form
F(A,B,C,D)=∑(0,6,8,13,14)
d(A,B,C,D)=∑(2,4,10)

3.16 simplify the following function ,and implement them with two-level NAND gate circuits
a) F(A,B,C,D)=A’B’C’D+CD+AC’D
b) F(A,B,C)=(A’+C’+D’)(A’+C’)(C’+D’)
3.17 reduce the following expression using three variable map:
a) ABE’C’+ABCD’+ABCE’+AB’CD’+A’BC
b) m1+Dm2+m3+D’m5+m7+d(m0+Dm6)
c) Em2+m3+m4+Dm5+D’m7+d(m0+Em1+E’m6)

3.18:- Design a combinational circuit with three input x,y,and z, and three outputs A,B and C. when
the binary inputs is 0,1,2 or 3, the binary output is one greater than the input. when the binary
input is 4,5,6 or 7, the binary output is two less than the input.

3.19 A majority circuit is a combinational circuit whose output is equal to one if the input variable
have more 1’s than 0’s . the output is 0 otherwise
a) Design a three input majority circuits by finding the circuit’s truth table, boolean equation, and a
logic diagram.

3.20 Design a combinational circuit that convert a 4-bit gray code to a 4-bit binary number
a) Implement the circuit with exclusive-OR gates.

3.21 design a code converter that convert a decimal digit from the 8,4,-2,-1 code to BCD.

GTU questions:
Q.1

a) Express the boolean function F=A+B’C in a sum of minterms.

b) Reduce the expression F=A[B+C’(AB+AC’)’]
c) simplify the following boolean function by using the tabulation method
F(A,B,C,D)=∑m(0,1,2,8,10,11,14,15)

Q.2
a) simplified the boolean function F(w,x.y,z)=∑m(0,1,2,4,5,6,8,9,12,13,14)
b) Design 1-bit magnitude comparator
c) Design a full adder and realize full adder using 3*8 decoder and 2 OR gates.
d) Simplify the boolean function F=A’B’C’+B’CD’+A’BCD’+AB’C’
e) Explain 4-bit parallel adder.
f)implement the following function using 8*1 MAX: F(A,B,C,D)=∑m(0,1,3,4,8,9,15)
Q:-3
a) minimize following boolean function using k-map: X(A,B,C,D)=∑m(0,1,2,3,5,7,8,9,11,15)
b) 1:convert Y=AB+AC’+BC into canonical SOP form.
2:convert Z=(A+B)(A+C)(B+C’) into canonical POS form.
c)write a brief note on BCD-to-7-segement decoder or driver.set up a single 7-segement LED
display using 7447 BCD-to-7-segement decoder or driver.
d)write a brief note on full subtractor with the help of it’s TT. Also design full subtractor logic
circuit using 3X8 decoder and OR gates. Use X,Y and Z as input variables and D & B as output
variables.

Q:-4
a) Draw the logic diagram of 1-digit BCD adder.
b) minimize following boolean function using k-map:Y(A,B,C,D)=∑m(0,1,2,3,5,7,8,9,11,14)

Q:-5
a) Explain priority encoder
b) Explain Demultiplexer.
c) Design an adder and subtractor together.