1800 102 5661 info@sgtuniversity.org

Curriculum | B.Sc (Non- Medical) | Title- Programming in C and Numerical Methods (Code-09010403

Curriculum

Title- Programming in C and Numerical Methods (Code-09010403)

S.N Unit Content Learning objects Teaching Guidelines Methodology Time (Hrs)
1 one Programmer’s model of a computer, Algorithms,

Flow charts, Data types,

Operators and

expressions,

Input / outputs functions.

Students will be able to

 

1.  Programmer’s model of a computer, Algorithms, Flow charts, Data types,

Operators

2. Input / outputs functions.

     

Lecture should be effective so that student can grasp the topics easily.

 

1.  Lecture.

2.  Seminar.

3. Discussion/Interaction with Students.

4. Assignment.

5.  Discussion on Assignment.        

6. Evaluation of Assignment.

15
2 Two Decisions control structure:

Decision statements, Logical and conditional statements,

Implementation of Loops, Switch Statement & Case control structures.

Functions, Preprocessors and Arrays.

To make students familiar with Decisions control structure:

Decision statements, Logical and conditional statements,

Implementation of Loops, Switch Statement & Case control structures.

Functions, Preprocessors and Arrays.

 

 

Lecture should be effective so that student can grasp the topics easily.

 

1.     Lecture.

2.     Seminar.

3.    Discussion/Interaction with Students.

4.    Assignment.

5.    Discussion on Assignment.        

6.    Evaluation of Assignment

 

15
3 Three Strings: Character Data Type, Standard String handling Functions,

Arithmetic Operations on  Characters. Structures: Definition, using Structures, use of

 

Structures in Arrays and Arrays in

Structures. Pointers: Pointers Data type,

 

Pointers and Arrays, Pointers and Functions.

Solution of Algebraic and Transcendental equations: Bisection method,

Regula-Falsi method,

 

Secant method, Newton-Raphson’s method. Newton’s iterative method for finding pth root of a number,

Order of convergence of above methods.

 

Simultaneous linear algebraic equations: Gauss-elimination method, Gauss-    Jordanmethod,

 

Triangularization method (LU decomposition method). Crout’s method, Cholesky

 

Decomposition method. Iterative method, Jacobi’s method, Gauss-Seidal’s method, Relaxationmethod.

 

To make students familiar with

Strings: Character Data Type, Standard String handling Functions,

Arithmetic Operations on  Characters. Structures: Definition, using Structures, use of

 

Structures in Arrays and Arrays in

Structures. Pointers: Pointers Data type,

 

Pointers and Arrays, Pointers and Functions.

Solution of Algebraic and Transcendental equations: Bisection method,

Regula-Falsi method,

 

Secant method, Newton-Raphson’s method. Newton’s iterative method for finding pth root of a number,

Order of convergence of above methods.

 

Simultaneous linear algebraic equations:

Lecture should be effective sothat student can grasp the topics easily.

 

1.     Lecture.

2.    Seminar.

3.    Discussion/Interaction with Students.

4.    Assignment.

5.    Discussion on Assignment.       

6.    Evaluation of Assignment

15