Name of the Student:

Similar documents
Name of the Student: Problems on Discrete & Continuous R.Vs

Engineering Mathematics : Probability & Queueing Theory SUBJECT CODE : MA 2262 X find the minimum value of c.

Name of the Student: Problems on Discrete & Continuous R.Vs

Name of the Student: Problems on Discrete & Continuous R.Vs

Name of the Student: Problems on Discrete & Continuous R.Vs

Name of the Student: Problems on Discrete & Continuous R.Vs

PROBABILITY & QUEUING THEORY Important Problems. a) Find K. b) Evaluate P ( X < > < <. 1 >, find the minimum value of C. 2 ( )

Name of the Student: Problems on Discrete & Continuous R.Vs

Name of the Student: Problems on Discrete & Continuous R.Vs

Queueing Theory and Simulation. Introduction

CHENDU COLLEGE OF ENGINEERING AND TECHNOLOGY

VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur

P 1.5 X 4.5 / X 2 and (iii) The smallest value of n for

Markov Chains. X(t) is a Markov Process if, for arbitrary times t 1 < t 2 <... < t k < t k+1. If X(t) is discrete-valued. If X(t) is continuous-valued

Chapter 2 Queueing Theory and Simulation

Queueing Theory II. Summary. ! M/M/1 Output process. ! Networks of Queue! Method of Stages. ! General Distributions

THE QUEEN S UNIVERSITY OF BELFAST

Probability and Statistics Concepts

Performance Evaluation of Queuing Systems

Answers to selected exercises

Classification of Queuing Models

Contents Preface The Exponential Distribution and the Poisson Process Introduction to Renewal Theory

Non Markovian Queues (contd.)

Question Paper Code : AEC11T03

Page 0 of 5 Final Examination Name. Closed book. 120 minutes. Cover page plus five pages of exam.

Queueing Systems: Lecture 3. Amedeo R. Odoni October 18, Announcements

Readings: Finish Section 5.2

PBW 654 Applied Statistics - I Urban Operations Research

57:022 Principles of Design II Final Exam Solutions - Spring 1997

Examination paper for TMA4265 Stochastic Processes

Lecture 7: Simulation of Markov Processes. Pasi Lassila Department of Communications and Networking

Chapter 6: Functions of Random Variables

Link Models for Circuit Switching

λ λ λ In-class problems

Queueing Review. Christos Alexopoulos and Dave Goldsman 10/6/16. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA

Queueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "

Chapter 10. Queuing Systems. D (Queuing Theory) Queuing theory is the branch of operations research concerned with waiting lines.

Computer Systems Modelling

Problems on Discrete & Continuous R.Vs

M/G/1 and M/G/1/K systems

MARKOV PROCESSES. Valerio Di Valerio

CPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017

M.Sc. (MATHEMATICS WITH APPLICATIONS IN COMPUTER SCIENCE) M.Sc. (MACS)

MA6451 PROBABILITY AND RANDOM PROCESSES

Chapter 8 Queuing Theory Roanna Gee. W = average number of time a customer spends in the system.

HW1 (due 10/6/05): (from textbook) 1.2.3, 1.2.9, , , (extra credit) A fashionable country club has 100 members, 30 of whom are

Queueing Theory. VK Room: M Last updated: October 17, 2013.

Class 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis.

Recap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks

CPSC 531 Systems Modeling and Simulation FINAL EXAM

Stochastic process. X, a series of random variables indexed by t

Stochastic Models in Computer Science A Tutorial

Queueing Review. Christos Alexopoulos and Dave Goldsman 10/25/17. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA

STAT 430/510 Probability Lecture 12: Central Limit Theorem and Exponential Distribution


Chapter 5: Special Types of Queuing Models

EXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY (formerly the Examinations of the Institute of Statisticians) GRADUATE DIPLOMA, 2004

10.2 For the system in 10.1, find the following statistics for population 1 and 2. For populations 2, find: Lq, Ls, L, Wq, Ws, W, Wq 0 and SL.

Probability Models. 4. What is the definition of the expectation of a discrete random variable?

Glossary availability cellular manufacturing closed queueing network coefficient of variation (CV) conditional probability CONWIP

INDEX. production, see Applications, manufacturing

Figure 10.1: Recording when the event E occurs

Lecture Notes 7 Random Processes. Markov Processes Markov Chains. Random Processes

Part I Stochastic variables and Markov chains

Transient Analysis of a Series Configuration Queueing System

Performance Modelling of Computer Systems

Data analysis and stochastic modeling

SYMBOLS AND ABBREVIATIONS

n(1 p i ) n 1 p i = 1 3 i=1 E(X i p = p i )P(p = p i ) = 1 3 p i = n 3 (p 1 + p 2 + p 3 ). p i i=1 P(X i = 1 p = p i )P(p = p i ) = p1+p2+p3

Random Walk on a Graph

GI/M/1 and GI/M/m queuing systems

NICTA Short Course. Network Analysis. Vijay Sivaraman. Day 1 Queueing Systems and Markov Chains. Network Analysis, 2008s2 1-1

for valid PSD. PART B (Answer all five units, 5 X 10 = 50 Marks) UNIT I

Queues and Queueing Networks

5/15/18. Operations Research: An Introduction Hamdy A. Taha. Copyright 2011, 2007 by Pearson Education, Inc. All rights reserved.

Introduction to Queueing Theory

Chapter 3 Balance equations, birth-death processes, continuous Markov Chains

ECEn 370 Introduction to Probability

(Ch 3.4.1, 3.4.2, 4.1, 4.2, 4.3)

Time Reversibility and Burke s Theorem

Introduction to Queueing Theory

O June, 2010 MMT-008 : PROBABILITY AND STATISTICS

Exercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010

Introduction to Queueing Theory with Applications to Air Transportation Systems

(Ch 3.4.1, 3.4.2, 4.1, 4.2, 4.3)

LECTURE #6 BIRTH-DEATH PROCESS

QUEUING SYSTEM. Yetunde Folajimi, PhD

NANYANG TECHNOLOGICAL UNIVERSITY SEMESTER I EXAMINATION MH4702/MAS446/MTH437 Probabilistic Methods in OR

Statistics 150: Spring 2007

Mathematical Methods for Computer Science

Math 365 Final Exam Review Sheet. The final exam is Wednesday March 18 from 10am - 12 noon in MNB 110.

Random Variable. Discrete Random Variable. Continuous Random Variable. Discrete Random Variable. Discrete Probability Distribution

UNIVERSITY OF YORK. MSc Examinations 2004 MATHEMATICS Networks. Time Allowed: 3 hours.

Statistics 253/317 Introduction to Probability Models. Winter Midterm Exam Monday, Feb 10, 2014

TMA4265 Stochastic processes ST2101 Stochastic simulation and modelling

Things to remember when learning probability distributions:

EXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY

Introduction to Queuing Networks Solutions to Problem Sheet 3

Paper Reference. Paper Reference(s) 6684/01 Edexcel GCE Statistics S2 Advanced/Advanced Subsidiary. Friday 23 May 2008 Morning Time: 1 hour 30 minutes

NEW FRONTIERS IN APPLIED PROBABILITY

Transcription:

SUBJECT NAME : Probability & Queueing Theory SUBJECT CODE : MA 6453 MATERIAL NAME : Part A questions REGULATION : R2013 UPDATED ON : November 2017 (Upto N/D 2017 QP) (Scan the above QR code for the direct download of this material) Name of the Student: Branch: Unit I (Random Variables) 1) A coin is tossed 2 times, if X denotes the number of heads, find the probability distribution of X 2) For a binomial distribution with mean 6 and standard deviation 2, find the first two terms of the distribution 3) Given the probability law of Poisson distribution and also its mean and variance 4) If X and Y are two independent random variables with variances 2 and 3, find the variance of 3X 4Y 5) Obtain the mean for a Geometric random variable 6) If the probability that a target is destroyed on any one shot is 05, find the probability that it would be destroyed on 6 th attempt 7) What is meant by memoryless property? Which continuous and discrete distribution follows this property? 8) State memory less property of exponential distribution 9) Let the random variable X denote the sum obtained in rolling a pair of fair dice Determine the probability mass function of X 10) A continuous random variable X that can assume any value between x 2 and x 5 has a density function given by f ( x) k(1 x) Find px ( 4) Prepared by CGanesan, MSc, MPhil, (Ph: 9841168917, 8939331876) Page 1

