1. Simplify the Boolean function using k-map and implement the function F using NOR /NAND logic.

(i) F (A,B,C,D) = ∑(0,1,4,5,6,7,11,12,15)

(ii) F(x,y,z) = ∑ (0,1,2,3,4,5,)

2. (a) Convert the following binary number into its decimal equivalent.
(i) 1001111.100110
(ii) 1100001.1110101
(iii) 111000.011
(b) Convert the following decimal number into its binary number equivalent.
(i) 654.789
(ii) 74.85
(iii) 568.345

(C). Convert the following hexa decimal value into its binary number equivalent.
(i) (E9A7)16
(ii) (FCB2)16

3. Simplify the expression using Boolean law and Demorgan’s theorem and verify the answer using ‘k’
map.
(i) AB+(AC)’+AB’C(AB+C)
(ii) ((AB)’+A’+AB)’
4. From the answer of the question number 3, derive the truth table.