Detailed Syllabus Mapping of COs with PSOs and POs:
Page 47 of 241 Module Unit Content Hrs (48+12) Marks I Numerical Analysis I 10 15 1 Errors in numerical calculations - Sources of errors 1 2 Solution of Algebraic and Transcendental Equations - Bisection method 3 3 Method of false position 3 4 Newton Raphson method 3 II Numerical Analysis II 12 15 5 Polynomial Interpolation - Lagrange interpolation 3 6 Newton’s forward and backward difference interpolation 3 7 Numerical Solution of Definite Integral - Simpson’s 1/3rd rule 2 8 Simpson’s 3/8 Rule 2 9 Trapezoidal method 2 III Operations Research I 13 20 10 Introduction to Operations Research – Definition, Advantages and Limitations of Operations Research 1 11 Linear Programming Problem – Definition, Formulation of LPP, Feasible solution and Optimal solution 2 12 Dual of LPP 2 13 Graphical solution of LPP 2 14 Simplex Method 3 15 Big-M method 3 IV Operations Research II 13 20 16 Transportation Problem – Definition, Balanced and unbalanced Transportation problems 1 17 Finding basic feasible solutions – Northwest corner method 2 18 Least cost method 1 19 Vogel’s approximation method 2 20 Optimized (MODI) method 3 21 Assignment model - Definition, Balanced and unbalanced Assignment problems 1 22 Hungarian method for optimal solution 3 V Open Ended Module – Other Numerical Methods 12 1 • Any other two methods to solve Algebraic and Transcendental Equations • Any other two methods for Polynomial Interpolation • Any other two methods to solve Solution of Definite Integral • Any other method to solve LPP 12 PSO1 PSO2 PSO3 PSO4 PSO5 PSO6 PO1 PO2 PO3 PO4 PO5 PO6 CO 1 2 - 1 - 3 - CO 2 1 - 1 - 3 -