Home › Third Year Semester II

Computing Algorithms and Applications Laboratory

IE 317 Computing Algorithms and Applications Laboratory

Teaching scheme:                                                                            Examination scheme:

Practical: 2 Hrs/week                                                                       Oral exams: 50 Marks

 

List of experiments
1 Implementation of Newton Raphson methods, 2.6 Ramanujan’s method, muller’s method, Quotient difference methods
2 Implementation Newton’s methods for interpolation, central difference interpolation methods, Interpolation with Cubic Splines
3 Implementation of Least-Squares Curve Fitting Procedures Weighted Least Squares Approximation, Method of Least Squares for Continuous Functions
4 Implementation of Euler-Maclaurin Formula, Adaptive Quadrature Methods Gaussian Integration, Numerical Calculation of Fourier Integrals, Numerical Double Integration
5 Implementation of Taylor's Series, Picard's Method of Successive Approximations
6 Implementation of Euler's Method, Runge-Kutta Methods
7 Implementation of Finite-Difference Approximations to Derivatives
8 Implementation of Chebyshev Series Method Method Using Generalized Quadrature