Bissoy.com
Doctors Medicines MCQs Q&A

In a service centre, cars arrive according to Poisson distribution with a mean of two cars per hour. The time of servicing a car is exponential with a mean of 15 minutes. The expected waiting time (in minute) in the queue is

In a service centre, cars arrive according to Poisson distribution with a mean of two cars per hour. The time of servicing a car is exponential with a mean of 15 minutes. The expected waiting time (in minute) in the queue is Correct Answer 15

Related Questions

There are 5 people A, B, C, D, and E, having different cars Polo, Verna, Alto, Wagon R and Jeep. They were visiting on different day of the week to service center. No car gets it’s servicing done on Monday and Sunday. C is having Wagon R and visit service center on Friday. B don’t have Jeep. A visits service center on Tuesday. Polo gets it’s servicing done on Saturday. No person gets servicing done between A and D. B don’t have Polo car. Car alto gets serviced between Verna and Jeep. On which day Alto gets servicing and also determine who’s having Jeep?
In an opencast mine, dumpers arrive at a shovel location with an average arrival rate of 12 per/hour. The inter-arrival times of the dumpers follow an exponential distribution. The service times of the shovel also follow an exponential distribution with an average of 3 minute. The average waiting time of a dumper in the queue in minutes is
The cost of servicing of a Maruti car at Maruti care Pvt. Ltd. is Rs. 400. Manager of service centre told me that for the second service within a year a customer can avail a 10% discount and further for third and fourth servicing he can avail 10% discount of the previous amount paid, within a year. Further if a customer gets more than 4 services within a year, he has to pay just 60% of the servicing charges on these services. A customer availed 5 services from the same servicing station, what is the total percentage discount fetched by the customer?
A company sold six different cars Swift, Santro, Creta, Audi, I10 and Magna during a period of Monday to Saturday. Only one car was sold on a particular day. No car was sold twice. Atleast four cars were sold after the car Santro. The car Magna was sold on Tuesday. The car Audi was sold immediately after the car Creta and car Creta was sold atleast before three cars. Both the cars Santro and I10 were sold atleast before one car. On which day was Swift car sold?
Three cars start from point A together and reach point B at equal intervals. Second car whose sped is less than third car but more than first car taken a u turn and starts its journey towards A whereas third car heads for point C which is 100 km away from point B. First car and third car meet each other at mid way of A and C after third car takes u turn from C. First car travels half the distance between A and B when second reaches B. The sum of speed of second car and third car is 100 kmh.  What is the difference between speed of third car and first car?
Each of the question below consists of a question and three statements number I, II and III given below it. You have to decide whether the data provided in the statement are sufficient to answer the question. If the bus is travelling from Surat to Ahmadabad and a car is travelling from Ahmadabad to Surat, then what is the distance between Surat and Ahmadabad? I. The speed of a car is 40% less than the speed of bus. Bus started at 9 am and car started at 10 am and they meet at 3 pm of the same day. II. After travelling for 1 hour, because of traffic average speed of bus is decreased by 20% and covers distance between Surat to Ahmadabad in 11 hours. Original speed of car is 20% less than original speed of bus and before crossing bus it covered 200 km if starts 1 hour later than bus. After crossing car, bus covers remaining distance in 5 hours. III. Speed of bus is 10 km/hr more than the speed of car and before crossing car ratio of distances covered bus and car in same time was 5 : 4. Time taken by car to cover the distance between Ahmadabad and Surat is 2 hours 15 minutes more than time taken by bus to cover the same distance.
In an opencast mine loading and transporting has been carried out by shovel dumper combination. There is only one shovel is in operation. Dumpers arrive at the rate of 10 dumpers per hour and it takes shovel on an average 5 minutes to load a dumper. Assume arrival is Poisson and service time is exponentially distributed. What is expected waiting time of the dumper in the queue?
Seven people A, B, C, D, E, F and G live on separate floors of a 7-floor building. Ground floor is numbered 1, first floor is numbered. 2 and so on until the topmost floor is numbered 7. Each one of these having a different cars-Cadillac, Ambassador, Fiat, Maruti, Mercedes, Bedford and Fargo but not necessarily in the same order. Only three people live above the floor on which A lives. Only one person lives between A and the one having a car Cadillac. F lives immediately below the one having a car Bedford. The one having a car Bedford lives on an even-numbered floor. Only three people live between the ones having a car Cadillac and Maruti. E lives immediately above C. E is not having a car Maruti. Only two people live between B and the one having a car Fargo. The one having a car Fargo lives below the floor on which B lives. The one having a car Fiat does not live immediately above D or immediately below B. D does not live immediately above or immediately below A. G does not have a car Ambassador. Question : How many people live between the floors on which D and the one having a car Bedford ?
A double-ended queue supports operations like adding and removing items from both the sides of the queue. They support four operations like addFront(adding item to top of the queue), addRear(adding item to the bottom of the queue), removeFront(removing item from the top of the queue) and removeRear(removing item from the bottom of the queue). You are given only stacks to implement this data structure. You can implement only push and pop operations. What’s the time complexity of performing addFront and addRear? (Assume ‘m’ to be the size of the stack and ‘n’ to be the number of elements)
A Double-ended queue supports operations such as adding and removing items from both the sides of the queue. They support four operations like addFront(adding item to top of the queue), addRear(adding item to the bottom of the queue), removeFront(removing item from the top of the queue) and removeRear(removing item from the bottom of the queue). You are given only stacks to implement this data structure. You can implement only push and pop operations. What are the total number of stacks required for this operation?(you can reuse the stack)