Commonly assumed probability distribution of service pattern are ....................... a. Poisson distribution b. Exponential distribution c. Erlang distribution d. b and c

Commonly assumed probability distribution of service pattern are .......................
a. Poisson distribution
b. Exponential distribution
c. Erlang distribution
d. b and c
by

1 Answer

Answer :

d. b and c
by

Related questions

Commonly assumed probability distribution of arrival pattern is ....................... a. Poisson distribution b. Binomial distribution c. Normal distribution d. None of these

Description : Commonly assumed probability distribution of arrival pattern is ....................... a. Poisson distribution b. Binomial distribution c. Normal distribution d. None of these

Last Answer : a. Poisson distribution

............................is known as father of game theory. a. Von Neumann b. A K Erlang c. George b Dantzig d. Arnoff

Description : ............................is known as father of game theory. a. Von Neumann b. A K Erlang c. George b Dantzig d. Arnoff

Last Answer : a. Von Neumann

..............................was the first person who developed a viable queueing theory a. Von Neumann b. Morgenstern c. H M Wagner d. Simeon Dennis Poisson

Description : ..............................was the first person who developed a viable queueing theory a. Von Neumann b. Morgenstern c. H M Wagner d. Simeon Dennis Poisson

Last Answer : d. Simeon Dennis Poisson

............................refers to the manner in which the customers behave while being in the queue. a. Service pattern b. Service pattern c. Queue discipline d. None of these

Description : ............................refers to the manner in which the customers behave while being in the queue. a. Service pattern b. Service pattern c. Queue discipline d. None of these

Last Answer : c. Queue discipline

In waiting line theory, number of customers waiting in the queue is referred to as ................ a. Traffic intensity b. Queuing system c. Service pattern d. Queue length

Description : In waiting line theory, number of customers waiting in the queue is referred to as ................ a. Traffic intensity b. Queuing system c. Service pattern d. Queue length

Last Answer : d. Queue length

All the parameters in the linear programming model are assumed to be ..................... a. Variables b. Constraints c. Functions d. None of these

Description : All the parameters in the linear programming model are assumed to be ..................... a. Variables b. Constraints c. Functions d. None of these

Last Answer : b. Constraints

Which of the following method is used to solve mixed strategy problems: a. Probability method b. Graphic method c. Linear Programming method d. All of the above

Description : Which of the following method is used to solve mixed strategy problems: a. Probability method b. Graphic method c. Linear Programming method d. All of the above

Last Answer : d. All of the above

In network diagram, events are commonly represented by ......................... a. Arrows b. Nodes c. Triangles d. None of these

Description : In network diagram, events are commonly represented by ......................... a. Arrows b. Nodes c. Triangles d. None of these

Last Answer : b. Nodes

The outlet where the services are being provided to the customers is called................. a. Waiting line b. Service facility c. Idle facility d. Traffic intensity

Description : The outlet where the services are being provided to the customers is called................. a. Waiting line b. Service facility c. Idle facility d. Traffic intensity

Last Answer : b. Service facility

Traffic intensity in Queuing Theory is also called........................... a. Service factor b. Arrival factor c. Utilisation factor d. None of these

Description : Traffic intensity in Queuing Theory is also called........................... a. Service factor b. Arrival factor c. Utilisation factor d. None of these

Last Answer : c. Utilisation factor

Excess of service facilities over and above the number of customers results: a. Idleness of service capacity b. Queues c. Both a and b d. None of these

Description : Excess of service facilities over and above the number of customers results: a. Idleness of service capacity b. Queues c. Both a and b d. None of these

Last Answer : a. Idleness of service capacity

In queuing theory, ............................ stands for mean service rate. a. μ b. λ c. t d. none of these

Description : In queuing theory, ............................ stands for mean service rate. a. μ b. λ c. t d. none of these

Last Answer : a. μ

The ration between mean arrival rate and mean service rate is called ................... a. Idle period b. Average length of queue c. Traffic intensity d. None of these

Description : The ration between mean arrival rate and mean service rate is called ................... a. Idle period b. Average length of queue c. Traffic intensity d. None of these

