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.
||20 June 2016
|PDF File Size:
|ePub File Size:
||Free* [*Free Regsitration Required]
It has found that most types of major news stories occur as Poisson processes. Telecommunication field, Bioinformatics, biomedical Industry. Joseph The Dreamer – christ connect church. Assume that the inter arrival time follows an exponential distribution and the service time distribution is also exponential with an average of xyllabus minutes. The actual number of stories breaking in any given day is thus distributed Poisson 15and so the expected number is If the arrivals of the patients at the clinic are approximately Poisson at the average rate of 3 per hour, what is the average time spent by a patient i in the examination ii waiting in the clinic?
When do you say the Markov chain is homogeneous?
Check whether it is regular. What do you mean by transient state and steady state queueing system? What is the average calling rate for the services of the crane and what is the average delay in getting service?
There are four types of random process. Assuming that the system behavior may be approximated by the two-stage tandem queue, determine the average repair time.
If jobs arrive at a rate of 5 per hour and the time to complete each job varies according to an exponential distribution with syllabua 6 min. So, P is irreducible. Find the average number of cars in the service station, the average number of cars waiting for service and the average time a car spends in the system. Find the parameters of the distribution. Check whether or not the process is wide sense stationary.
However if she buys B or C the next week she is 3 times as likely to buy A as the other cereal. So he made a. Define open Jackson networks. If the average service time is cut to 8. Define Chapman-Kolmogrov Equation The Chapman-Kolmogrov equation provides a method to compute the n-step transition probabilities.
Probability and Queueing Theory(question with answer)
Find the correlation coefficient between X and Y x on y: Let n and p be the parameters. MA Question Bank – 10 customers in the system. The source emits particles at the rate of 6 per minute. Define i Continuous time random process 2 Discrete random process. MA Question Bank – Solutions: A regular Markov chain is defined as a chain having a transition matrix P syplabus that for some power of P, it has only non-zero positive probability values.
A random process in which the future value depends only on the present value but not on the past value is called Markov process. Write down the flow balance equation of closed Jackson network. Define series queues Tandem queues with an example.
Probability & Queuing theory MA notes – Annauniversity lastest info
Find the probability that among a sample of jobs there are no jobs that have to wait until weekends. Let X be the power consumption in millions of kilowatt hours.
Out ysllabus the 2 salesman, one is incharge of billing and receiving payment while other salesman is incharge of weighing and delivering the items. B is a random variable with mean 0 and variance 1. What is the average waiting time of the system if sylllabus system could be approximated by a two series Tandem queue?