Q.
No Question
1 A bank has two service counters. Customers arrive according to a Poisson process at a rate of 40 customers
per hour. The service time at each counter is exponentially distributed with a mean of 2 minutes per
customer. Due to space limitations, the system can accommodate at most 5 customers (including those in
service). Customers are served in FIFO order. Find:
1. The average number of customers in the system
2. The average number of customers waiting in the queue
3. The average time a customer spends in the system
4. The average number of customers per hour who are turned away
2 A small pharmacy has one billing counter. Customers arrive randomly according to a Poisson process at an
average rate of 18 customers per hour. The pharmacist takes an exponentially distributed time to serve each
customer, with an average of 2 minutes per customer.
The waiting area has no limit, and customers are served in first-come, first-served (FIFO) order. Determine
the average number of customers in the queue and the average waiting time for people in the queue.
3 A call center has 3 operators. Calls arrive according to a Poisson process at a rate of 12 calls per hour. Each
operator handles calls with exponentially distributed service time, averaging 10 minutes per call.
Find:
1. Average number of calls in system
2. Average number of calls waiting
3. Average waiting time
4. Probability that an arriving call has to wait
4 A small emergency unit has three doctors available for initial check-up. Patients arrive according to a
Poisson process at a rate of 18 patients per hour. Each doctor takes an exponentially distributed time with
mean 8 minutes per patient. The waiting area can hold only 3 patients, so the total system capacity is 6
patients. Patients are treated in FIFO order.
Find:
1. The probability that the system is full
2. The average number of patients in the system
3. The average waiting time in the queue.
5 At a busy shopping mall, there is one automated parking payment booth. Cars arrive according to a Poisson
process at an average rate of 15 cars per hour. The payment time is exponentially distributed with an
average of 3 minutes per car. Due to space constraints, the system can accommodate at most 5 cars in total.
Find:
1. The average number of cars in the system
2. The average waiting time in the system
3. The average number of cars per hour rejected due to full capacity.
6 A bank has 2 ATMs. Customers arrive at a rate of 20 per hour. Each ATM serves customers with mean
time 4 minutes.
Find:
1. Average number in queue
2. Average time in system
3. Probability that system is empty
7 A vehicle inspection station has 4 inspection lanes. Vehicles arrive according to a Poisson process at a rate
of 120 vehicles per hour. Each inspection takes an exponentially distributed time with mean 3 minutes.
The station can hold a maximum of 10 vehicles at a time (including those being inspected). Vehicles are
processed in FIFO order.
Find:
1. The average number of vehicles in the system
2. The average number of vehicles in the queue
3. The average time spent in the system
4. The proportion of vehicles that are denied entry
8 At a small railway station, there is a single ticket counter. Passengers arrive at a rate of 20 per hour
following a Poisson process. The ticket issuing time is exponentially distributed with an average of 2
minutes per passenger. Because of limited space, only 3 passengers can wait in line. Any arriving
passenger finding the system full leaves without joining. Find
1. The probability that the system is full
2. The effective arrival rate
3. The average number of passengers in the system
4. The average waiting time in queue
9 A railway station has 4 ticket counters. Passengers arrive at 60 per hour. Service time averages 3 minutes
per passenger. Find:
1. Average number in system
2. Average waiting time
3. Server utilization
10 At a highway toll plaza, there is only one toll booth open during late-night hours. Vehicles arrive according
to a Poisson process at an average rate of 10 vehicles per minute. The toll operator processes vehicles with
exponentially distributed service times, averaging 5 seconds per vehicle. Determine the probability that a
newly arriving vehicle doesn’t have to wait. Also compute the average waiting time of vehicle in the queue.
11 A petrol station operates with a single fuel nozzle during off-peak hours. Vehicles arrive randomly at a rate
of 10 vehicles per hour. The fueling time is exponentially distributed with an average of 4 minutes per
vehicle. Find
1. The station can hold only 2 vehicles waiting. Vehicles arriving when the system is full leave immediately.
The average number of vehicles in the system
2. The average number of vehicles waiting in queue
3. The average time spent in the system
4. The proportion of vehicles rejected
12 A company has a single IT support executive handling incoming support requests. Requests arrive
randomly at a rate of 6 requests per hour. The support time is exponentially distributed with an average of 8
minutes per request. Compute Ls, Lq, Ws, Wq.