CSE 1201 Computer Programming & Numerical Analysis

Course Title: Computer Programming & Numerical Analysis

Course Code: CSE 1201 Credit: 4.0 Contact Hours: 4.0 Total Marks: 100

Rationale: Computer Programming & Numerical Analysis comprises of two distinct topics,
where Computer Programming deals with the detailed insight into the programming concepts
that will be applicable to design a program or software to meet some specific objectives. It
provides basic knowledge on algorithms and the grammar of C programming language. On the
other hand, Numerical Analysis deals with algorithms that use numerical approximation for the
problems of mathematical analysis. Students will get a good idea to make solution of practical
mathematical calculations.

Objectives: Going through the course the student will be able to

1. Learn the basic programming concept, algorithms and application in programming
C.
2. Understand the control statements, loops, functions, arrays, strings, pointers.
3. Acquire knowledge on finding solutions of algebraic and transcendental
equations, simultaneous linear equations, interpolation, differentiation,
integration, ordinary differential equations and least squares approximation of
functions.

Learning Course Content Teaching- Assessment

Outcomes Learning Strategy

Strategy

Upon successful completion of the course the students will be able to

Describe the Computer basics, programming C Brainstormin Execution of

Computer basics fundamentals, create and compile a program, g, lecture, a program,
and programming variable, Comments, C keywords, function slide show brief
concepts. arguments. presentation explanation

Identify the Simple if, if-else, nested if- else, switch-case Brainstormin Execution of
control statements statement, for loop, while loop, do-while loop, g, lecture, a program,
and apply those in increment and decrement operation, relational slide show brief
programming. and logical operators, break and continue presentation explanation
statements.
Differentiate Library, user defined, macro, passing Brainstormin Execution of
different arguments and g, lecture, a program,
functions and recursive functions to solve different slide show brief
apply those in practical problems. presentation explanation
programming.
Describe the basics Single and multidimensional Arrays and Brainstormin Execution of
of arrays and apply strings, initialize arrays, build arrays of string g, lecture, a program,
those in to solve the problems related to slide show brief
programming. data analysis. presentation explanation

Explain the Pointer basics, restriction to pointer Brainstormin Execution of

operator of expression, pointer with array, pointer to g, lecture, a program,
pointer variable string constants, arrays of pointer, slide show brief
and apply that pointer as parameter to solve security presentation explanation
in related problem.
programming.
Compute the Laws reducible to linear law, equations Brainstormin Execution of
linear law and involving three constants, least square, g, lecture, a math, brief
apply that to solve straight line, parabola, method of group slide show explanation
linear law of averages. presentation
equations.
Explain the Bisection method, method of successive Brainstormin Execution of
Numerical, approximation, false position method, iteration g, lecture, a math, brief
Algebraic & method, rate of convergence, Newton Raphson slide show explanation
Transcendental method. presentation
equation and
apply those to
solve related
problems.
Identify the Gauss elimination method, Gauss Jordan Brainstormin Execution of
basics of the method, inverse of a matrix, relaxation g, lecture, a math, brief
simultaneous method, Jacobi method of iteration, slide show explanation
linear algebraic Gauss Seidel method. presentation
equation and
apply that to
solve related
problems.
Compute the Forward differences, backward differences, Brainstormin Execution of
basics of the central differences, differences of g, lecture, a math, brief
finite differences polynomial, reciprocal polynomial, difference slide show explanation
and apply those operators. presentation
to solve related
problems.
Identify the Numerical differentiation, general Brainstormin Execution of
basics of the quadrature formula, errors in quadrature g, lecture, a math, brief
Numerical formula, Trapezoidal rule, Simpson’s slide show explanation
differentiation & 1/3 rule, Simpson’s 3/8 rule, Weddle’s rule. presentation
integration and
apply those to
solve related
problem.
Describe the Taylor series method for solving differential Brainstormin Execution of
basics of the equations, Picard’s method, Runge-Kutta g, lecture, a math, brief
ordinary method, Euler’s method, slide show explanation
differential improved Euler’s method, modified Euler’s presentation
equations and method.
apply those to
solve related
problem.