Last Answer : c. Traffic intensity

In queuing theory, ...................... is a person by whom service is rendered. a. Customer b. Server c. a or b d. none of these

Description : In queuing theory, ...................... is a person by whom service is rendered. a. Customer b. Server c. a or b d. none of these

Last Answer : b. Server

In queuing theory, ...................... refers to those waiting in a queue or receiving service. a. Service provider b. Customer c. Both a and b d. None of these

Description : In queuing theory, ...................... refers to those waiting in a queue or receiving service. a. Service provider b. Customer c. Both a and b d. None of these

Last Answer : b. Customer

A queue is formed when the demand for a service: a. Exceeds the capacity to provide that service b. Is less than the capacity to provide that service c. a or b d. None of these

Description : A queue is formed when the demand for a service: a. Exceeds the capacity to provide that service b. Is less than the capacity to provide that service c. a or b d. None of these

Last Answer : a. Exceeds the capacity to provide that service

The O R technique which helps in minimising total waiting and service cost is: a. Game theory b. Queuing theory c. Both a and b d. Decision theory

Description : The O R technique which helps in minimising total waiting and service cost is: a. Game theory b. Queuing theory c. Both a and b d. Decision theory

Last Answer : b. Queuing theory

Statistics question on Poisson distribution?

Description : Statistics question on Poisson distribution?

Last Answer : It's been a while, but I recall the Poisson distribution as being more useful in queuing theory. I also recall that it's more useful when you are talking about discrete, rather than continuous intervals. ... have been able to give you a better answer. However, here's Mathworld's page on the subject.

Which distribution has same mean, median and mode? a. Poisson distribution b. Gaussian distribution c. Binomial distribution d. Abnormal distribution

Description : Which distribution has same mean, median and mode? a. Poisson distribution b. Gaussian distribution c. Binomial distribution d. Abnormal distribution

Last Answer : b. Gaussian distribution

In an Ethernet local area network, which one of the following statements is TRUE ? a. A station stops to sense the channel once it starts transmitting a frame. b. The purpose of the jamming signal is to pad the frames that are smaller than the minimum frame size. c. A station continues to transmit the packet even after the collision is detected. d. The exponential backoff mechanism reduces the probability of collision on retransmissions

Description : In an Ethernet local area network, which one of the following statements is TRUE ? a. A station stops to sense the channel once it starts transmitting a frame. b. The purpose ... collision is detected. d. The exponential backoff mechanism reduces the probability of collision on retransmissions

Last Answer : The exponential backoff mechanism reduces the probability of collision on retransmissions

If a simplex table shows the values 2, -3, 0 against “θ”, which should be taken as the replacement ratio. a. 2 b. -3 c. 0 d. None of these

Description : If a simplex table shows the values 2, -3, 0 against “θ”, which should be taken as the replacement ratio. a. 2 b. -3 c. 0 d. None of these

Last Answer : c. 0

Controllable variables are also called.................................. a. Slack variables b. Surplus variables c. Artificial variable d. Decision variables

Description : Controllable variables are also called.................................. a. Slack variables b. Surplus variables c. Artificial variable d. Decision variables

Last Answer : d. Decision variables

The variables which cannot be manipulated by the decision maker are called.................... a. Controllable variables b. Uncontrollable variables c. Both a and b d. None of these

Description : The variables which cannot be manipulated by the decision maker are called.................... a. Controllable variables b. Uncontrollable variables c. Both a and b d. None of these

Last Answer : b. Uncontrollable variables

The variables which can be manipulated by the decision maker are called.................... a. Controllable variables b. Uncontrollable variables c. Both a and b d. None of these

Description : The variables which can be manipulated by the decision maker are called.................... a. Controllable variables b. Uncontrollable variables c. Both a and b d. None of these

Last Answer : a. Controllable variables

.................... is the popular method for solving an assignment problem. a. Hungarian Method b. Enumeration Method c. Simplex Method d. None of the above

