Anna University, Chennai Department of Computer Science Engineering ( Common to I.T) Fourth Semester MA Probability and Queueing. Subject Code: MA Subject Name: Probability and Queuing Theory Type: Question Bank Edition Details: Kings Edition Syllabus. MA — PROBABILITY AND QUEUEING THEORY (Regulation ). ( Common to Information Technology) Time: Three hours Answer ALL Questions PART.

Author: Gardagul Dusho
Country: Bosnia & Herzegovina
Language: English (Spanish)
Genre: History
Published (Last): 26 October 2017
Pages: 233
PDF File Size: 8.56 Mb
ePub File Size: 20.58 Mb
ISBN: 573-4-24506-164-6
Downloads: 44994
Price: Free* [*Free Regsitration Required]
Uploader: Mataxe

The service time is not following exponential distribution. Where the arrival pattern M is Poisson, the Service time mx2262 G follows any general distribution and the number of servers is one. A man either drives a car or catches a train to go to office each day. The town has a daily stock of 35, litres. MA Question Bank – 2 3 2. What is the conditional probability that a repair maa2262 at 11h given that its direction 2 exceeds 8h?

What is the probability that it will last for atleast one more minute? It is vivid from the expressions of moments of poisson process that they are time dependent.


Write down the flow balance equation of closed Jackson network. If letters arrive for being typed at the rate of 15 letters per hour, a What fraction of the time all the typists will be busy? Let one copy of a magazine out of 10 copies bears a special prize following Geometric distribution, Determine syllabys mean and variance.


Suppose the length of life of an appliance has an exponential distribution with mean 10 years. In series queuesthere are a series of service stations through which each calling unit must progress prior to leaving the system. Potential customers, who arrive when all 5 chairs are full, leave without entering shop. Find the correlation coefficient between Syllaubs and Y x on y: No customer may leave the system.

Write down Pollaczek-khintchin formula. Define Chapman-Kolmogrov Equation The Chapman-Kolmogrov equation provides a method to compute the n-step transition probabilities. The clinic has 4 phases each having different service nature in series as follows: Telecommunication field, Bioinformatics, biomedical Industry. Define wide sense stationary process. The waiting room does not accommodate more than 14 patients. In discrete random process, X is.

Find the average number of cars waiting in the parking lot, if the time for washing and cleaning a car follows a discrete distribution with values equal to 4,8,15 minutes and corresponding probabilities 0.

MA PQT Lecture Notes – All Units Solved Problems

A random process is called stationary if all its statistical properties do not change with time. In open Jackson networks, the arrivals from outside to the node i is allowed and once a customer gets the service completed at node ijoins the queue at node j with probability Pij or leaves the system with probability Pi0. Here Pij denote the one step transition probability. Poisson process is a counting point process representing the number of occurrences of certain event in a finite collection of non overlapping statistically independent time arrivals.


Probability and Queueing Theory Subject Code: She never buy the same cereal in successive wyllabus. Define Birth and Death process. Time study observations gave the average slinging time as November 19, 0. Find the marginal density function.

Probability and Queueing Theory(question with answer)

Find all the marginal distributions and conditional probability distributions. The arrival pattern with 12cars per day. Find i The proportion of customers who enter the supermarket.

Service time distribution follows Poisson distribution.

In this model the service time is not eyllabus and constant. A random process in which the future value depends only on the present value but not on the past value is called Markov process.