RECOMMENDED BOOKS AND PERIODICALS

Text Books:
1. Dr. V. N.Vedamurthy, Dr. N Ch S N Iyengar, Numerical
methods,Frederick Drake, 1906.
2. Herbert Schildt, Teach Yourself C (Third edition), McGraw-Hill, 1997.
References:
1. Programming in C, Author, RobertLafore.
2. Numerical Analysis, L.W. Johnson and R.D. Riess.

CSE 1202 Computer Programming & Numerical Analysis

Lab

Course Title: Computer Programming & Numerical Analysis Lab

Course Code: CSE 1202 Credit: 1.5 Contact Hours: 3.0 Total Marks: 100

List of Experiments of computer programming:

1. Computer programming:
1. To perform Addition, Subtraction, Multiplication, Division and reminder
operations.
 2. To find ASCII code of any character.
3. To find maximum value comparing two arbitrary input values.
4. To determine the square root of give input using a library function.
5. To find the factorial value of given input.
6. To display simple function operation
7. To display a function operation using return value.
8. To determine summation of two numbers using arguments.
9. To perform Boolean operation (AND, OR, NOT, NAND, NOR, XOR, XNOR).
10. To determine GPA according to input number (where 0-39=F; 40-59=C; 60-
69=B; 70-79=A; 80-100=A+).
11. To find if a mentioned year is leap year or not.
12. To find if a given input is positive or negative.
13. To determine the square of any number using user defined function.
14. To perform the operation of nested for loop.
15. To perform the operation of go to statement where it is similar to for loop.
16. To find factorial value using recursion function.
17. To perform the operation of recognizing character using if-else statement.
18. To perform the operation of addition drill using nested if-else statement.
19. To perform the operation of a simple for-loop operation.
20. To perform the operation of nested for loop operation.
21. To perform the product and sum operation using for loop.
22. To perform the operation of simple calculation (Addition, subtraction,
multiplication & division) using character to select the operation.
23. To find the area of a circle using while loop.
24. To add two numbers using do-while loop.
25. To find a character „q‟ using while loop.
26. To add or subtract two numbers using switch-case statement.
27. To exchange the values from one variable to another using „exchgv‟ function.
28. To show the average, maximum and minimum marks of5 students using array.
29. To demonstrate how individual array elements can be passed to a function.
30. To demonstrate how strings are accessed where data are entered in a string
character by character and displayed character by character.
31. The program will demonstrate how strings are compared.
32. To perform the operation of strcat function.
33. To demonstrate the procedure of exchanging two names using two dimensional
arrays.
34. To demonstrate the function of pointers.
35. To print the value and address of elements in an array
36. To show the relation between arrays and pointers.
37. To display the relation between pointer and function.
38. To find how a record of two employees is created using arrays.
39. To demonstrate the operation of a simple structure operation.
40. To find out the area and perimeter of a rectangle using structure.
41. To show a simple operation of union.

Numerical Analysis:
1. To find the root of a given equation using secant method.
x0 nh

2. Name of program: To determine the root of  f ( x)dx

x0
SIMPSON'S 3/8 RULE

b
where, I   ydx .
a
x0 nh b
3. Name of program: To find the root of  f ( x)dx where, I   ydx using
x0 a

SIMPSON'S 1/3 rule.

x0 nh b
4. Name of program: To find the root of  f ( x)dx where, I   ydx using
x0 a

TRAPEZOIDAL rule.
5. Name of program: To determine binary value of a decimal number and vice-versa.
6. Name of program: To find the root of x^2-5x+4=0 using Bi-section method.
7. Name of program: To find the root of f ( x)  2 x n  2 x n1  3x n2 using
SUCESSIVE APPROXIMATION.
8. Name of program: To find the root of f ( x)  2 x 2  4 x  1  0 using Iterative
process.
9. Name of program: To find the root of f ( x)  x 2  5x  4  0 using Newton-
Raphson Method.
1
10. Name of program: To find the root of f ( x)  y 0  (k1  k 2 ) where
2
k1  hf ( x0 , y0 ) and k 2  hf ( x0  h, y0  k1 ) using RUNGE-KUTTA method.