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: Malabei Tujar
Country: Saint Lucia
Language: English (Spanish)
Genre: Health and Food
Published (Last): 6 September 2011
Pages: 345
PDF File Size: 11.9 Mb
ePub File Size: 16.39 Mb
ISBN: 528-7-30578-832-9
Downloads: 43708
Price: Free* [*Free Regsitration Required]
Uploader: Shaktigami

Assuming that the system behavior can be approximated by a 2 stage tandem queue find the probability that the service stations are idle. V with mean 0 and 1 i.

PQT (MA) – Computer Science Engineering ()

Check whether it is regular. Number of telephone calls in 0,t. What is the probability that this water supply will be inadequate on any given day? Find mean and auto correlation of the process. When do you say the Markov chain is regular? It was old and worn. If the pumping station of the locality has a daily supply capacity of a millions litres.

Discrete random process 4. Find na2262 probability that among a sample of jobs there are no jobs that have to wait until weekends. The message arrivals are modelled as two independent Poisson processes, with rates 20 per hour for the short messages and 15 per hour for the long messages.


Write down the applications of network queues. Random process is a function of time and the outcomes of a random experiment. A regular Markov chain is defined syllavus a chain having a transition matrix P such that for some power of P, it has only non-zero positive probability values. What is the probability that it will last for atleast one more minute?


Find the average time syllabuz car spends in the facility, if the time for washing and cleaning a car is constant of 10 minutes. So he made a.

What are the different types of Random process. Assuming the system behavior ms2262 be approximated by the two stage tandem queue find the bottle neck of the repair facility.


Title of the Presentation Line 1 [36pt Calibri bold blue] Title of the. A syllaubs sample of size is taken from a population whose mean is 60 and variance is The customers may enter the system at some node, can traverse from node to node in the system and finally can leave the system from any node.

A random process in which the future value depends only on mma2262 present value but not on the past value is called Markov process. Arrivals from outside through node i follow a Poisson process with mean arrival rate ri. Time study observations gave the average slinging time as What is the probability that at least 5 components are to be examined in order to get 3 defectives? If one of the regression coefficients is sylabus than unity then the other should be less than unity.


zyllabus If the average service time is cut to 8. MA Question Bank – 2. Joseph The Dreamer – christ connect church. MA Question Bank – 10 customers in the system.

Probability and Queueing Theory(question with answer)

In a certain locality the daily consumption of water in millions of litres, can be treated as a random variable having a gamma distribution with an average of 3 million litres. Calculate the probability that the yard is empty.

Arriving customers have to join the queue if No. In this model the service time is not varying and constant. If letters arrive for being typed at the rate of 15 letters per hour, a What fraction of the time all the typists will ka2262 busy?

The maximum temperature of a place at 0,t.