Queuing Theory MCQs & Quiz Online PDF Download

Queuing theory MCQs, queuing theory quiz answers pdf to study online computer architecture course. Learn storage systems Multiple Choice Questions and Answers (MCQs), "queuing theory" quiz questions and answers for 2 year computer science degree. Learn storage systems test prep for top computer science schools in the world.

"The times between two successive requests arriving, called the" Multiple Choice Questions (MCQ) on queuing theory with choices interarrival time, arrival time, poisson distribution, and average residual service time for 2 year computer science degree. Practice merit scholarships assessment test, online learning queuing theory quiz questions for competitive exams in computer science major for CS major.

MCQs on Queuing Theory PDF Download

MCQ: The times between two successive requests arriving, called the

  1. Interarrival time
  2. Arrival time
  3. Poisson distribution
  4. Average residual service time

A

MCQ: The average residual service time, which again assumes Poisson arrivals as:

  1. Average residual service time= 1/Arithemtic mean+(1+ C^2)
  2. Average residual service time= 2xArithemtic mean+(1+ C^2)
  3. Average residual service time=1/ 2xArithemtic mean+(1+ C^2)
  4. Average residual service time=1/ 2xArithemtic meanx(1+ C^2)

C

MCQ: Exponential distribution, is such a distribution ehich has a C, of value

  1. 0
  2. 1
  3. 2
  4. 3

B

MCQ: An I/O system with a single disk gets on average 50 I/O requests per second and the average time for a disk to service an I/O request is 10 ms, the utilization of the I/O system would be

  1. 0.2
  2. 0.5
  3. 0.75
  4. 1.5

B

MCQ: One of the most widely used exponential distributions is called a

  1. Passion distribution
  2. Possible distribution
  3. Poisson distribution
  4. Poisson association

C