MBA

SECOND SEMESTER / FIRST YEAR

SECOND SESSIONAL EXAMINATION 2020-21
QUANTITATIVE TECHNIQUES FOR MANAGERS (KMBN-206)
Time: 1:30 hrs Marks: 50
Attempt all questions and all questions in equal marks:
1. Operations research is the application of ____________methods to arrive at the optimal Solutions to
the problems.

(a) economical (b) Scientific

(c) Both (a) & (b) (d) artistic
2. In operations research, the ——————————are prepared for situations.

(a) Mathematical models (b) Physical models

(c) Diagrammatic models (d) None of these
3. OR can evaluate only the effects of ————————————————–.

(a) Personal factors (b) Financial factors

(c) Numeric and quantifiable factors (d) All of these
4. OR has a characteristics that it is done by a team of

(a) Scientists (b) Mathematics

(c) Academics (d) All of these
5. OR uses models to help the management to determine its _____________

(a) Policies (b) Actions

(c) Both (a) & (b) (d) All of these

6. Mean, median and mode are measures of _______________
(a) Central tendency (b) Dispersion

(c) Probability (d) None of these

7. OR techniques are _______________ in nature.
(a) Qualitative (b) Judgmental
(c) Approximation (d) Quantitative
8. ______ are the restriction or limitations imposed on the LPP.
(a) Variables (b) Costs
(c) Profits (d) Constraints
9. In simplex, a minimization problem is optimal when all Delta J, i.e. Cj, - Zj values are
______
 (a) Either zero or positive (b) Either zero or negative
(c) Only positive (d) Only negative
10. The method of solution of assignment problem is called _________
(a) NWCR (b) VAM
(c) LCM (d) Hungarian
11. Minimize Z = ______________

(a) maximize(Z) (b) maximize(-Z)

(c) minimize(-Z) (d) None of these

12. In graphical method the restriction on number of constraint is _________

(a) 2 (b) Not more than 3

(c) 3 (d) None of them
13. Graphical optimal value for Z can be obtained from

(a) corner points of feasible region (b) corner points of the solution region

(c) Both (a) & (b) (d) None of them

14. Graphical method of linear programming is useful when the number of decision variables are
__________.

(a) 2 (b) 6
(c) Finite (d) infinite
15. If an artificial variable is present in the basic variable column of optimal simplex table, then the solution
is ___________.

(a) Alternative (b) Bounded

(c) No solution (d) Infeasible
16. Which of the following methods is used to verify the optimality of the current solution of the
transportation problem ____________

(a) MODI Method (b) Least Cost Method

(c) VAM (d) North west corner rule
17. The table represents a solution that is:

(a) An initial solution (b) Infeasible

(c) Degenerate (d) All of the above
18. The northwest corner rule requires that we start allocating units to shipping routes in the: middle cell.

(a) Lower right corner of the table (b) Upper right corner of the table
(c) Highest costly cell of the table (d) Upper left-hand corner of the
table
19. _________ or __________ are used to “balance” an assignment or transportation problem.

(a) Destinations; sources (b) Units supplied; units demanded

(c) Dummy rows; dummy columns (d) Large cost coefficients; small cost
coefficients
20. Least Cost Method is also known as __________.

(a) North west corner method (b) Matrix minima method

(c) Row minima method (d) Column minima method
21. Maximization assignment problem is transformed into a minimization problem by ________.

(a) adding each entry in a column from the (b) Subtracting each entry in a column from
maximum value in that column the maximum value in that column

(c) Subtracting each entry in a table from (d) Adding each entry in a table from the
the maximum value in that table maximum value in that table
22. An assignment problem is considered as a particular case of a transportation problem because

(a) The number of rows equals (b) All xij = 0 or 1

columns
(c) All rim conditions are 1 (d) All of these
23. The method used for solving an assignment problem is called

(a) Reduced matrix method (b) MODI method

(c) Hungarian method (d) None of these
24. An assignment problem can be solved by

(a) Simplex method (b) Transportation method

(c) Both (a) and (b) (d) None of above
25. The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination) is feasible if
number of positive allocations are

