CPNM

2019-20
Odd Semester
 FET Academic Calendar – UG Engg. 1st
Semester
• Session Start : 20.08.2019
• Induction Training Programme : 20.08.2019 - 02.09.2019

• Regular Class Start : 03.09.2019

• Puja Vacation : 03.10.2019 - 15.10.2019

• Diwali Break : 28.10.19 to 30.10.19

• 1st Class Test Week : 31.10.19 to 06.11.19

• 2nd Class Test Week : 16.12.19 to 21.12.19

• Sessional Dissolve : 16.12.19

• Theoretical Dissolve : 21.12.19

• Semester Exams. : 02.01.20 to 14.01.20

 CPNM Module A (ES/CM/TP104A)
• Introduction: History of Computing, Evolution of Programming Languages,
Compilers, Interpreter, Algorithms and Flowcharts, Structure of a C
Program [2L]
• Expressions : Basic Data Types, Variables, Type Qualifiers, Variable Scopes,
Constants, Assignment Statements, Operators, Operator Precedence,
Expression Evaluation, Type Conversion in Expressions, Type Casting [2L]
• Console I/O: Reading and Writing different data types [1L]
• Control Statements: Selection Statements (if, switch-case), Loop
Statements (for, while, do-while), Jump Statements (return, go to, break,
exit, continue) [6L]
• Arrays and Strings: Single Dimension Arrays, Double Dimension Arrays,
Strings [4L]
• Functions: General Form, Function Prototypes, Introduction to Pointer
variables, Parameter Passing Mechanisms, Command Line Arguments [4L]
• Structures, Unions: Structures, Arrays of Structures, Unions [2L]
• File I/O: Introduction to File, File reading and writing [4L]
 CPNM Module A (ES/CM/TP104A)
• Approximations and Errors associated with numerical methods. [1L]
• Solution of non-linear equations: Bisection method, method of false
position, Newton-Raphson method. [3L]
• Solution of linear simultaneous equations:
– Direct methods: Gauss-Jordan elimination, matrix inversion using Gauss-
Jordan elimination [3L]
– Iterative methods: Jacobi’s method [1L]
• Methods for interpolation: Newton’s forward difference formula,
Newton’s backward difference formula, Lagrange’s formula. [3L]
• Curve fitting: Method of least squared error [2L]
• Methods for differentiation and Integration: Computation of derivatives
using Newton’s forward/backward difference formulae. Trapezoidal
method, Simpson’s method. [3L]
• Solution of differential equations: Euler’s method, modified Euler’s
method, Runge-Kutta 2nd and 4th order formulae [4L]
• Solution of partial differential equations [3L]
 Books
• C Programming
– The C Programming Language, by Brian W. Kernighan and Dennis M. Ritchie,
Second Edition, Pearson
– C: The Complete Reference by Herbert Schildt, Fourth Edition, 2017, McGraw
Hill Education
– Programming With C by Byron Gottfried, Fourth Edition, 2018, McGraw Hill
Education
– Programming in ANSI C by E Balagurusamy, Seventh Edition, McGraw Hill
Education
• Numerical Methods
– Computer Oriented Numerical Methods by V. Rajaraman, Third Edition, 1993,
PHI
– Introductory Methods of Numerical Analysis by S.S.Sastry, Fifth Edition, 2012,
PHI
– Numerical Methods for Engineers by S. C. Chapra and R. P. Canale, 7th Edition,
2016, McGraw Hill Education
 Course Outcomes
• The students of the course should be able to –
• CO1: Model a problem logically.
• CO2: Recognize correct syntax of the programming
language.
• CO3: Synthesize modular programs for application
problems.
• CO4: Solve algebraic and differential systems numerically.
• CO5: Solve interpolation and regression problems
numerically with applications.
• CO6: Develop computer programs for numerical methods.
 Class Test - I
Course Outcome Allotted Marks
CO1: Model a problem logically. 5

CO2: Recognize correct syntax of 15

the programming language.
CO3: Synthesize modular programs 10
for application problems.
 Class Test - II
Course Outcome Allotted Marks
CO3: Synthesize modular programs 10
for application problems
CO4: Solve algebraic and 10
differential systems numerically
CO6: Develop computer programs 10
for numerical methods
 Semester Examination (Theory)
Course Outcome Allotted Marks
CO1: Model a problem logically. 10

CO2: Recognize correct syntax of the programming 20

language.
CO3: Synthesize modular programs for application 20
problems.
CO4: Solve algebraic and differential systems 14
numerically
CO5: Solve interpolation and regression problems 16
numerically with applications.
CO6: Develop computer programs for numerical 20
methods.
 CO – CPNM Lab (Tentative)
• After the course the students are expected to be able to
•
• CO1: Identify and abstract the programming task involved for a given
computational problem and write ​the corresponding C program on a
computer, edit, compile, debug, correct, recompile and run it.
• CO2: Choose​ the right data representation formats based on the
requirements of the problem.
• CO3: Understand the concepts of the various programming constructs and
choose​ the right one for the implementation of the given computational
task.
• CO4: Design and implement modular programs for the given
computational task.
• CO5: Implement C programs for various numerical methods, such as
solution of linear and nonlinear equations, interpolation, regression,
differentiation, integration, solution of differential equations.