:: Home : CV : Teaching : Research : Publications : Presentations : Leisure ::

- Lecture 01. [Computer Basics]
- Lecture 02. [Sorting & Least Squares]
- Lecture 03. [Numerical Mathematics]
- Lecture 04. [Newton-Cotes Quadrature]

- Code 01: Hello World.
- Code 02: Area and Volume.
- Code 03: Roots of Quadratic equation.
- Code 04: Factorial and Series Sum.
- Code 05: Bubble Sorting.
- Code 06: Mean, Median and Mode.
- Code 07: A.P. and G.P. Series.
- Code 08: Matrix Addition and
- Code (Miscellaneous): Fermat Primes.
- Code (Miscellaneous): Gamma(30.5).
- Code (Miscellaneous): Miscelleneous Series.
- Code 09: Factor and Prime Factor.
- Code 10: Prime Numbers Within Given Range.
- Code 11: Equal distributed Prime Numbers.
- Code 12: Roots Using Bisection Method.
- Code 13: Newton Raphson Method.
- Code 14: Least Square Fit - Straight line, Exponential.
- Code 15: Lagrange Interpolation Method. & Runge Phenomena.
- Code 16: Trapezoidal Method of Integration.
- Code 17: Simpson's 1/3rd Rule of Integration.
- Code 18: Gauss-Siedel Iterative Method.

- C programming language - Kerninghan and Ritchie.
- Computer Oriented Numerical Methods - V. Rajaraman.
- Computational Physics - D.Walker.

- Language: Constants and variables. Assignment and arithmetic expressions. Logical expressions and control statements, loops, array, input and output statements (with I, F and E formats), function subprogram, subroutine.
- Numerical analysis: Computer arithmetic and errors in floating point representation of numbers, different
numerical methods for the following problems: (Group-A)
- Sorting: arranging in ascending/descending order.
- Read N numbers ,find their mean, median, mode.
- Find whether a number is prime, factorize a number.
- Solution of a quadratic equation with real / complex roots.
- Sum of different types of series term by term with a specified accuracy.
- Simple matrix operations (addition, subtraction, multiplication, transpose).

- Solution of simultaneous linear equations by Gauss-Siedel method.
- Least square fit of a given set of data to a straight line, application to exponential
( y=ae
^{x}) and power ( y=ax^{b}) laws. - Finding zeroes of a given function by the method of bisection and Newton-Raphson.
- Interpolation by Lagrange's method.
- Integration by trapezoidal and Simpson's rule.

- Question Set for a few years.
- Download DevC++ from here.
- You can make an infinite loop with for(;;) or while(1) loop.
- If given Linux (OS), then you have to manually compile and execute the codes. (a) compile : "gcc program.c -lm -o wxyz"
[gcc is the compiler that will compile program.c, by linking math library (-lm), to produce an executable of your choice
"wxyz"], (b) execute : ./wxyz.
- If you skip "-o wxyz" part, then default executable generated after compilation will be "a.out". Then you have to do ./a.out for execution.

- (Outside the course) If you seek next level of computing: Try solving Diffusion Process.