- Description
-
Details
Probability And Queueing Theory Premium Lecture Notes, Prepared by Agalya. Specially for Computer Science Engineering and Information Technology. Syllabus Covered based on Anna University B.E CSE and B.Tech I.T.
PROBABILITY AND QUEING THEORY
UNIT-1 (Pages: 64)
RANDOM VARIABLE
UNIT-2 (Pages: 36)
TWO DIMENSIONAL RANDOM VARIABLE
UNIT-3 (Pages: 32)
RANDOM PROCESS
UNIT-4 (Pages: 36)
QUEUEING MODELS
UNIT-5 (Pages: 29)
ADVANCED QUEUEING MODELSUNIT-1
RANDOM VARIABLE
Definition for:
1. trial and even
2. Exhaustive events
3. Mutually exclusive events
4. Equally likely events
5. Independent event
Definition for:
1. Discrete random variable
2. Probability mass function
3. Probability distribution
Properties of distribution function
Expected value of a discrete random variable
Continuous random variable
Probability density function
Binomial distribution
Binomial experiment
Poison distribution
Geometric distribution
Memory less property
Uniform distribution
Experimental distribution
Gamma distributionUNIT-2
TWO DIMENSIONAL RANDOM VARIABLE
Definition:
Two dimensional discrete variable
Join probability mass function of discrete random variable
Marginal probability function
Conditional probability function
Independent random variableContinuous random variable
Regression
Lines of regression
Regression co-efficient
Angle between the regression lines
Transformation of random variableUNIT-3
RANDOM PROCESS
Comparison of random variable and random process
Poison process
Discrete parameter
UNIT-4
QUEUEING MODELS
Characteristics of queuing system
Kendall’s notation for representation queuing models
Terminology
Pure death process
Birth and death processUNIT-5
ADVANCED QUEUEING MODELS
Pollaczek - Khinchin formula
Efficiency of a queuing system
Classification of network - Additional Information
-
Additional Information
Pages 197 Author Agalya - Reviews
-
Welcome to Vidyarthiplus (V+) Shop!