MA9329 OPERATIONS RESEARCH SYLLABUS | ANNA UNIVERSITY ME COMPUTER NETWORKING AND ENGINEERING 1ST SEM SYLLABUS REGULATION 2009 2011 2012-2013 BELOW IS THE ANNA UNIVERSITY FIRST SEMESTER M.E COMPUTER NETWORKING AND ENGINEERING DEPARTMENT SYLLABUS, TEXTBOOKS, REFERENCE BOOKS,EXAM PORTIONS,QUESTION BANK,PREVIOUS YEAR QUESTION PAPERS,MODEL QUESTION PAPERS, CLASS NOTES, IMPORTANT 2 MARKS, 8 MARKS, 16 MARKS TOPICS. IT IS APPLICABLE FOR ALL STUDENTS ADMITTED IN THE YEAR 2011 2012-2013 (ANNA UNIVERSITY CHENNAI,TRICHY,MADURAI, TIRUNELVELI,COIMBATORE), 2009 REGULATION OF ANNA UNIVERSITY CHENNAI AND STUDENTS ADMITTED IN ANNA UNIVERSITY CHENNAI DURING 2009
MA9329 OPERATIONS RESEARCH L T P C
3 1 0 4
UNIT I QUEUEING MODELS 12
Poisson Process – Markovian Queues – Single and Multi-server Models – Little’s
formula – Machine Interference Model – Steady State analysis – Self Service Queue.
UNIT II ADVANCED QUEUEING MODELS 12
Non- Markovian Queues – Pollaczek Khintchine Formula – Queues in Series – Open
Queueing Networks –Closed Queueing networks.
UNIT III SIMULATION 12
Discrete Even Simulation – Monte – Carlo Simulation – Stochastic Simulation –
Applications to Queueing systems.
UNIT IV LINEAR PROGRAMMING 12
Formulation – Graphical solution – Simplex method – Two phase method -
Transportation and Assignment Problems.
UNIT V NON-LINEAR PROGRAMMING 12
Lagrange multipliers – Equality constraints – Inequality constraints – Kuhn - Tucker
conditions – Quadratic Programming.
L + T: 45+15 =60 PERIODS
REFERENCES
1. Winston.W.L. “Operations Research”, Fourth Edition, Thomson – Brooks/Cole, 2003.
2. Taha, H.A. “Operations Research: An Introduction”, Ninth Edition, Pearson
Education Edition, Asia, New Delhi, 2002.
3. Robertazzi. T.G. “Computer Networks and Systems – Queuing Theory and
Performance Evaluation”, Third Edition, Springer, 2002 Reprint.
4. Ross. S.M., “Probability Models for Computer Science”, Academic Press, 2002.
MA9329 OPERATIONS RESEARCH L T P C
3 1 0 4
UNIT I QUEUEING MODELS 12
Poisson Process – Markovian Queues – Single and Multi-server Models – Little’s
formula – Machine Interference Model – Steady State analysis – Self Service Queue.
UNIT II ADVANCED QUEUEING MODELS 12
Non- Markovian Queues – Pollaczek Khintchine Formula – Queues in Series – Open
Queueing Networks –Closed Queueing networks.
UNIT III SIMULATION 12
Discrete Even Simulation – Monte – Carlo Simulation – Stochastic Simulation –
Applications to Queueing systems.
UNIT IV LINEAR PROGRAMMING 12
Formulation – Graphical solution – Simplex method – Two phase method -
Transportation and Assignment Problems.
UNIT V NON-LINEAR PROGRAMMING 12
Lagrange multipliers – Equality constraints – Inequality constraints – Kuhn - Tucker
conditions – Quadratic Programming.
L + T: 45+15 =60 PERIODS
REFERENCES
1. Winston.W.L. “Operations Research”, Fourth Edition, Thomson – Brooks/Cole, 2003.
2. Taha, H.A. “Operations Research: An Introduction”, Ninth Edition, Pearson
Education Edition, Asia, New Delhi, 2002.
3. Robertazzi. T.G. “Computer Networks and Systems – Queuing Theory and
Performance Evaluation”, Third Edition, Springer, 2002 Reprint.
4. Ross. S.M., “Probability Models for Computer Science”, Academic Press, 2002.
No comments:
Post a Comment
Any doubt ??? Just throw it Here...