Periods/week : 3 Periods & 1 Tut /week.                                                                                                                        Ses. : 30 Exam : 70

Examination (Practical): 3hrs.                                                                                                                                           Credits: 4

Objectives
To make the student familiar with programming in C and enable the student to implement the numerical methods described in this course using C as programming language.
Section A
Computer programming in C
Basics 
Variables – Constants – Expressions – Operators and their precedence and associativity.
Basic input and output statements, Control structures, Simple programs in C using all the operators and control structure.
Functions
Concept of a function – Parameters and how they are passed – Automatic Variables – Recursion – Scope and extent of variables, Writing programs using recursive and non-recursive functions.

Arrays and Strings 
Single and multidimensional arrays – Character array as a string – Functions on strings, Writing C programs using arrays and for string manipulation.

Structures 
Declaring and using structures – Operations on structures – Arrays of structures – User defined data types – Pointers to using files.

Files 
Introduction – File structure – File handing functions – File types – File error handing – C Programming examples for using files.

 

Section B
Computer oriented numerical methods

1. Basic Concepts 
Preliminary concepts of algorithms – Flow charts and their execution traces – A simplified model of a computer.

2. Representation for Characters and Numbers 
Representation for integer and real numbers, Effect of finite representation on arithmetic operations for example overflow, underflow, associativity and normalization, Some elementary methods for overcoming these limitations.

3. Numerical Methods
Notation of round-off and truncation errors, numerical methods of finding roots of an algebraic equation of one variable, Successive bisection method, False position method, Newton Raphson method and secant method.

4. Solutions of Simultaneous Algebraic Equations
Gauss elimination method and Gauss Seidal methods.
5. Interpolation 
Lagrange’s Interpolation and difference table methods.
6. Numerical Integration
Simpson’s Rule, Gaussian quadrature for formula.

7. Numerical Solution of Differential Equation
Eular’s method, Taylor’s series method and runge-Kutta method.

Books 
Section A : Programming with C by K.R. Venugopal & Sudeep R Prasad
Section B : Introduction to Numerical Methods by S.S. Sastry
Elementary Numerical Methods by S.D.  Conte

Rerencence 
C Programming Language by Kerningham & Ritchie

tejus mahiFirst Year SyllabusCPNM Syllabus
Periods/week : 3 Periods & 1 Tut /week.                                                                                  ...