Professional Documents
Culture Documents
2012
Subject code:
Probability, Statistics and Operational Research L T P C
MAT 509
3 1 0 4
Version No. 1.0
Course Nil
Prerequisites:
Aims and Objectives To expose the students to apply certain probability, statistical and operational research
concepts in practical applications of computer science areas. On completion of this course
the student will be familiar with basic concepts of probability distributions, statistical
methods, linear programming problems and its applications, game theory and CPM and
PERT techniques.
Learning Outcome: The student will learn statistical and operational research tools that will be useful in
software simulation and modeling.
Unit No. 1 Probability Distribution , Correlation and Regression Number of hours: 9
Probability Distributions ‐ Random Variables – Distribution function of a random variables – Expectation ‐
Bivariate distribution – Conditional and marginal distributions ‐ Binomial, Poisson , Normal and Exponential
distributions . Correlation coefficient – Linear Regression .
Unit No. 2 Sampling Theory and Testing Hypothesis Number of hours: 12
Concept of sampling – Methods of sampling– Concepts of sampling distributions ‐ Standard error – Point
estimation – Interval estimation of mean and proportion.
Tests of Hypotheses – Critical region – Two types of Errors – Level of significance – Large sample tests for mean
and proportion – Exact tests based on Normal, t, F and Chi–square distributions.
Analysis of variance – One way and Two way classifications – CRD‐ RBD.
Unit No. 3 Non‐Parametric Tests and Time series Analysis Number of hours: 6
Non‐parametric Tests – Sign test ‐ Rank Sum test ‐ Run Test ‐ Kruskal Wallis Test, ‐ Mann Whitney U Test – Rank
correlation.
Time series Analysis – Measurement of Trend and Seasonal variations.
Unit No. 4 Linear Programming and its applications Number of hours: 9
Linear programming problem, the simplex method ‐ Big M method – Revised simplex method. Duality ‐ Primal
and dual problems ‐ Dual simplex method.
Transportation problem – Basic feasible solution methods– Optimal solution – MODI method‐ Assignment
problem ‐ Hungarian method
Unit No.5 Game Theory and Network Analysis Number of hours: 9
Game Theory: 2 person zero sum games‐n‐person zero sum games ‐Pure Strategy and Mixed Strategy ‐ Saddle
point – Dominance properties ‐ Simplex method.
858
Proceedings of the 26th Academic Council held on 18.5.2012
Network : PERT/CPM networks ‐ project scheduling with uncertain activity times ‐ the critical path calculation .
Text Books 1. K.S. Trivedi, Probability and Statistics with reliability, Queuing and Computer Science
Applications , Prentice Hall India (2001).
2. N D Vohra, Quantitative Techniques in Management, McGraw Hill (2007)
Reference Books 1. Hamdy Taha , Operations research , 7th edition, Prentice Hall India (2003)
2. Kanti Swarup, P.K. Gupta & Man mohan, Operations research, Sultan Chand & Sons (
2000).
3. S.C. Gupta and V.K. Kapoor , Fundamentals of Mathematical Statistics , Sultan Chand
&Sons.(2002).
4.Ricard A Johnson and C. B.Gupta, Miller and Freund’s Probability and Statistics for
engineers, Pearson Education (2006).
Mode of Evaluation Continuous assessment examination, Assignment / Seminar and Term‐end
examination
Recommended by
the Board of Studies
on
Date of Approval by
the Academic
Council
859