1. Derive the complete truth table for the Function F[A.B,C,D] with N combinations and n variables; where N = 2 power n.

Y = [0,1,1,0,1,1,0,0,1,1,1,1,0,1,1,0]. Fill the Truth Table with the following columns:

I-(i) Terms with Literals

I-(ii) Input variable(s) and combinations.

I-(iii)Output variables and values as Min-terms i.e. I-(iv) & max-terms i.e. I-(v)

I-(iv) Min-terms (Terms with 1's at OutPut column),mi where i:0....(N-1);i.e. m0,m1,m2,.....,m(n-1)

I-(iv) Max-terms (Terms with 0's at OutPut column),mi where i:0....(N-1);i.e. M0,M1,M2,.....,M(n-1)

2.Developed the Logic Equations directly from the above obtained Truth Table in the following Forms:

2-(i) CSOP using Terms with Literals corresponding to Min Terms where output found "1" in Truth Table

2-(ii) SOP Minimizing CSOP using Boolean Axioms

2-(iii) CPOS using Terms with Literals corresponding to Min Terms where output found "0" in Truth Table

2-(iv) POS Minimizing CPOS using Boolean Axioms

Draw Logic Map (using MS-Visio) after obtaining Logic Equations via 2-(i),2-(ii),2-(iii),2-(iv) as:

3-(i) Un-minimized CSOP

3-(ii) Minimized SOP

3-(iii) Un-minimized CPOS

3-(iv) Minimized POS

4. Apply and practice to-and-fro i.e. vice-versa all the ways to determine the following transformations:

4-(i) After obtaining 1-(i) i.e. The Terms with Literals, and 1(iv) Min-Terms: Develop CSOP Equation, than SOP

4-(ii) After obtaining 1-(i) i.e. The Terms with Literals, and 1(v) Max-Terms: Develop CPOS Equation, than POS

4-(iii) After obtaining 3-(i) & 3-(ii) i.e. CSOP, and SOP, Draw Logic Map for both using MS-Visio

4-(iv) After obtaining 3-(iii) & 3-(iv) i.e. CPOS, and POS, Draw Logic Map for both using MS-Visio

4-(v) After obtaining 4-(iii) i.e. Logic Map of CSOP and SOP, Apply 1-(ii) i.e. input values to develop Truth Table

4-(vi) After obtaining 4-(iv) i.e. Logic Map of CPOS and POS, Apply 1-(ii) i.e. input values to develop Truth Table

5. Apply Karnaugh-Map simplification method on ?? = {0,1,1,0,1,1,0,0,1,1,1,1,0,1,1,0} to obtain SOP and verify the result of 3-(ii).

6. Use Logic-Friday Tool to verify each instance of above clauses - 1,2,3,4 and their sub-clauses, generated above.

7. Draw complete methodological semantic map of the above process to determine the concerned part.