## MA8402 PQT Syllabus

Anna University Regulation 2017 CSE MA8402 PQT Syllabus for all 5 units are provided below. Download link for CSE 4th SEM MA8402 PROBABILITY AND QUEUING THEORY Engineering Syllabus is listed down for students to make perfect utilization and score maximum marks with our study materials.

### Anna University Regulation 2017 COMPUTER SCIENCE ENGINEERNG (CSE) 4th SEM MA8402 PROBABILITY AND QUEUING THEORY Engineering Syllabus

MA8402 PROBABILITY AND QUEUING THEORY
OBJECTIVES:
 To provide necessary basic concepts in probability and random processes for applications
such as random signals, linear systems in communication engineering.
 To understand the basic concepts of probability, one and two dimensional random
variables and to introduce some standard distributions applicable to engineering which can
describe real life phenomenon.
 To understand the basic concepts of random processes which are widely used in IT fields.
 To understand the concept of queueing models and apply in engineering.
 To understand the significance of advanced queueing models.
 To provide the required mathematical support in real life problems and develop
probabilistic models which can be used in several areas of science and engineering.

UNIT I PROBABILITY AND RANDOM VARIABLES
Probability – Axioms of probability – Conditional probability – Baye‘s theorem – Discrete and continuous random variables – Moments – Moment generating functions – Binomial, Poisson, Geometric, Uniform, Exponential and Normal distributions.
UNIT II TWO – DIMENSIONAL RANDOM VARIABLES
Joint distributions – Marginal and conditional distributions – Covariance – Correlation and linear regression – Transformation of random variables – Central limit theorem (for independent and identically distributed random variables).

UNIT III RANDOM PROCESSES
Classification – Stationary process – Markov process – Poisson process – Discrete parameter Markov chain – Chapman Kolmogorov equations – Limiting distributions.
UNIT IV QUEUEING MODELS
Markovian queues – Birth and death processes – Single and multiple server queueing models – Little‘s formula – Queues with finite waiting rooms – Queues with impatient customers : Balking
and reneging.
Finite source models – M/G/1 queue – Pollaczek Khinchin formula – M/D/1 and M/EK/1 as special cases –Series queues – Open Jackson networks.

If you require any other notes/study materials, you can comment in the below section.

For MA8402 PQT Previous Year Question Papers – Click here

#### Search Terms

MA8402 PQT Syllabus

Anna University 4th Sem CSE PQT Syllabus