loader image
Skip to main content

SUBJECT DETAILS

Programme: BCA

Course Code: BCA2CJ103 / BCA2MN102

Course Title: Numerical Analysis and Operations Research

Type of Course: Major / Minor (B2)

Semester: II

Academic Level: 100–199

Credits: 4

Lecture Hours: 4 per week

PRE-REQUISITES

Understanding of algebraic concepts, equations, and inequalities

Basic knowledge of derivatives and integrals

COURSE SUMMARY

Covers numerical methods and operations research

Focus on error analysis and solution techniques

Includes algebraic and transcendental equations

Topics include interpolation, numerical integration

Introduces linear programming and OR principles


COURSE OUTCOMES 

CO1: Solve algebraic and transcendental equations using numerical methods

CO2: Apply interpolation and numerical integration techniques

CO3: Understand fundamentals of Operations Research

CO4: Solve Linear Programming Problems using optimization techniques

CO5: Understand and solve transportation problems

CO6: Solve assignment problems for optimal solutions

MODULE I – NUMERICAL ANALYSIS I

Errors in numerical calculations

Sources of errors

Solution of algebraic and transcendental equations

Bisection method

Method of false position

Newton–Raphson method

MODULE II – NUMERICAL ANALYSIS II

Polynomial interpolation
Lagrange interpolation

Newton’s forward difference interpolation

Newton’s backward difference interpolation

Numerical solution of definite integrals

Simpson’s 1/3 rule

Simpson’s 3/8 rule

Trapezoidal method


MODULE III – OPERATIONS RESEARCH I

Introduction to Operations Research

Definition, advantages, and limitations of OR

Linear Programming Problem (LPP)

Formulation of LPP

Feasible solution and optimal Solution 


Dual of LPP

Graphical solution of LPP

Simplex method

Big-M method


MODULE IV – OPERATIONS RESEARCH II

Transportation problem

Balanced and unbalanced transportation problems

Finding basic feasible solutions

Northwest corner method

Least cost method

Vogel’s approximation method

Optimized (MODI) method

Assignment model

Balanced and unbalanced assignment problems

Hungarian method for optimal solution

MODULE V – OPEN ENDED MODULE (OTHER NUMERICAL METHODS)

Any two additional methods to solve algebraic and transcendental equations

Any two additional methods for polynomial interpolation

Any two additional methods to solve definite integrals

Any one additional method to solve LPP

Skill Level: Beginner