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: Batilar Gozil
Country: Paraguay
Language: English (Spanish)
Genre: Love
Published (Last): 24 October 2010
Pages: 403
PDF File Size: 8.18 Mb
ePub File Size: 9.8 Mb
ISBN: 374-8-12010-240-5
Downloads: 25750
Price: Free* [*Free Regsitration Required]
Uploader: Meztikree

Thus T is the random service time, which is a continuous random variable. Random process is a function of time and the outcomes of a random experiment. Find a the mean life time of the component b the probability that such a component will be more than hours. There are four types of random process 1.

MA Question Bank – 10 customers in the system. This is a multiple server model with finite capacity. What is the probability that out of 5 workers, at the most two contract that disease.

Write down the moment generating function of Gamma distribution.

The service station for which the utilization factor is maximum among all the other service stations of the network is called the bottle neck of a network. Check whether or not the process is wide sense stationary.

The parking lot is large enough to accommodate any number of cars. If the pumping station of the locality has a daily supply capacity of a millions litres. A physical examination for ma226 patient where the patient St. If jobs arrive at a rate syllbaus 5 per hour and the time to complete each job varies according to an exponential distribution with mean 6 min. A random sample of 8 lamps is taken for inspection.


Define closed Jackson networks. The time required to repair a machine is exponentially distributed with parameter St.

Cse Engineers Square: ma pqt syllabus

Write down the applications of network queues. Correlation coefficient is the geometric mean of regression coefficients 2. Define i Continuous time random process 2 Discrete random process.

Ysllabus Flashcards Grammar checker. Define Birth and Death process. Show that X t is not wide sense stationary. Blades are supplied in packets of 5 each. Calculate the probability that the yard is empty. Write the Physical conditions of Binomial distribution. Non Markovian queueing model: No customer may leave the system. What fraction of the potential customers are turned away?


Let X be the power consumption in millions of kilowatt hours. Number of telephone calls in 0,t. Define Markov process A random process in which the future value depends only on the present value but not on the past value is called Markov process.

Define Transition probability matrix. Show syllabud the process is not stationary.


Examination time per patient is exponential with a mean rate of 20 per hour. The Markov chain is irreducible if all states communicate with each other at some time. Because of space constraints, only 4 cars are accepted for servicing.

In steady state the arrival rate and departure rate at the respective nodes coincide. B is a random variable with mean 0 and variance 1. What is the probability that of 2 days selected at random the stock is insufficient for both days?

When do you say the Markov chain is homogeneous? Find the correlation coefficient between X and Y x on y: The doctor takes on the average 4 minutes for each phase of the check up and the time taken for each phase is exponentially distributed.

Probability and Queueing Theory(question with answer)

What do you mean by transient state ma22622 steady state queueing system? Probability and Queueing Theory 3 1 Subject Code: Construct the Transition Probability Matrix. Write down the flow balance equation of closed Jackson network. The number of monthly breakdown of a computer is a r. MA Question Bank – 2 3 2.