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

Decision Science MCQs

  

 

1. Priority queue discipline may be classified as__________.
   1.   pre-emptive or non-pre-emptive
   2.   limited
   3.   unlimited
   4.   finite
2. The calling population is assumed to be infinite when______.
   1.   capacity of the system is infinite
   2.   arrivals are independent of each other
   3.   all customers arrive at once
   4.   service rate is faster than arrival rate
3. Service mechanism in a queuing system is characterized by_____.
   1.   customers behavior
   2.   customers in the system
   3.   server in the system
   4.   servers behavior
4. The problem of replacement is felt when job performing units fail_____.
   1.   suddenly and gradually
   2.   gradually
   3.   suddenly
   4.   neither gradually nor suddenly
5. Replace an item when________.
   1.   average cost upto date is equal to the current maintenance cost
   2.   average cost upto date is less than the current maintenance cost.
   3.   next year running cost in more than average cost of nth year
   4.   average cost upto date is greater than the current maintenance cost
6. The group replacement policy is suitable for identical low cost items which are likely to_________.
   1.   fail suddenly
   2.   fail over a period of time
   3.   be progressive and retrogressive
   4.   fail completely and suddenly
7. The objective of network analysis is to___________.
   1.   maximize total project duration
   2.   minimize toal project cost
   3.   minimize production delays, interruption and conflicts
   4.   minimize total project duration
8. If an activity has zero slack, it implies that_________.
   1.   the project is progressing well
   2.   it is a dummy activity
   3.   it lies on the critical path
   4.   it lies a non critical path
9. In program evaluation review technique network each activity time assume a beta distribution
   because_________.
   1.   it is a unimodal distribution that provides information regarding the uncertainty of time estimates of
      activities
   2.   it has got finite non-negative error
   3.   it need not be symmetrical about model value
   4.   the project is progressing well
10. Float analysis is useful for________.
    1.   total float
    2.   free float
    3.   independent float
    4.   variance of each float
11. In time cost trade off function analysis_________.
    1.   cost decreases linearly as time increases
    2.   cost increases linearly as time decreases
    3.   cost at normal time is zero
    4.   cost increases linearly as time increases
12. A degenerate solution is one that ________.
    1.   gives an optimum solution to the Linear Programming Problem
    2.   yields more than one way to achieve the objective
    3.   makes use of all the available resources
    4.   gives zero value to one or more of the basic variables
13. If there is no non-negative replacement ratio in solving a Linear Programming Problem then the
    solution is ____.
    1.   feasible
    2.   infinite
    3.   bounded
    4.   unbounded
14. The difference between free float and tail event slack is ______
    1.   total float
    2.   slack
    3.   interference float
    4.   independent float
15. The transportation problem deals with the transportation of ________.
    1.   single product from a source to several destinations
    2.   a single product from several sources to several destinations
    3.   a single product from several sources to a destination
    4.   a multi -product from several sources to several destinations
16. The transportation problem is balanced, if _______.
    1.   total demand and total supply are equal and the number of sources equals the number of destinations.
    2.   none of the routes is prohibited
    3.   total demand equals total supply irrespective of the number of sources and destinations
    4.   number of sources matches with number of destinations
17. The calling population is considered to be infinite when ________.
    1.   all customers arrive at once
    2.   capacity of the system is infinite
    3.   service rate is faster than arrival rate
    4.   arrivals are independent of each other
18. The assignment problem is a special case of transportation problem in which ______.
    1.   number of origins are less than the number of destinations
    2.   number of origins are greater than or equal to the number of destinations
    3.   number of origins are greater than the number of destinations
    4.   number of origins equals the number of destinations
19. Identify the correct statement
    1.   an assignment problem may require the introduction of both dummy row and dummy column
    2.   an unbalanced assignment is one where the number of rows is more than, or less than the number of
       columns
    3.   an assignment problem with m rows and n columns will involves a total of m x n possible
       assignments
    4.   balancing any unbalanced assignment problem involves adding one dummy row or column
20. The minimum number of lines covering all zeros in a reduced cost matrix of order n can be _____.
    1.   at the most n
    2.   at the least n
    3.   n-1
    4.   n+1