11) Test whether x, 1 x 1 f( x) can be the probability density function of a 0, elsewhere continuous random variable 12) Check whether the following is a probability density function or not: x e, x0, 0 f( x) 0, elsewhere 13) A continuous random variable X has the probability density function given by 2 1 x, 1 x 5 f( x) 0, otherwise Find and P X 4 14) A continuous random variable X that can assume any value between x 2 and x 5 has a density function given by f ( x) k(1 x) Find 4 P X 15) A test engineer discovered that the cumulative distribution function of the lifetime of an equipment (in years) is given by 5 F ( x) 1 e, x 0 What is the expected lifetime of the equipment? 16) The cumulative distribution function of the random variable X is given by 0, x 0 1 1 FX x x, 0 x 2 2 1 1, x 2 X Prepared by CGanesan, MSc, MPhil, (Ph: 9841168917, 8939331876) Page 2 x Compute P X 1/ 4 x 1 e for x0 17) If a random variable X has the distribution function F( X), where 0 for x 0 is the parameter, then find P(1 x 2) 18) What do you mean by MGF? Why it is called so? 19) If a random variable has the moment generating function given by determine the variance of X MX 2 () t 2 t, 20) Every week the average number of wrong-number phone calls received by a certain mail order house is seven What is the probability that they will receive two wrong calls tomorrow?