Description : .................... is the popular method for solving an assignment problem. a. Hungarian Method b. Enumeration Method c. Simplex Method d. None of the above

Last Answer : a. Hungarian Method

Hungarian method was developed by ........................ a. T C Koopman b. F L Hitchcock c. D Konig d. George B Dantzig

Description : Hungarian method was developed by ........................ a. T C Koopman b. F L Hitchcock c. D Konig d. George B Dantzig

Last Answer : c. D Konig

Which of the following methods is used to solve an assignment problem: a. Enumeration Method b. Hungarian Method c. Simplex Method d. All of the above

Description : Which of the following methods is used to solve an assignment problem: a. Enumeration Method b. Hungarian Method c. Simplex Method d. All of the above

Last Answer : d. All of the above

VAM is also called........................ a. Matrix Minima Method b. Penalty Method c. MODI Method d. None of these

Description : VAM is also called........................ a. Matrix Minima Method b. Penalty Method c. MODI Method d. None of these

Last Answer : b. Penalty Method

Transportation model was first introduced by ........................ in the year 1941. a. T C Koopman b. George B Dantzig c. Von-neumann d. F L Hitchcock

Description : Transportation model was first introduced by ........................ in the year 1941. a. T C Koopman b. George B Dantzig c. Von-neumann d. F L Hitchcock

Last Answer : d. F L Hitchcock

................................is that element of the simplex table which lis both in the key row and key column. a. Key element b. Pivot element c. Both a and b d. None of these

Description : ................................is that element of the simplex table which lis both in the key row and key column. a. Key element b. Pivot element c. Both a and b d. None of these

Last Answer : c. Both a and b

Shadow price is also called ...................... a. Dual price b. Unit price c. Total cost d. None of these

Description : Shadow price is also called ...................... a. Dual price b. Unit price c. Total cost d. None of these

Last Answer : a. Dual price

Which of the following is a characteristic of a dual problem: a. Dual of a dual is primal b. If dual has a finite optimal solution, then the primal also has finite optimal solution c. If dual has no feasible solution, then the primal also has no feasible solution d. All of the above

Description : Which of the following is a characteristic of a dual problem: a. Dual of a dual is primal b. If dual has a finite optimal solution, then the primal also has finite optimal solution c. If dual has no feasible solution, then the primal also has no feasible solution d. All of the above

Last Answer : d. All of the above

Game theory became popular when the book “Theory of Games and Economic Behaviour” was published in 1944 by .............................. a. Von Neumann b. Mc Closky c. Von-Neumann and Mc Closky d. Von-neumann and Morgenstern

Description : Game theory became popular when the book “Theory of Games and Economic Behaviour” was published in 1944 by .............................. a. Von Neumann b. Mc Closky c. Von-Neumann and Mc Closky d. Von-neumann and Morgenstern

Last Answer : d. Von-neumann and Morgenstern

Traffic intensity is computed by using the formula: a. λ/μ b. μ/λ c. 1- λ/μ d. 1- μ/λ

Description : Traffic intensity is computed by using the formula: a. λ/μ b. μ/λ c. 1- λ/μ d. 1- μ/λ

Last Answer : a. λ/μ

MODI Method to test the optimality of a feasible solution to TP is also called............... a. Stepping Stone Method b. u. v. Method c. both a and b d. none of these

Description : MODI Method to test the optimality of a feasible solution to TP is also called............... a. Stepping Stone Method b. u. v. Method c. both a and b d. none of these

Last Answer : b. u. v. Method

Matrix Minima Method to find initial feasible solution to a TP is also called ....................... a. NWCM b. LCM c. VAM d. None of these

Description : Matrix Minima Method to find initial feasible solution to a TP is also called ....................... a. NWCM b. LCM c. VAM d. None of these

Last Answer : c. VAM

In Transportation Problem, LCM stands for ............................. a. Lowest Common Multiplier b. Least Cost Method c. Lowest Cell Method d. None of these

Description : In Transportation Problem, LCM stands for ............................. a. Lowest Common Multiplier b. Least Cost Method c. Lowest Cell Method d. None of these

