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.
|Published (Last):||6 April 2017|
|PDF File Size:||4.37 Mb|
|ePub File Size:||14.37 Mb|
|Price:||Free* [*Free Regsitration Required]|
Continuous Random sequence 3. There are four types of random process 1. The length of the shower in a tropical island in a rainy season has an exponential distribution with parameter 2, time being measured in minutes.
Probability & Queuing theory MA notes – Annauniversity lastest info
However if she buys B or C the next week she is 3 times as likely to buy A as the other cereal. A housewife buys 3 kinds of cereals A, B and C. Show that the process is not stationary. Let n and p be the parameters.
A random process in which the future value depends only on the present wyllabus but not on the past value is called Markov process. A one person barber shop has six chairs to accommodate people waiting for a haircut. Find the rth moment of X about the 2 origin.
PQT (MA) – Computer Science Engineering ()
MA Question Bank – 2 3 2. What is the probability that at least 5 components are to be examined in order to get 3 defectives? MA Question Bank – 10 customers in the system.
No customer may leave the system. What is the probability that it will last for atleast one more minute? She never buy the same cereal in successive weeks. In discrete random process, X is. In steady state the arrival rate and departure rate at the respective nodes coincide. The time required to repair a machine is exponentially distributed with parameter St. Identify the regression equation on y on x: Find mean and auto correlation of the process. syllabjs
The customer who has finished is billing job has to wait ma222 the delivery section becomes free. The maximum temperature of a place at 0,t. Probability and Queueing Theory 8 Subject Code: Write down the flow balance equation of open Jackson network. Find the average number of cars waiting in the parking lot, if the time for washing and cleaning a syllabux follows a discrete distribution with values equal to 4,8,15 minutes and corresponding probabilities 0.
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. Service time distribution follows Poisson distribution.
What is the average waiting time of the system if the system could be approximated by a two series Tandem queue? 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. 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?
Probability and Queueing Theory(question with answer)
So he made a. Discrete Random sequence 2. If the pumping station of the locality has a daily supply capacity of a millions litres. Find the probability that this computer will function for a month with only one breakdown. It is vivid from the expressions of moments of poisson process that they are time dependent.
Define Chapman-Kolmogrov Equation The Chapman-Kolmogrov equation provides a method to compute the n-step transition probabilities.
System depends on time t, Steady state: Write down the moment generating function of Gamma distribution. Find the syolabus that on a randomly selected day. Discrete random process 4.