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

Decision Science MCQs

  

 

1. In an assignment problem involving 5 workers and 5 jobs, total number of assignments possible are
   _______.
   1.   5
   2.   10
   3.   15
   4.   20
2. In marking assignments, which of the following should be preferred?
   1.   Only row having single zero
   2.   Only row/column having single zero
   3.   Column having more than one zero
   4.   Only column having single zero
3. The average arrival rate in a single server queuing system is 10 customers per hour and average service
   rate is 15 customers per hour. The average time that a customer must wait before it is taken up for service
   shall be _______minutes
   1.   6
   2.   8
   3.   10
   4.   12
4. Customers arrive at a box office window, being manned ny single individual, according to Poisson input process with mean rate of 20 per hour, while the mean service time is 2 minutes. Which of the following is not true for this system?
   1.   E(n) = 2 customers
   2.   E(m) = 4/3 customers
   3.   E(m) = 4/3 customers
   4.   E(w) = 16 minutes
5. A petrol pump has two pumps; Vehicles arrive at the petrol pump according to poison input process at
   average of 12 per hour. The service time follows exponential distribution with a mean of 4 minutes. The
   pumps are expected to be idle for _____.
   1.   33%
   2.   53%
   3.   65%
   4.   43%
6. A game is said to be fair if_________.
   1.   lower and upper values are zero
   2.   only lower value to be zero
   3.   only upper value to be zero
   4.   lower and upper values are not equal to zero
7. In Program Evaluation Review Technique the maximum time that is required to perform the activity under extremely bad conditions is known as_____.
   1.   normal time
   2.   optimistic time
   3.   most likely time
   4.   pessimistic time
8. _____is a mathematical technique used to solve the problem of allocating limited resource among the
   competing activities
   1.   Linear Programming problem
   2.   Assignment Problem
   3.   Replacement Problem
   4.   Non linear Programming Problem
9. A game is said to be strictly determinable if________.
   1.   maximin value equal to minimax value
   2.   maximin value is less than or equal to minimax value
   3.   maximin value is greater than or equal to minimax value
   4.   maximin value is not equal to minimax value
10. A mixed strategy game can be solved by ____.
    1.   Simplex method
    2.   Degeneracy
    3.   Graphical method
    4.   Hungarian method
11. When the sum of gains of one player is equal to the sum of losses to another player in a game, this
    situation is known as_____.
    1.   two-person game
    2.   two-person zero-sum game
    3.   zero-sum game
    4.   non-zero-sum game
12. Graphical method of linear programming is useful when the number of decision variable are _______
    1.   2
    2.   3
    3.   4
    4.   5
13. The activity cost corresponding to the crash time is called the _____.
    1.   critical time
    2.   normal time
    3.   cost slope
    4.   crash cost
14. The irreducible minimum duration of the project is called______.
    1.   critical time
    2.   normal time
    3.   cost slope
    4.   crash duration
15. In the network, one activity may connect any _______nodes
    1.   1
    2.   2
    3.   3
    4.   4
16. The application of OR techniques involves ………… approach
    1.   Individual
    2.   Team
    3.   Critical
    4.   None of the above
17. The mathematical technique for finding the best use of limited resources of a company in a maximum manner is known as:
    1.   Value analysis
    2.   Investment analysis
    3.   Linear programming
    4.   Queuing theory
18. Management science and operations research both involve
    1.   Qualitative managerial skills
    2.   Quantitative approaches to decision making
    3.   Operational management skills
    4.   Scientific research as opposed to applications
19. The quantitative analysis approach requires
    1.   the manager's prior experience with a similar problem
    2.   a relatively uncomplicated problem
    3.   mathematical expressions for the relationships
    4.   each of the above is true
20. Which of the following is not the characteristics of the LPP
    1.   Resources must be limited
    2.   Only one objective function
    3.   The problem must be of minimization type
    4.   Parameters value remains constant during planning period