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

Decision Science MCQs

  

1 / 20

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