Decision Science | Chapter 3 | Part 2 | MBA MCQs | DS

Decision Science MCQs

  

 

1. Let C be the expected number of servers in the system ,Cˉ the expected number of serves not busy and C the expected number of servers busy then__________.
   1.   C=C-C.
   2.   C=C+C.
   3.   C=C/C.
   4.   C=C/C.
2. Let λ be an arrival rate of customer in a system, μ be an service rate of the
   system then the expected number of busy servers are _______.
   1.   λ/ μ .
   2.   λ+ μ .
   3.   λ μ.
   4.   None of these
3. The expected waiting time in the system is 10 minutes, and expected waiting
   time in the queue is 5 minutes then the service rate is _______.
   1.   1 /10..
   2.   1/5
   3.   5.
   4.   0.
4. The traffic intensity for M/M/1 system is given by ________.
   1.   p=λ/μ.
      .
   2.   p=μ/λ.
   3.   p=λ μ.
   4.   None of these
5. For M/M/1 queueing system, the expected number of customers in the system are ___.
   1.   L =p/1-p.
   2.   L=1-p/p
   3.   L=1-p.
   4.   None of these.
6. For M/M/1 queueing system, the expected number of customers in the system are_______.
   1.   L= λ / μ-λ.
   2.   L= λ-μ / λ.
   3.   L= μ / μ-λ.
   4.   None of these
7. For M/M/1 queueing system if arrival rate is 10 customers/day and service rate is 30 customers per day then expected number of customers in the queue on a certain day is _________.
   1.   1/3.
      b.
      c. .
      d.
   2.   1/6.
   3.   6
   4.   None of these.
8. If arrival rate is 15 customers per minute and service rate is 30 customers per
   minute, then for M/M/1 queueing system, its traffic intensity is given by__________.
   1.   1/2
   2.   2
   3.   4
   4.   None of these
9. If arrival rate is 20 customers/per week and service rate is 50 customers/week, then the expected number of busy servers for M/M/1 queueing system are
   1.   2/5
   2.   5/2
   3.   5
   4.   None of these
10. For M/M/1 system, the expected waiting time in the queue is ________.
    1.   λ / μ .
    2.   λ / μ(μ-λ).
    3.   None of these
    4.   λ / μ-λ.
11. For M/M/1 model the expected number of busy servers are equal to_______.
    1.   Traffic intensity p .
    2.   Arrival rate λ
    3.   Service rate μ
    4.   None of these .
12. For M/M/1 model the probability that there is no customer in the system is
    ________.
    1.   1.5
    2.   2
    3.   3
    4.   5
13. For M/M/1/N queue modules, if P n is the number of customers in the system
    then ________.
    1.   n=0 for n>N.
    2.   Pn≠0 for n>N
    3.   P n=1 for n>N.
    4.   None of these.
14. When p=1, for M/M/1/N queueing system, expected number of customers in
    the system are__________ .
    1.   N/2.
    2.   None of these
    3.   N .
    4.   N/6.
15. For M/M/1/N system, the expected waiting time in the system for p=1 is
    ________.
    1.   W=N/2 λ
    2.   W=N/2
    3.   W=1/λ
    4.   None of these .
16. Any feasible solution which optimize the objective function of general linear
    programming problem is called an _________________ to that linear
    programming problem.
    1.   Initial basic feasible solution.
    2.   Optimal feasible solution
    3.   None of the above.
    4.   Bounded solution.
17. To find dual of linear programming problem,the primal must be in
    ___________?
    1.   Standard form.
    2.   Canonical form
    3.   With <=, =, >= signs
    4.   None of the above
18. If the dual of the linear programming problem have a finite optimal
    solution,then primal process________?
    1.   Finite optimal solution
    2.   Unbounded solution.
    3.   No solution.
    4.   Infinite solution.
19. In the optimal table of a transportation problem a zero in the south_west corner rule shows that____________?
    1.   An alternate optimal solution exists.
    2.   The optimal solution is degenerated
    3.   None of these.
    4.   (a) and (b) both true.
20. In transportation problem,one of the dual variable is assigned an arbitrary
    value, because_______________?
    1.   Then a solution is obtained immediately.
    2.   One of the constrains is redundant in a transportation problem
    3.   This facilitates construction of the loop.
    4.   None of these.