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

Decision Science MCQs

  

 

1. To use the Hungarian method, a profit-maximization assignment problem requires
   1.   matrix expansion.
   2.   converting all profits to opportunity losses.
   3.   dummy agent or task.
   4.   finding the maximum number of lines to cover all the zeros in the reduced matrix.
2. The critical path
   1.   is any path that goes from the starting node to the completion node.
   2.   is a combination of all paths.
   3.   is the longest path.
   4.   is the shortest path.
3. When activity times are uncertain,
   1.   assume they are normally distributed..
   2.   Calculate the expected time, using (a + m + b)/3
   3.   use the most likely time.
   4.   calculate the expected time, using (a + 4m + b)/6.
4. The critical path is the __________ path through the network.
   1.   longest
   2.   shortest
   3.   straightest
   4.   none of the above
5. In a CPM/PERT network the critical path is the
   1.   lowest path through the network
   2.   longest path through the network
   3.   shortest path through the network
   4.   highest path through the network
6. The transportation model relies on certain assumptions. They include all of the following except
   1.   the items must be homogeneous
   2.   there is only one route being used between each origin and destination
   3.   the shipping cost per unit is the same
   4.   the items must be large scale
7. Which of the following are supply points that a transportation model can analyze?
   1.   Factories
   2.   warehouses
   3.   departments
   4.   all of the above
8. event represents beginning of more than one activities
   1.   burst
   2.   none of them
   3.   merge
   4.   dummy
9. Merge event represents of two or more events
   1.   beginning
   2.   completion
   3.   none of them
   4.   splitting
10. Activity which is completed before starting new activity is called .
    1.   dummy
    2.   predecessor
    3.   none of them
    4.   successor
11. The Objective of network analysis to
    1.   Minimize total project duration.
    2.   Minimize total project cost
    3.   Minimize production delays, interruption and conflicts
    4.   All of the above
12. Network models have advantage in terms of project
    1.   Planning
    2.   All of the above
    3.   Scheduling
    4.   Controlling
13. The slack for an activity is equal to
    1.   LF-LS
    2.   LS-ES
    3.   EF-ES
    4.   None of the above
14. The Another term commonly used for activity slack time is
    1.   Total float
    2.   Free float
    3.   All of the above
    4.   independent float
15. If an activity has zero slack, it implies that
    1.   It lies on the critical path
    2.   It is a dummy activity
    3.   The project progressing well
    4.   None of the above
16. A dummy activity is used in the network diagram when
    1.   Two parallel activities have the same tail and head events
    2.   The chain of activities may have a common event yet be independent by themselves
    3.   None of the above
    4.   Both A and B
17. While drawing the network diagram , for each activity project, we should look
    1.   What activities precede this activity?
    2.   What activities follow this activity?
    3.   What activities can take place concurrently with this activity?
    4.   All of the above
18. The critical path satisfy the condition that
    1.   Ei = Li & E j = Lj
    2.   Lj-Ei=Li-Ej=c(constant)
    3.   All of the above
    4.   Lj-Ei=Li-Lj
19. If there are in jobs to be performed, one at a time, on each of m machines, the possible sequences would be
    1.   (n!)^m
    2.   (n)^m
    3.   (m!)^n
    4.   (m)^n
20. Total elapsed time to process all jobs through two machine is given by
    1.   n n
       Σ M1j + Σ M2j
       j=1 j=1
    2.   n n
       Σ M2j + Σ M1j
       j=1 j=1
    3.   n
       Σ (M1j + I1j)
       j=1
    4.   None of the above