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: Mirr Kiganos
Country: Romania
Language: English (Spanish)
Genre: Video
Published (Last): 2 February 2007
Pages: 422
PDF File Size: 8.50 Mb
ePub File Size: 19.49 Mb
ISBN: 996-5-80413-221-6
Downloads: 67886
Price: Free* [*Free Regsitration Required]
Uploader: Akinojas

What is the joint probability that there are m customers at station 1 and n customers at station 2 for a 2 stage series queue?

When do you say the Markov chain is regular? What is the probability that it will last for atleast one more minute? The Markov chain is irreducible if all states communicate with each other at some time. What is the probability that of 2 days selected at random the stock is insufficient for both days?

The service time is not following exponential distribution.


V with mean 0 and 1 i. What is the probability that the average life time of a random sample of the appliances is atleast Joseph had a little overcoat. In Continuous random process, X and Time set T are continuous. Find the probability that he takes a train on the third day.



Suppose the length of life of an appliance has an exponential distribution with mean 10 years. Define random process and its classification Random process is a function of time and the outcomes of a random experiment. Probability and Queueing Theory 8 Subject Code: A random sample of 8 lamps is taken for inspection. Define closed Jackson networks.

Networks preserving the following characteristics are called Jackson networks. A random process or Stochastic process X s,t is a function that maps each element of a sample space into a time function called sample function. Potential customers, who arrive when all 5 chairs are full, leave without entering shop. Poisson process is a counting point process representing the number of occurrences of certain event in a finite collection syllabs non overlapping statistically independent time arrivals.

A random process in which the future value depends only on the present value but not on the sjllabus value is called Markov process.

Find the rth moment of X about the 2 origin. Define Markov process A random process in which the future syplabus depends only on the present value but not on the past value is called Markov process.

  ISO 10648-1 PDF

Examination time per patient is exponential with a mean rate of 20 per hour.

Probability and Queueing Theory Subject Code: Probability and Queueing Theory 7. So he made a.

Probability and Queueing Theory(question with answer)

Let one copy of a magazine out of 10 copies bears a special prize following Geometric distribution, Determine its mean and variance. Service time distribution follows any general distribution. Arrivals from outside through node i follow a Poisson process with mean arrival rate ri. 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.

A one person barber shop has six chairs to accommodate people waiting for a haircut. The town has a daily stock of 35, litres. Time study observations gave the average slinging time as Because of space constraints, only 4 cars are accepted for servicing.