# Question: The traffic managers of toll roads and toll bridges need

The traffic managers of toll roads and toll bridges need specific information to properly staff the toll booths so that the queues are minimized (i. e., the waiting time is minimized).

(a) Assume that there is one toll booth on a busy interstate highway and that the number of cars per minute approaching the toll booth follows a Poisson PMF with a = 10. The traffic manager wants you to determine the probability that exactly 11 cars approach this toll booth in the minute from noon to 1 min past noon.

(b) Now assume that there are toll booths at a toll plaza and that the number of cars per minute approaching the plaza follows the same Poisson PMF with a = 30. The traffic manager wants you to calculate the minimum number of toll booths that need to be staffed if the probability that more than five cars approach any toll booth in one minute is no more than 0.05. For this part, assume the traffic approaching the plaza divides evenly among the N booths such that the traffic approaching each booth is independent and follows a Poisson PMF with a = 30 / N.

(a) Assume that there is one toll booth on a busy interstate highway and that the number of cars per minute approaching the toll booth follows a Poisson PMF with a = 10. The traffic manager wants you to determine the probability that exactly 11 cars approach this toll booth in the minute from noon to 1 min past noon.

(b) Now assume that there are toll booths at a toll plaza and that the number of cars per minute approaching the plaza follows the same Poisson PMF with a = 30. The traffic manager wants you to calculate the minimum number of toll booths that need to be staffed if the probability that more than five cars approach any toll booth in one minute is no more than 0.05. For this part, assume the traffic approaching the plaza divides evenly among the N booths such that the traffic approaching each booth is independent and follows a Poisson PMF with a = 30 / N.

## Answer to relevant Questions

A sequence of zero mean unit variance independent random variables, Xn, n = 0, 1, 2, …, N – 1 are input to a filter that produces an output sequence according to Yn = (Xn + Xn – 1)/ 2, for . For n = 0, 1, 2 … N – ...A radio astronomer is attempting to measure radio frequency (RF) emmisions from a certain star. However, these emissions are corrupted by a variety of independent noise sources including thermal noise in his receiving ...A random vector is generated by rolling a die and observing the outcome. The components of the random vector are determined by successive rolls of the die. If the die is rolled two times: (a) List the possible realizations ...Suppose Xk is a sequence of zero- mean Gaussian random variables with co-variances described by Cov (Xk, Xm) =ρ |k– m| for some |ρ| < 1. Form the sequence of sample means In this case we are forming the sequence of ...A communication system transmits bits over a channel such that the probability of being received in error is ρ = 0.02. Bits are transmitted in blocks of length 1023 bits and an error correction scheme is used such that bit ...Post your question