Last Answer : b. Least Cost Method

In Transportation Problem, NWCM stands for ............................. a. North West Cost Method b. Net Worth Corner Method c. North West Corner Method d. None of these

Description : In Transportation Problem, NWCM stands for ............................. a. North West Cost Method b. Net Worth Corner Method c. North West Corner Method d. None of these

Last Answer : c. North West Corner Method

Initial feasible solution to a transportation problem arrived through which of the following method is very near to the optimal solution: a. NWCM b. LCM c. VAM d. None of these

Description : Initial feasible solution to a transportation problem arrived through which of the following method is very near to the optimal solution: a. NWCM b. LCM c. VAM d. None of these

Last Answer : c. VAM

In queuing theory, FCFS stand for .............................. a. First Cum First Served b. First Customer Fist Served c. Fast Channel First Served

Description : In queuing theory, FCFS stand for .............................. a. First Cum First Served b. First Customer Fist Served c. Fast Channel First Served

Last Answer : a. First Cum First Served

...................... is a method of analysing the current movement of the some variable in an effort to predict the future movement of the same variable. a. Goal programming b. Queuing theory c. Markov Analysis d. Replacement theory

Description : ...................... is a method of analysing the current movement of the some variable in an effort to predict the future movement of the same variable. a. Goal programming b. Queuing theory c. Markov Analysis d. Replacement theory

Last Answer : c. Markov Analysis

In queuing theory, ............................ stands for mean arrival rate of customers. a. μ b. λ c. t d. none of these

Description : In queuing theory, ............................ stands for mean arrival rate of customers. a. μ b. λ c. t d. none of these

Last Answer : b. λ

A customer’s behaviour of jumping from one queue to another is called ............................ a. Jockying b. Reneging c. Collusion d. Balking

Description : A customer’s behaviour of jumping from one queue to another is called ............................ a. Jockying b. Reneging c. Collusion d. Balking

Last Answer : a. Jockying

A customer’s behaviour of leaving the queue due to impatience is called ....................... a. Jockying b. Reneging c. Collusion d. Balking

Description : A customer’s behaviour of leaving the queue due to impatience is called ....................... a. Jockying b. Reneging c. Collusion d. Balking

Last Answer : b. Reneging

a customer’s behaviour of leaving the queue when he does not like to wait in the queue due to lack of time or space is called ..................... a. Jockying b. Reneging c. Collusion d. Balking

Description : a customer’s behaviour of leaving the queue when he does not like to wait in the queue due to lack of time or space is called ..................... a. Jockying b. Reneging c. Collusion d. Balking

Last Answer : d. Balking

Number of customers in the queue per unit of time is called ...................... a. Queuing system b. Length of queue c. Average length of queue d. None of these

Description : Number of customers in the queue per unit of time is called ...................... a. Queuing system b. Length of queue c. Average length of queue d. None of these

Last Answer : c. Average length of queue

Queuing theory is also termed as ............................ a. Game theory b. Replacement theory c. Waiting line theory d. None of these

Description : Queuing theory is also termed as ............................ a. Game theory b. Replacement theory c. Waiting line theory d. None of these

Last Answer : c. Waiting line theory

In a ........................game the amounts won by all winners together is equal to the sum of the amounts lost by all losers together. a. Non-zero sum game b. Zero sum game c. Rectangular game d. None of these

Description : In a ........................game the amounts won by all winners together is equal to the sum of the amounts lost by all losers together. a. Non-zero sum game b. Zero sum game c. Rectangular game d. None of these

Last Answer : b. Zero sum game

A game is said to be fair if the value of the game is......................... a. One b. Two c. Three d. Zero

Description : A game is said to be fair if the value of the game is......................... a. One b. Two c. Three d. Zero

Last Answer : d. Zero

The position in the pay off matrix where the maximin coincides with the minimax. a. Saddle point b. Break even point c. Pivot point d. None of the above

Description : The position in the pay off matrix where the maximin coincides with the minimax. a. Saddle point b. Break even point c. Pivot point d. None of the above

Last Answer : a. Saddle point