MA2262 SYLLABUS PDF
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):||25 September 2017|
|PDF File Size:||19.74 Mb|
|ePub File Size:||13.18 Mb|
|Price:||Free* [*Free Regsitration Required]|
The waiting room does not accommodate more than 14 patients.
There are four mma2262 of random process 1. It is vivid from the expressions of moments of poisson process that they are time dependent. Arriving customers have to join the queue if No. The source emits particles at the rate of 6 per minute. The cumulative failure rate of all the machines is 0. What are the different types of Random process.
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. Let X be the power consumption in millions of kilowatt hours. It is a non Markovian queueing model. A random process in which the future value depends only on the present value but not on the past value is called Markov process.
The clinic has 4 phases each having different service nature in series as follows: Network of queues can be described as a group of nodes, where each of the nodes represents a service facility of the same type. A random process is said to be stationary to order one if the first order density functions defined for all the random variables of the process are same.
Find all the marginal distributions and conditional probability distributions. Telecommunication field, Bioinformatics, biomedical Industry. Find the average time a car spends in the facility, if the time for washing and cleaning a car is constant of 10 minutes.
Cse Engineers Square: ma pqt syllabus
The parking lot is large enough to accommodate any number of cars. The service time is not following exponential syllabuw. In a lot of 10, packets, how many packets would i be free defective blades?
What is the probability that it will last for atleast one more minute? 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.
Find a the mean life time of the component b the probability that such a component will be more than hours. Show that the process is not stationary. Write down the applications of network queues. Ma262 is given that X be the daily water consumption of the locality in million litres and X follows gamma syllabbus with average of 3 million litres. System depends on time t, Steady state: Find the correlation coefficient between X and Y x on y: Check whether it is regular.
MA Probability and Queuing Theory – Question Bank Kings Edition
MA Question Bank – 2. This is a multiple server model with finite capacity. Service time distribution follows any general distribution. Write down the flow balance equation of open Jackson network.
A random sample of 8 lamps is taken for inspection. Probability and Queueing Theory Subject Code: Define Chapman-Kolmogrov Equation The Chapman-Kolmogrov equation provides a method to compute the n-step transition probabilities.
Find the probabilities that: Define closed Jackson networks. 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. Documents Flashcards Grammar checker. 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.
Write the Physical conditions of Binomial distribution.
November 19, 0.