MTH601 Midterm MCQs by VU Topper RM

Q1. Vu-Topper RM (1 marks)

There are _______ kinds of time calculations for a project. A. 2 types

B. 4 types

C. 6 types D. 8 types

Q2. Vu-Topper RM (1 marks)

Which of the following value is correct for the Variance of an activity times having optimistic, pessimistic and most likely values as 4, 8 and 6 days respectively?

1. 0.1
2. 0.147
3. 0.666
4. 0.444

Correct answer: 0.666

Q3. Vu-Topper RM (1 marks)

A dummy activity is a simulated activity of sorts, one that is of

A. Minimum B. Maximum C. Average

D. Zero

Q4. Vu-Topper RM (1 marks)

Activity definition refers to the process of parsing a project into a number of individual tasks which must be completed __ the deliverables can be considered completed. Activity definitions rely on a number of specific input processes.

A. Before

B. After C. Both before and after D. None of the these

Q5. Vu-Topper RM (1 marks)

Best possible time estimate that a given activity would take under normal conditions which often exist, is called A. Pessimistic time estimate B. Smallest time estimate C. None of the above

D. Most likely time estimates

Q6. Vu-Topper RM (1 marks)

While solving a LP by Simplex method, which of the following corresponds to corner points of the feasible region in Graphical method?

1. Non-feasible solution
2. Basic feasible solution
3. Non-basic feasible solution
4. Non-negative solution

Correct answer: Basic feasible solution

Q7. Vu-Topper RM (1 marks)

In a network flow diagram, if an event is the predecessor of three other events, then how many dummies are inevitable to include in the network?

1. One
2. Two
3. Four
4. Three

Correct answer: Two

Q8. Vu-Topper RM (1 marks)

For finding the maximum profit in an enterprise of selling two products such that freezing the sale of one product and keep selling the other. This scenario is studied under. A. Un-roundedness B. Duality

C. Degeneracy

D. None of the these

Q9. Vu-Topper RM (1 marks)

Which of the following order pair would minimize the object function of the linear programming problem: z=x+5y subject to x≥ 2, 𝑦 ≥ 0?

1. (2,3)
2. (2,0)
3. (0,3)
4. (0,2)

Correct answer: (2,0)

Q10. Vu-Topper RM (1 marks)

A balanced transportation model with 5 number of source 7 destinations has_ number of constraint equations. A. 2

B. 12

C. 35 D. 20

Q11. Vu-Topper RM (1 marks)

The cost coefficient of artificial variable in objective function is A. 0 B. 1 C. 2

D. M

Q12. Vu-Topper RM (1 marks)

About which of the following it is true that, “they only signify with the passage of time, the beginning and ending of some activities under no consumption of resources”?

1. Project
2. Nodes