1800 102 5661

#### Subject Code: 09020302

 S.No. Topic Learning Objectives(At the end of the session, the student should be able to) Teaching Guidelines Methodology Time 1. Programming in C: 1. Constants, variables & data types. 2. Data Input & data output 3. Control Structures 4. If, switch, while, do while, for & Go statements 5. Functions & pointers 6. Arrays & array of structures 7 Union and File operations 8. Examples of writing C- programming of computational methods. 1. Explain C programming, its syntax, functions, statements, structures and file operation. 2. Write C – Programme of computational methods. To cover: Constants, variables and data types, Data input and out put-control structures, If and switch statements, While, do while statements, For statements, Go To statements ,Functions, Arrays, pointer and structures, Array of structures, union,  File operations, Examples of writing C programming 1.White board teaching 2.Power point presentation 3.Classroom discussion 4.Computational Lab. 10 hrs 2. Roots of Equations; 1.Limits for real roots of a polynomial equations 2. Bisection method 3. False position method 4. Newton Raphson method 5. Numerical based on Bisection, False position & Newton Raphson method Discuss Bisection method, False position method and Newton Raphson method for finding roots of Equations. To cover; Roots of quadratic equations, Limits for real roots of a polynomial equations, Bisection Method, Algorithm of Bisection method, C programming of roots of Equations using Bisection method, False position method, Algorithm of False position method, C programming of finding roots of Equations using False Position method, Newton Raphson method for finding roots of the equations, C programming of finding roots of Equations using Newton Raphson  method. 1.White board teaching 2.Power point presentation 3.Video related to subject  for better understanding of concept 5.Problem Solving approach 6.Classroom discussion 10 hrs 3. Linear Algebra: 1. Eigen values and Eigen vectors of a matrix 2. Inverse of a matrix, Determinant 3. Solution of linear systems of equations by Gauss Elimination method 4. Pivotal condensation method 5. Numerical Problems based on Eigen values & Eigen vectors of matrix & Gauss elimination method To learn about gauss Elimination method and Pivotal condensation to solve Linear Systems of Equations. To cover: Eigen values and Eigen vectors of a matrix, Inverse of a matrix, Determinant, Solution of linear systems of equations, Gauss elimination Method, Algorithm, C programming using Gauss Elimination method, Pivotal condensation method, C- programming using Pivotal condensation, Numerical Problems 1.White board teaching 2.Power point presentation 3.Problem solving approach 4.Classroom discussion 10hrs IV Integration and differentiation: 1. Trapezoidal rule 2. Simpson Rule (one – third) 3. Solution of Ordinary Differential Equations by Euler Method 4. Runge Kutta method. 5. Numerical Problems based on Trapezoidal rule, Simpson rule, Euler & Runge Kutta method To learn about computational methods for integration and differentiation & their application in solving problems in physics such as Ideal harmonic Oscillator. To cover: Trapezoidal rule, Algorithm & C programming using Trapezoidal rule, Simpson rule (one-third), Algorithm (Simpson rule), C programming using Simpson rule, Solution of Ordinary Differential equations by Euler Method, Algorithm & C programming using Euler method, Runge Kutta methods, Algorithm & C programming using Runge Kutta method, Physical Examples- Ideal Harmonic Oscillations. 1.White board teaching 2.Power point presentation 3.Numerical problem solving approach 4.Classroom discussion 6 Computational Lab. 10hrs