Queueing Theory

This quiz covers the fundamental concepts and techniques of Queueing Theory, a branch of mathematics that deals with the analysis of queues and waiting lines.

15 Questions Published

Questions

Question 1 Multiple Choice (Single Answer)

In a single-server queueing system, the arrival rate of customers is 10 per hour and the service rate is 15 per hour. What is the average number of customers in the system?

  1. 5
  2. 10
  3. 15
  4. 20
Question 2 Multiple Choice (Single Answer)

In a multi-server queueing system with 3 servers, the arrival rate of customers is 12 per hour and the service rate per server is 5 per hour. What is the average waiting time for a customer?

  1. 1 hour
  2. 2 hours
  3. 3 hours
  4. 4 hours
Question 3 Multiple Choice (Single Answer)

Which probability distribution is commonly used to model the inter-arrival times of customers in a queueing system?

  1. Poisson distribution
  2. Exponential distribution
  3. Normal distribution
  4. Uniform distribution
Question 4 Multiple Choice (Single Answer)

In a queueing system, the average number of customers in the system is 10 and the average waiting time is 2 minutes. What is the arrival rate of customers?

  1. 5 per minute
  2. 10 per minute
  3. 15 per minute
  4. 20 per minute
Question 5 Multiple Choice (Single Answer)

Which queueing discipline assigns customers to servers based on the order in which they arrive?

  1. First-Come-First-Served (FCFS)
  2. Last-Come-First-Served (LCFS)
  3. Shortest-Job-First (SJF)
  4. Round-Robin
Question 6 Multiple Choice (Single Answer)

In a queueing system with multiple servers, which load balancing algorithm distributes customers evenly among the servers?

  1. Round-Robin
  2. Weighted Round-Robin
  3. Least-Connection
  4. Shortest-Queue
Question 7 Multiple Choice (Single Answer)

Which queueing model is used to analyze a system with a single server and an infinite queue capacity?

  1. M/M/1
  2. M/M/c
  3. M/G/1
  4. G/M/1
Question 8 Multiple Choice (Single Answer)

In a queueing system, what is the probability that a customer will have to wait for service?

  1. P(W > 0)
  2. P(W < 0)
  3. P(W = 0)
  4. P(W = \infty)
Question 9 Multiple Choice (Single Answer)

Which queueing model is appropriate for a system with multiple servers and a finite queue capacity?

  1. M/M/1
  2. M/M/c
  3. M/G/1
  4. G/M/c
Question 10 Multiple Choice (Single Answer)

In a queueing system, what is the utilization factor?

  1. \rho = \lambda / \mu
  2. \rho = \mu / \lambda
  3. \rho = L / \lambda
  4. \rho = W / \lambda
Question 11 Multiple Choice (Single Answer)

Which queueing model is suitable for a system with general arrival and service time distributions?

  1. M/M/1
  2. M/M/c
  3. M/G/1
  4. G/M/1
Question 12 Multiple Choice (Single Answer)

In a queueing system, what is the average time a customer spends in the system?

  1. T = L / \lambda
  2. T = W + 1 / \mu
  3. T = L / \mu
  4. T = W + \lambda / \mu
Question 13 Multiple Choice (Single Answer)

Which queueing discipline prioritizes customers based on their job size or urgency?

  1. First-Come-First-Served (FCFS)
  2. Last-Come-First-Served (LCFS)
  3. Shortest-Job-First (SJF)
  4. Round-Robin
Question 14 Multiple Choice (Single Answer)

In a queueing system, what is the probability that the system is empty?

  1. P(N = 0)
  2. P(N > 0)
  3. P(N < 0)
  4. P(N = \infty)
Question 15 Multiple Choice (Single Answer)

Which queueing model is used to analyze a system with multiple servers and a general service time distribution?

  1. M/M/1
  2. M/M/c
  3. M/G/c
  4. G/M/c