21) If X is a normal random variable with mean 3 and variance 9, find the probability that X has between 2 and 5 Unit II (Two Dimensional Random Variables) 1) The joint pdf of two dimensional random variables XY, is given by y Kxe ;0 x 2, y 0 f ( x, y) Find the value of K 0 ;otherwise 2) The joint pdf of the RV XY, is given by value of K 3) If the joint pdf of XY, is given by (, ) 2 2 2 x y f ( x, y) Kxye, x 0, y 0 Find the f x y, in 0 x y 1, find EX ( ) 4) Let the joint pdf of the random variable XY, be given by 2 2 x y f ( x, y) 4 xye ; x 0 and y 0 Are X and Y independent? Why or why not? 5) The joint probability density function of bivariate random variable XY, is given by f ( x, y) 4 xy, 0 x 1, 0 y 1 0, otherwise Find P X Y 1 (, ) 1 6, 8 6) If X and Y are random variables having the joint density function f x y x y 0 x 2, 2 y 4, find P x y 3 7) Find the value of k, if the joint density function of XY, is given by k(1 x)(1 y), 0 x 4, 1 y 5 f ( x, y) 0, otherwise 8) Let the joint probability density function of random variable X and Y be given by f ( x, y) 8 xy, 0 y x 1 Calculate the marginal probability density function of X 9) Given that joint probability density function of XY, as 1 f ( x, y), 0 x 2, 0 y 3, determine the marginal density 6 Prepared by CGanesan, MSc, MPhil, (Ph: 9841168917, 8939331876) Page 3

10) Comment on the statement: If Cov X, Y 0, then X and Y are uncorrelated 11) Give a real life example each for positive correlation and negative correlation 12) Given the two regression lines 3X 12Y 19, 3Y 9X 46, find the coefficient of correlation between X and Y 13) The regression equations of X on Y and Y on X are respectively 5x y22 and 64x45 y 24 Find the means of X andy 14) When will the two regression lines be (a) at right angles (b) coincident? 15) If there is no linear correlation between two random variables X and Y, then what can you say about the regression lines? 2 x, 0 x1 3 16) Given the RV X with density function f( x) Find the pdfof Y 8X 0, elsewhere Unit III (Random Processes) 1) Define markov process 2) Define Markov Chain and one-step transition probability 3) When is a Markov chain, called homogeneous? 4) Define transition probability matrix 5) Define Strict sense stationary process 6) Define Wide sense stationary process 7) Prove that first order stationary random process has a constant mean 8) Define Poisson process and state any two properties 9) Examine whether the Poisson process xt () is stationary or not 10) Prove that Poisson process is a Markov process 11) Is a Poisson process a continuous time Markov chain? Justify your answer 12) If Nt () is the Poisson process, then what can you say about the time we will wait for the first event to occur? And the time we will wait for the nth event to occur? 13) A radioactive source emits particles at a rate of 5 per min in accordance with Poisson process Each particle emitted has a probability 06 of being recorded Find the probability that 10 particles are recorded in 4 min period Prepared by CGanesan, MSc, MPhil, (Ph: 9841168917, 8939331876) Page 4

14) A gambler has Rs2 He bets Rs1 at a time and wins Rs1 with probability 1/2 He stops playing if he loses Rs2 or wins Rs4 What is the transition probability matrix of the related Markov chain? 15) Consider a random process x( t) cos t uniform variable in 0, 2 16) State Chapman Kolmogorov equations, where is a real constant and is a Show that Xt is not wide sense stationary 17) Consider the Markov chain consisting of the three states 0, 1, 2 and transition probability matrix 1 1 0 2 2 1 1 1 P 2 4 4 it irreducible? Justify 1 2 0 3 3 18) Check whether the Markov chain with transition probability matrix irreducible or not? 19) Define Continuous time random process and Discrete state random process 0 1 0 P 1 / 2 0 1 / 2 is 0 1 0 20) Find the transition probability matrix of the process represented by the state transition diagram 21) If the initial sate probability distribution of a Markov chain is (0) 5 1 p 6 6 and the 0 1 transition probability matrix of the chain is, find the probability distribution of 1 / 2 1 / 2 the chain after 2 steps 0 1 22) If the transition probability matrix (tpm) of a Markov chain is, find the steady 1 / 2 1 / 2 state distribution of the chain Prepared by CGanesan, MSc, MPhil, (Ph: 9841168917, 8939331876) Page 5

