MG University S5 Computer Science & Engineering B.tech Syllabus
Module 1
QUEUEING THEORY: General Concepts – Arrival pattern – service pattern – Queue disciplines – The Markovian model M/M/1/$, M/M/1/N – steady state solutions – Little’s formula.
QUEUEING THEORY: General Concepts – Arrival pattern – service pattern – Queue disciplines – The Markovian model M/M/1/$, M/M/1/N – steady state solutions – Little’s formula.
Module 2
NUMERICAL METHODS: Introduction – solution of algebraic and transcendental equations – Bisection method – Method of false position – Newton’s method – Approximate solution of equations – Horner’s method solutions of linear simultaneous equations – Iterative methods of solution-Jacobi’s method – Gauss Seidal method.
NUMERICAL METHODS: Introduction – solution of algebraic and transcendental equations – Bisection method – Method of false position – Newton’s method – Approximate solution of equations – Horner’s method solutions of linear simultaneous equations – Iterative methods of solution-Jacobi’s method – Gauss Seidal method.
Module 3
FINITE DIFFERENCES: Meaning of operators – Δ, , μ ,δ ,E – interpolation using Newton’s forward and backward formula – Langrange’s and Newton’s divided difference interpolation formula – numerical differenciation – first and second order derivatives using forward and backward formula – numerical integration – trapizoidal rule – Simpson’s 1/3 and 3/8 rules.
FINITE DIFFERENCES: Meaning of operators – Δ, , μ ,δ ,E – interpolation using Newton’s forward and backward formula – Langrange’s and Newton’s divided difference interpolation formula – numerical differenciation – first and second order derivatives using forward and backward formula – numerical integration – trapizoidal rule – Simpson’s 1/3 and 3/8 rules.
Module 4
LINEAR PROGRAMMING PROBLEM : graphical solution of LPP- general problem – solution of LPP using simplex method – Big M method – duality in LPP.
LINEAR PROGRAMMING PROBLEM : graphical solution of LPP- general problem – solution of LPP using simplex method – Big M method – duality in LPP.
Module 5
TRANSPORTATION AND ASSIGNMENT PROBLEM: Balanced transportation problem – initial basic feasible solution -Vogel’s approximation method – optimum solution by Modi method – Assignment problem – Hungerian techniques
TRANSPORTATION AND ASSIGNMENT PROBLEM: Balanced transportation problem – initial basic feasible solution -Vogel’s approximation method – optimum solution by Modi method – Assignment problem – Hungerian techniques
References
1. Operations Research – P.K. Gupta & D.S. Hira, S.Chand & Co. Ltd
2. Advanced Engg Mathematics – Ervin Kreyszig, Wiley Eastern Ltd.
3. Higher Engg. Mathematics – Dr. B.S. Grewal, Khanna Publishers.
4. Operations research – Richard Bronson, Schaum’s Outline Series
5. Operations research – Panneer Selvam,PHI
6. Numerical Methods in Science & Engg – M.K. Venkataraman, National Publishing Co.
2. Advanced Engg Mathematics – Ervin Kreyszig, Wiley Eastern Ltd.
3. Higher Engg. Mathematics – Dr. B.S. Grewal, Khanna Publishers.
4. Operations research – Richard Bronson, Schaum’s Outline Series
5. Operations research – Panneer Selvam,PHI
6. Numerical Methods in Science & Engg – M.K. Venkataraman, National Publishing Co.