MA1014probnability & Queueing Theory
MA1014probnability & Queueing Theory
The objective is to impart students of Engineering and Technology, the concepts of statistical techniques on
probability to apply them for solving real world problems.
The list of instructions (provided below) may be followed by a faculty relating to his/her own schedule
includes warm‐up period, controlled/free practice, and the respective feedback of the classes who handle.
The lesson plan has been formulated based on high quality learning outcomes and the expected outcomes
are as follows
Each subject must have a minimum of 60 hours, which in turn, 45 hours for lecture and rest of the hours for
tutorials. The faculty has to pay more attention in insisting the students to have 95 % class attendance.
Lect. Lesson schedule Learning outcomes Cumulative
No hour(s)
UNIT-I: Probability & Random Variables
L 1.1 Introduction to probability 1
concepts, axioms, theorems Students will demonstrate
L1.2 Characteristics of random variables knowledge & be able to examine 2
– Discrete case and understand & use basic
L1.3 Characteristics of random variables probability 3
– Discrete case
L1.4 Characteristics of random variables Students will be able characterize 4
– Continuous case probability models using
probability mass (density)
L1.5 Characteristics of random variables 5
functions & cumulative
– Continuous case
distribution functions
L1.6 Moments 6
L1.7 Expectation, variance 7
L1.8 Moment generating functions 8
L1.9 Function of random variable 9
L.1.10 Chebychev’s inequality - proof 10
L.1.11 Applications of Chebychev’s 11
inequality
L.1.12 Tutorial 12
CYCLE TEST – I : Date: 09.02.2015
UNIT-II Theoretical Distributions
L2.1 Discrete distribution: Binomial 13
distribution – MGF, Mean, Variance
L2.2 Applications of Binomial distribution 14
L2.3 Poisson distribution – MGF, Mean, 15
Variance Students will be introduced to the
L2.4 Applications of Poisson distribution techniques of developing discrete & 16
continuous probability distributions and
L2.5 Geometric distribution – MGF, 17
its applications
Mean, Variance
L2.6 Applications of Geometric 18
distribution
L2.7 Uniform distribution 19
L2.8 Continuous distribution: Exponential 20
distribution - MGF, Mean, Variance
Page 1 of 3
L2.9 Applications of Exponential 21
distribution
L2.10 Normal distribution – MGF, Mean, 22
Variance
L2.11 Applications of Normal distribution 23
L.2.12 Tutorial 24
CYCLE TEST – II : Date: 09.03.2015
Page 2 of 3
L5.3 Chapman Kolmogorov theorem 51
References:
Veerarajan T., Probability, Statistics and Random Processes, Tata McGraw Hill,1st Reprint 2004.
S.C. Gupta and V.K. Kapoor, Fundamentals of Mathematical Statistics, 9th extensively revised
edition, Sultan Chand & Sons, 1999.
Trivedi K S, “ Probability and Statistics with reliability, Queueing and Computer Science
Applications”,Prentice Hall of India,New Delhi, 1984
Gross.D and Harris.C.M. “Fundementals of Queuing theory”, John Wiley and Sons, 1985.
Moorthy.M.B.K., Subramani.K & Santha.A, “Probability and Queueing Theory”, Scitech Publications,
V Edition, 2013.
Web‐based resources
http://en.wikipedia.org/wiki/probabilityandstatistics
http://en.wikipedia.org/wiki/queueing-theory
http://en.wikipedia.org/wiki/markov-process
Internal marks Total: 50
Internal marks split up: Cycle Test 1: 10 Marks Model Exam: 20 Marks
Attendance: 5 marks