Unit IV (Queueing Models) 1) Define steady state and transient state in Queuing theory 2) What are the characteristics of a queuing system? 3) Define Markovian Queueing models 4) Define M/ M/ 2queueing model Why the notation M is used? 5) State Little s formula for a M / M / 1 : GD / N / queuing model 6) Draw the state transition diagram for M/ M/ 1queueing model 7) Draw the state transition rate diagram of an M/ M / c queueing model 8) State the steady state probabilities of the finite source queueing model represented by M / M / R : GD / K / K 9) What is the steady state condition for M/ M / c queueing model? 10) What do the letters in the symbolic representation a / b / c : / represent? d e of a queueing model 11) What is the effective arrival rate for M / M / 1 : 4 / FCFS queueing model? 12) State the relationship between expected number of customers in the queue and in the system 13) Give a real life situation in which (a) customers are considered for service with last in first out queue discipline (b) a system with infinite number of servers 14) A supermarket has a single cashier During peak hours, customers arrive at a rate of 20 per hour The average number of customers that can be serviced by the cashier is 24 per hour Calculate the probability that the cashier is idle 15) Suppose that customers arrive at a Poisson rate of one per every 12 minutes and that the service time is exponential at a rate of one service per 8 minutes What is the average number of customers in the system? and What is the average time of a customer spends in the system? 16) Arrival rate of telephone calls at a telephone booth is according to Poisson distribution with an average time of 9 minutes between two consecutive arrivals The length of a telephone call is assumed to be exponentially distributed with mean 3 minutes Determine the probability that a person arriving at the both will have to wait Prepared by CGanesan, MSc, MPhil, (Ph: 9841168917, 8939331876) Page 6

17) Arrivals at a telephone booth are considered to be Poisson with an average time of 12 mins between one arrival and the next The length of a phone call is assumed to be distributed exponentially with mean 4 mins Find the average number of persons waiting in the system 18) Arrivals at telephone booth are considered to be Poisson with an average time of 10 minutes between one arrival and the next The length of phone calls is assumed to be distributed exponentially with a mean of 3 minutes What is the average length of the queue that forms from time to time? 19) What is the probability that a customer has to wait more than 15 minutes to get his service completed in a M/M/1 queuing system, if 6 per hour and 10 per hour? 20) Trains arrive at the yard every 15 minutes and the service time is 33 minutes If the line capacity of the yard is limited to 4 trains find the probability that the yard is empty Unit V (Advanced Queueing Models) 1) M/G/1 queueing system is Markovian Comment on this statement 2) State Pollaczek Khintchine formula 3) Given that the service time is Erlang with parameters m and Show that the Pollaczek- Khintchine formula reduces to L s 2 m(1 m) m 2(1 m) 4) When a M/G/1 queuing model will become a classic M/M/1 queuing model? 5) State Pollaczek-Khintchine formula for the average number in the system in a M/ G / 1 queueing model and hence derive the same when the service time is constant with mean 1 6) Find the length of the queue for an M/G/1 model if 5, 6 7) Define series queue model 8) Define open network of a queuing system 9) Define closed network of a queuing system 10) Distinguish between open and closed networks 11) Give any two examples for series queuing situations 12) State Jackson s theorem for an open network and 1 20 Prepared by CGanesan, MSc, MPhil, (Ph: 9841168917, 8939331876) Page 7

13) What do you mean by level of multiprogramming in closed queueing network? 14) What do you mean by bottleneck of a network? 15) Consider a tandem queue with 2 independent Markovian servers The situation at server 1 is just as in an M/ M/ 1model What will be the type of queue in server 2? Why? 16) Consider a service facility with two sequential stations with respective service rate of 3/min and 4/min The arrival rate is 2/min What is the average service time of the system, if the system could be approximated by a two stage Tandem queue? ----All the Best---- Prepared by CGanesan, MSc, MPhil, (Ph: 9841168917, 8939331876) Page 8