Course

Practical Component: (15 hours)Application of programming to numerical and non numerical algorithms:(i) Factorial, sin(x), cos(x), log(x), tan(x)(ii) Estimation of determinant of a square matrix, inverse of asquare matrix(iii) Solution of simultaneous equations using Krammers rule(iv) Method of least squares(v) Newton-Raphston method of the solution of equations(vi) Towers of Hanoi, binary search, tic tac toe.

Unit I

Numerical methods: Solutions of equations using numerical methods – Newton Raphstons method, linear algebra and matrix manipulations including Gauss Jordan and Gauss Sidel, numerical solution of differential equations.

Unit II

Non numerical algorithms: Notion of algorithms, step wise methodology of developing an algorithm, Towers of Hanoi, binary search, tic tac toe, backtracking, sort and search.

Unit III

Introduction to Computers: Characteristics of Computers, Uses of computers, Types and generations of Computers Basic Computer Organization – Units of a computer, CPU, ALU, memory hierarchy, registers, I/O devices User Interface with the Operating System, System Tools.

Unit IV

Principles of programming: Programming in C – constants, variables, logical variables, loops: for loop and while loop, arrays, pointers, structures, recursion.

Unit V

Introduction to Stochastic programming: Random number generators. Application of Monte Carlo methods in Chemistry.

OBJECTIVES: To develop fundamental understanding of numerical techniques for problem solving in physical sciences and implementation of these techniques as algorithms and computer programs.

Course Outcome:

CO – PO mapping

REFERENCES:1) B.W. Kernigan, D.M. Ritchie, The C Programming Language (ANSI C), 2nd Edn., Prentice Hall, 1988.2) E. Kreyszig, Advanced Engineering Mathematics, 10 th Edn., John Wiley and Sons, 2011.3) V. Rajaraman, Fundamentals of Computers, Fourth Edition, PHI.