(a) m+n (b) m*n

(c) m+n-1 (d) m+n+1
26. A strategy that is best regardless of what rival players do is called

(a) First – mover advantage (b) A Nash equilibrium strategy

(c) Tit – for - tat (d) A dominant strategy
27. A game that involves multiple moves in a series of identical situations is called a

(a) Sequential game (b) Repeated game

(c) Zero – sum game (d) Nonzero – sum game
28. In the optimal simplex table, Zj-Cj=0 value indicates _____________.
 (a) Alternative solution (b) Bounded solution
(c) Infeasible solution (d) Unbounded solution
29. What is the fundamental purpose of game theory?

(a) To analysis decision – making (b) To analyze strategic interactions

(c) To predict decision outcome (d) To predict firm behavior
30. In assignment problem of maximization, the objective is to maximise

(a) Profit (b) Optimization

(c) Cost (d) None of these
31. If there were n workers & n jobs there would be

(a) n! solutions (b) (n-1)! solutions

(c) (n!)n solutions (d) n solutions
32. The time required by each job on each machine is called _____________ time.
(a) Elapsed (b) Idle
(c) Processing (d) Average
33. In sequencing problem, the order of completion of jobs is called ___________
(a) Completion sequence (b) Job sequence
(c) Processing order (d) Job order
34. The total time required to complete all the jobs in a job sequencing problem is known as
__________
(a) Idle time (b) Processing time
(c) Elapsed time (d) Processing order
35. The order in which machines are required for completing the jobs is called ______
(a) Machine order (b) Working order
(c) Processing order (d) Job order
36. The times between two successive requests arriving, called the
(a) Inter-arrival time (b) Arrival time
(c) Poisson distribution (d) Average residual service time
37. One of the most widely used exponential distributions is called a
(a) Passion distributions (b) Possible distributions
(c) Poisson distributions (d) Poisson
38. Exponential distributions, is such a distribution has a C, of value
(a) 0 (b) 1
 (c) 2 (d) 3
39. The average residual service time, which again assumes Poisson arrivals as
(a) Average residual service time = (b) Average residual service time =
1/Arithmetic mean + (1 + C^2) 2*Arithmetic mean + (1 + C^2)
(c) Average residual service time = (d) Average residual service time =
1/2*Arithmetic mean + (1 + C^2) ½*Arithmetic mean * (1 + C^2)
40. An I/O system with a single disk gets on average 50 I/O requests / sec. and the average
time for a disk to service an I/O request is 10 ms, the utilization of the I/O system would
be
(a) 0.2 (b) 0.5
(c) 0.75 (d) 1.5
41. The problem of replacement is felt when job performing units fail ____

(a) Suddenly and gradually (b) Gradually

(c) Suddenly (d) Neither suddenly nor gradually
42. . VAM is also called........................

(a) Matrix minima method (b) Penalty method

(c) MODI method (d) None of these
43. .................... is the popular method for solving an assignment problem.

(a) Hungarian method (b) Enumeration method

(c) Simplex method (d) None of these
44. The second longest path in the network diagram is called ____________ path.
(a) Alternate (b) Feasible
(c) Sub-critical (d) critical
45. Floats for critical activities will be always _____________
(a) One (b) Zero
(c) Highest (d) Same as duration of the activity
46. In PERT, the expected project completion time is also called as ____________project
completion time.
(a) Average (b) Normal
(c) Mean (d) Critical
47. Fill in the blanks with ‘<’ or ‘>’ sign applicable a ….. m …. b
(a) <,> (b) >,<
(c) >,> (d) <,<
48. ______ and _______ are techniques applied in Project management.
(a) CPM and PERT (b) Assignment and Transportation
(c) Decision theory and inventory (d) None of these
models
49. A activity in a network diagram is said to be __________ if the delay in its start will further delay the
project completion time.

(a) Forward pass (b) Backward pass

(c) Critical (d) Non critical
50. The objective of network analysis is to ___________.

(a) Minimize total project duration (b) minimize total project cost

(c) Minimize production delays, (d) maximize total project duration

interruption and conflicts