Syllabus & Course Curriculam
Course Type: MAJ-13
Semester: 7
Course Code: BMTMMAJ13T
Course Title: Computer Aided Numerical Practical in C (P)
(L-P-Tu): 0-6-0
Credit: 6
Practical/Theory: Practical
Course Objective: To be done.
Learning Outcome: Course Outcomes (CO): The whole course will have the following outcomes: Upon successful completion, students will be able to CO1: write the algorithms and sketch the flowcharts of the given numerical problems. CO2: develop a C program for a given algorit
Syllabus:
Unit -1: Problem-I: Known Problems [Credit: 6, 180L]
List of Problems for C Programming:
1. Finding a real Root of an equation by,
(a) Fixed point iteration.
(b) Newton-Rapson’s method.
2. Interpolation (Taking at least six points) by,
(a) Lagrange’s formula.
(b) Newton’s Forward Formula.
(c) Newton’s Backward Formula.
3. Integration by
(a) Trapezoidal rule.
(b) Simpson’s 1/3rd rule (taking at least 50 sub-intervals).
4. Solution of a 1storder ordinary differential equation by
(a) Modified Euler’s Method.
(b) Fourth-order R. K. Method (taking at least four steps).
Unit -2: Problem-II: Unknown Problems
Statistical and other simple programming like
(a) To find mean, median, mode, standard deviation
(b) Ascending, descending ordering of numbers
(c) Finite sum of a series
(d) Fibonacci numbers
(e) Checking of prime numbers
(f) Factorial of a number
(g) Solution of a quadratic equation
(h) L.C.M. & G.C.D. of two positive integers etc.
Viva-voce to be given on the day of examination.
Reading References:
Basic Features
Undergraduate degree programmes of either 3 or 4-year duration, with multiple entry and exit points and re-entry options, with appropriate certifications such as:
Note: The eligibility condition of doing the UG degree (Honours with Research) is- minimum75% marks to be obtained in the first six semesters.
Powered By CityHub web solution