Dr. G.R.

Damodaran college of Science Coimbatore 641 014 GRD INSTITUTE OF MANAGEMENT(2010-12) Quantitative Methods For Management- II -251C MBA (2011-13) BATCH Semester: II MULTIPLE CHOICE QUESTIONS 1.In Graphical solution the feasible region is_____________ . a.where all the constraints are satisfied simultaneously. b.any one constraint is satisfied . c.only the first constraint is satisfied . d.any one of the above condition. Answer:A. 2.An LPP has _________ . a. one optimal solutions. b. two optimal solutions. c. three . d. none of these. Answer:D. 3.An LPP deals with problems involving only_________. a. single objective. b. multiple objective. c. two objective. d. none of these. Answer:A. 4.Which of the following is not associated with any LPP_____________. a. feasible solution . b. optimum solution. c.Basic solution . d. Quadratic equation. Answer:D. 5.Which of the following is not true about feasibility__________? a. It cannot be determined in a graphical solution of an LPP. b. It is independent of the objective function. c. It implies that there must be a convex region satisfying all the constraints. d. Extreme points of the convex region gives the optimum solution. Answer:A. 6.In Graphical solution the feasible solution is any solution to a LPP which satisfies ____________ . a. only objective function . b. non-negativity restriction. c. only constraint . d. all the three . Answer:B. 7.In Graphical solution the redundant constraint is____________. a. which forms the boundary of feasible region. b. which do not optimizes the objective function. c. which does not form boundary of feasible region. d. which optimizes the objective function.

Answer:C. 8.Optimal solution in an LPP is ___________. a. which maximizes or minimizes the objective function. b. which maximizes the objective function. c. which minimizes the objective function. d. which satisfies the non negativity restrictions . Answer:A. 9.Unbounded solution in an LPP is ___________. a. where the objective function can be decreased indefinitely. b. which maximizes the objective function. c. where the objective function can be increased or decreased indefinitely. d. where the objective function can be increased indefinitely. Answer:C. 10.The two forms of LPP are _________. a. standard form and canonical form. b. standard form and general form. c. matrix form and canonical form. d. matrix form and standard form. Answer:A.. 11.The canonical form of LPP if the objective function is of maximization, then all the constraints other than non-negativity conditions are __________. a. greater than type. b. lesser than type. c. greater than or equal to type. d.lesser than or equal to type. Answer:D. 12.The canonical form of LPP if the objective function is of minimization then all the constraints other than non-negativity conditions are ___________. a. greater than type. b. lesser than type. c. greater than or equal to type. d. lesser than or equal to type. Answer:C. 13.The canonical form of LPP if the objective function is of minimization then all the constraints other than non-negativity conditions are ________. a.greater than type. b.lesser than type. c.greater than or equal to type. d. lesser than or equal to type. Answer: C. 14.The standard form of LPP if the objective function is of minimization then all the constraints __________. a. equations. b. Inequalities. c. greater than or equal to type d. lesser than or equal to type Answer:A.

15.The standard form of LPP if the objective function is of minimization then the right hand side of the constraints should be__________. a.positive . b.negative . c.non-negative . d.zero . Answer:C. 16.Transportation problem is a special class of __________. a.LPP. b.assignment problem. c.none of the two. d.both 1 and 2. Answer:A. 17.The Objective function of Transportation problem is to________. a.maximize the total cost. b.minimize or maximize the total cost. c.minimize the total cost . d.total cost should be zero. Answer:C. 18. In Transportation problem the preferred method of obtaining either optimal or very close to the optimal solution is _____________. a.north west corner rule. b.least cost method. c.vogels approximation method. d.simplex method . Answer:C. 19.In Transportation problem the improved solution of the initial basic feasible solution is called ___________. a.basic solution . b.optimal solution. c.degenerate solution. d.non-degenerate solution. Answer:B. 20.In Transportation problem optimal solution can be verified by using ________. a.north west corner rule. b.least cost method . c.MODI method. d.matrix method . Answer:C. 21.The cells in the Transportation problem can be classified as ________. a. assigned cells and empty cells . b. allocated cells and un allocated cells. c. occupied and unoccupied cells . d. assigned and unoccupied cells. Answer:C.

22.In North west corner rule the allocation is done in ________. a.upper left corner. b.upper right corner. c.middle cell in the transportation table. d.cell with the lowest cost. Answer:A. 23.In Least cost method the allocation is done by selecting ___________. a.upper left corner. b.upper right corner. c.middle cell in the transportation table. d.cell with the lowest cost. Answer:D. 24.In Transportation problem is said to be balanced if ________. a.total supply is not equal to total demand . b.total supply is greater than total demand. c.total supply is lesser than total demand. d.total supply is equal to total demand . Answer:D. 25.In Transportation problem is said to be unbalanced if _________. a.total supply is not equal to total demand . b.total supply is greater than total demand. c.total supply is lesser than total demand. d.total supply is equal to total demand . Answer:A. 26.The basic feasible solution to a transportation problem is said to be optimal if it __________________. a.maximizes or minimizes the transportation cost. b.maximizes the transportation cost. c.minimizes the transportation cost . d.has degenerate solution. Answer:C. 27.The necessary and sufficient condition for the existence of a feasible solution to a transportation problem is a solution that satisfies all the conditions of_________. a.Supply. b.Demand. c.supply and demand. d.either supply or demand. Answer:C. 28. Purpose of MODI method is to get__________. a.degenerate solution. b.non-degenerate solution. c.Optimal. d.basic feasible solution. Answer:C.

29.In transportation problem the solution is said to non-degenerate solution if occupied cells is __________. a.greater than m+n-1. b.lesser than m+n-1. c.greater than or equal to m+n-1. d.lesser than or equal to m+n-1. Answer:B. 30.In transportation problem the solution is said to degenerate solution if occupied cells is____________. a.greater than m+n-1. b.lesser than m+n-1. c.greater than or equal to m+n-1. d.lesser than or equal to m+n-1. Answer:C. 31.In transportation problem if total supply > total demand we add _________. a.dummy row with cost 0. b.dummy column with cost 0. c.dummy row with cost 1. d.dummy column with cost 1. Answer:B. 32.In transportation problem if total supply < total demand we add __________. a.dummy row with cost 0. b.dummy column with cost 0. c.dummy row with cost 1. d.dummy column with cost 1. Answer:A. 33.In North west corner rule if the demand in the column is satisfied one must move to the ___________. a.left cell in the next column. b.right cell in the next row. c.right cell in the next column. d.left cell in the next row. Answer:C. 34.In North west corner rule if the supply in the row is satisfied one must move _____________. a.down in the next row. b.up in the next row. c.right cell in the next column. d.left cell in the next row. Answer:A. 35.Maximization case in transportation problem the objective is to __________. a.maximize the total profit. b.minimize the total loss . c.neither maximize nor minimize. d.optimal cost. Answer:A.

36.In Maximization case in transportation problem we convert into minimization by subtracting all the elements from the ___________. a.Zero. b.One. c.highest element. d.lowest element. Answer:C. 37.The application of assignment problems is to obtain _________. a.only minimum cost. b.only maximum profit. c.minimum cost or maximum profit . d.assign the jobs. Answer:C. 38.The assignment problem is said to be unbalanced if __________. a.number of rows is greater than number of columns. b.number of rows is lesser than number of columns. c.number of rows is equal to number of columns. d.both 1 and 2. Answer:B. 39.The assignment problem is said to be balanced if _________. a.number of rows is greater than number of columns. b.number of rows is lesser than number of columns. c.number of rows is equal to number of columns. d.if the entry of row is zero. Answer:C 40.The assignment problem is said to be balanced if it is __________. a.square matrix. b.rectangular matrix. c.unit matrix . d.triangular matrix. Answer:A. 41.In assignment problem if number of rows is greater than column then _______. a.dummy column is added . b.dummy row added . c.row with cost 1 is added. d.column with cost 1 is added. Answer:A. 42.In assignment problem if number of column is greater than row then _________. a.dummy column is added . b.dummy row added . c.row with cost 1 is added. d.column with cost 1 is added. Answer:B.

43.The transportation technique or simplex method cannot be used to solve the assignment problem because of a.degeneracy. b.non-degeneracy. c.square matrix. d.any one of the above. Answer:A. 44.The objective of assignment problem is to assign ___________. a.number of origins to equal number of destinations at minimum cost . b.number of origins to equal number of destination at maximum cost. c.only to maximize cost . d.only to maximize the profit. Answer:A. 45. Competitive situation is called_______________. a.Game. b.saddle point. c.Strategy. d.Outcome. Answer:A. 46.Strategy of a player is the decision _________. a.course of action. b.Rule. c.pay off. d.Action. Answer:B. 47.Strategy are classified into___________. a.pure and mixed. b.pure and complex. c.Mixed. d.Pure. Answer:A.. 48.Saddle point is the position in____________. a.pay off matrix. b.Game. c.player A. d.player B. Answer:A. 49.Game is called Two person zero sum game if___________. a.gain of one player equal to loss of the other. b.gain of one player is not equal to loss of the other. c.gain of player A is always greater than the loss of Player B. d.gain of player B is always greater than the loss of Player A. Answer:A. 50.Strategy is called pure if ____________. a.player may be able to choose only one strategy. b.the player knows in advance of the play that is to be adopted. c.the player do not knows in advance of the play that is to be adopted. d.the player may not be able to choose any strategy. Answer:B.

51.Saddle point is the point of intersection of _____________. a.pure strategy. b.mixed strategy. c.complex strategy. d.impure strategy. Answer:A. 52.The gains resulting from a game is called_____________. a.pay off. b.Strategy. c.value of the game. d.fair game. Answer:A. 53.Minimax of the game is___________. a.minimum of row. b.maximum of row. c.minimum of column maxima. d.maximum of row minima. Answer:D. 54.Maximin of the game is___________. a.minimum of row. b.maximum of row. c.minimum of column maxima. d.maximum of row minima. Answer:C.. 55.Game is stable when there is ___________. a. no saddle point. b. saddle point. c. Strategy. d. Outcome Answer:B. 56.Game is said to be fair if ____________. a.minimax= maximin =0. b.minimax= maximin =value of the game. c.minimum row = maximum of column. d.minimum column = maximum of row. Answer:A. 57.Game is said to be strictly determinable if__________. a. minimax= maximin =0. b. minimax= maximin =value of the game. c. minimum row = maximum of column. d. minimum column = maximum of row. Answer:B. 58.One of the methods for simplifying game with mixed strategy is___________. a.finding row minima. b.finding column maxima. c.Dominance. d.any one of the above methods. Answer:C.

59.Game can be solved graphically only if the pay off matrix is in the form of____________ . a. mx2. b. 2xn. c.mx2 or 2xn. d.Mxn. Answer:C. 60.Games without saddle point require players to play___________. a. pure strategy. b. mixed strategy. c. optimal strategy. d. any one of the above strategy. Answer:B. 61.Pure strategy game is one in which each player has_____________. a. only one optimal strategy. b. mixed strategy. c. many optimal strategy. d. no optimal strategy. Answer:A. 62.One of the methods for simplifying game with mixed strategy is________. a.finding row minima. b.finding column maxima. c.Dominance. d.any one of the above methods. Answer:C. 63.Value of the game is denoted by______________. a.. . b.. c.. d.. Answer:D 64.The Value of the game for the given pay off 6 -3 is___________. -3 0 a.-3/4. b.3/4. c.1/4. d.2/4 . Answer:A. 2 5 65.The Value of the game for the given pay off 4 1 is__________. a.3 . b.-3. c.5. d.-5. Answer:A.

66.The optimal strategy for the given pay off a.( 1/4 1/2 ) (1/2 1/2). b.( 1/4 1/2 ) (2/3 1/2). c.( 1/2 1/2 ) ( 1/4 1/2 ). d.( 1/2 1/2 ) (2/3 1/3). Answer:D.

2 4

5 1

is___________.

67.The optimal strategy for the given pay off 6 -3 -3 0 a.( 1/4 3/2 ) (1/4 1/2). b.( 1/4 3/2 ) (1/4 3/4). c.( 1/2 1/2 ) ( 1/4 1/2 ). d.( 1/2 1/2 ) (2/3 2/3). Answer:B. 68.For the given pay off matrix 1 3 1 0 -4 -3 1 5 -1 a.saddle point do not exists. b.saddle point exists. c.player plays mixed strategy. d.player plays pure strategy. Answer:B. 69.The given game -5 2 - 7 -4 a.strictly determinable game. b.determinable game. c.fair game. d.unfair game. Answer:A. 70.The given game 0 2 -1 4

is______________.

is___________.

is__________.

a.strictly determinable game. b.determinable game. c.fair game. d.unfair game. Answer:C. 71.The optimum minimax strategies for each player for the given pay off matrix of the game -5 2 0 7 is_______________. 5 6 4 8 4 0 2 -3 a.A2, B2. b.A1, B3. c.A2, B3. d.A2, B2. Answer:B.

72.The optimum strategies for the game -5 -7

2 -4

is___________.

a.A2, B2. b.A1, B1. c.A2, B1. d.A1, B2. Answer:A. 73.Two players A and B match coins. If the coins match then A wins two units of value. If the coins do not match then B wins two units of value. For the given situation the pay off matrix is ______________. a. 2 -2 -2 2 2 -2 b. 0 2 2 -2 c. 0 0 d. 2 0 0 -2 Answer:A. 74.y=ax2+bx+c is a___________. a. linear equation. b. quadratic equation. c. simultaneous equation. d. trancedental equation. Answer:B. 75. In a linear programming minimization model the objective function is_________. a.Minimized. b.Maximized. c.minimized or maximized. d.Standardized. Answer:B. 76.Which of the following is not associated with any L.P.P_________? a.feasible solution. b.optimum solution. c.Basic solution. d.quadratic equation. Answer:D. 77.Linear programming is______________. a.a constraint optimization model. b.a constraint decision making model. c.a mathematical programming model. d.all the above. Answer:D. 78.Which of the following is not true about feasibility______________. a. it cannot be determined in a graphical solution of an L.P.P.

b.it is independent of the objective function. c.it implies that there must be a convex region satisfying all the constraints. d.extreme points of the convex region gives the optimum solution. Answer:A. 79.Graphical method can be used only when the decision variables is___________. a.more than 3. b.more than1. c.Two. d.one. Answer:C. 80.In an LPP the Objective function is to be____________. a.Minimized. b.maximized. c.minimized or maximized. d.Maximin. Answer:C . 81.The region on the graph sheet with satisfies the constraints including the non- negativity restrictions is called the _______ space. a.solution. b.interval. c.concave. d.convex. Answer:A. 82.The __________ is the method available for solving an L.P.P are. a.graphical method. b.least cost method. c.MODI method. d.Hungarian method. Answer:A. 83.The initial solution of a transportation problem can b obtained by applying any known method. However, the only condition is that__________. a.the solution be optimal. b.the rim conditions are satisfied. c.the solution not be degenerate. d.no degenerate. Answer:B. 84.One disadvantage of using north west corner rule to find initial solution to the transportation problem is that_____________. a.it is difficult to use. b.it does not take into account cost of transportation. c.it leads to a degenerate initial solution. d.transportation cost is maximum. Answer:B. 85.The solution of a transportation problem with m rows and n-columns is feasible if number of positive allocations are__________. a.m+n. b.mxn. c.m+n-1.

d.m+n+1. Answer:C. 86.When total supply is equal to total demand in a transportation problem, the problem is said to be__________. a.Balanced. b.unbalanced. c.degenerate. d.non-degenerate. Answer:A. 87.Which of the following is methods is used to verify the optimality of the current solution of the transportation problem__________. a.least cost method. b.vogels method. c.north west corner rule. d.Modi method. Answer:D. 88.The method used for solving an assignment problem is called____________. a.reduced matrix method. b.Modi method. c.hungarian method. d.graphical method. Answer:C. 89.The purpose of dummy row or column in an assignment problem is to_________. a.obtain balance between total activities and total resources. b.prevent a solution from becoming degenerate. c.provide a means of representing a dummy problem. d.any one of the above. Answer:A. 90.The assignment problem is said to be a balanced one if__________. a.number of rows is equal to columns. b.number of rows is greater than columns. c.number of columns is greater to rows. d.any one of the above. Answer:A. 91.An optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to number of_________. a.rows or columns. b.rows and columns. c.rows+columns-1. d.Rows. Answer:C. 92.Game theory models are classified by the__________. a.number of players. b.sum of all payoffs. c.number of strategies. d.all the above.

Answer:D. 93.In a mixed strategy game____________. a.no saddle point exists. b.saddle point exists. c.each player selects same strategy. d.each player selects different strategy. Answer:A. 94.Game theory is the study of___________. a.selecting optimal strategies. b.resolving conflict between players. c.both 1and 2. d.either 1 or 2. Answer:A. 95.The size of the payoff matrix of a game can be reduced by using the principle of___________. a.game inversion. b.rotation reduction. c.Dominance. d.convex combination. Answer:C. 96.A saddle point exists_________. a.maximin=minimax. b.minimin=maximin. c.maximin=maximax. d.minimanx=maximax. Answer:A. 97.When some of the gains of one player is equal to the sum of losses to another player in a game, this situation is known as___________. a.biased game. b.zero-sum game. c.fair game. d.determinable game. Answer:B. 98.Games which involve more than 2 players___________. a.conflicting games. b.negotiable games. c.zero-sum game. d.n person games. Answer:D. 99.when maximin and minimax values of the game exists then_____________. a.solution exists. b.no solution exists. c.solution is mixed. d.saddle point exists. Answer:D. 100.The payoff value for which each player in a game always select the same strategy is called the__________. a.saddle point.

b.equilibrium point. c.both 1 and 2. d.maximin. Answer:C. 101.A mixed strategy game can be solved by___________. a.algebric method. b.dominance method. c.graphical method. d.all the above. Answer:D. 102. The passenger and the train in queueing system describers_________ . a. Customer and server. b. Server and customer. c. Both server. d. None of these. Answer:A. 103.If the injured goes to doctor for treatment then in queueing system the doctor and injured are respectively____________ . a. Customer and server. b. Server and customer. c. Both server. d. None of these. Answer:B. 104. Under the axioms of exponential distribution, the number of arrivals during a sufficient small time interval is __________. a. More than one. b. Less than one. c. Almost one. d. None of these. Answer:B. 105.Under the axioms of exponential distribution, the probability of arrival________. a. Depends on previous arrival. b. Independent of previous arrival. c .Dependent as well as independent. d .None of these. Answer:B. 106.Under the exponential assumptions the probability that an event occur in sufficient small interval is ____________. a .Greater than one. b .Less than one. c .Equals to one. d .None of these. Answer: A. 107.Under the exponential assumption, the probability that an event will occur in sufficient small interval is________________ . a. Always positive. b. Always negative. c. Always Zero .

d. None of these. Answer: B. 108.The interarrival time is 10 minutes the arrival rate is ________ . a.8. b.1/10. c.3. d.2. Answer:A . 109.Let p be the probability that an arrival occurs in t =0 under exponential assumptions___________. a. 0p1. b. 0<p1. c. 0<p<1. d. 01<1. Answer: B. 110.The mean and standard deviation of exponential distribution are _________. a. Equal. b. Mean>s. d. c. Mean< s. d. d. None of these. Answer: C . 111.Let q be the probability that no arrival occur in t=0 under exponential assumption is ________. a. 0q1. b. 0<q<1. c. 0q<1. d. 0<q1. Answer:A . 112. If the rate of birth is 12 per minute. Then the average number of birth per year is __________. a.43800. b.45000. c.40000. d.None of these . Answer: A. 113. If the interarrival time is exponential with mean 1/ the Number of arrivals in (0,t) is___________. a. Poisson distributed. b. Exponential distributed . c. Binomial distributed . d. None of these. Answer:B. 114. The inter departure time , corresponding to truncated Poisson distribution in a pure death model is ___________. a. Exponential distributed . b. Poisson distributed. c. Binomial distributed. d. None of these. Answer:A.

115.The arrival of customer(with no departure) in system, in queueing theory can be stated as__________. a. The pure birth process. b. The pure death process. c. The birth death process. d. None of these. Answer: A. 116.The withdrawal of items from certain in ventory without refilling in queueing systems can be stated as __________. a. The pure birth process. b. The pure death process. c. The birth death process. d. None of these . Answer: B. 117.The arrival and departure of quests in a hotel in queueing systems can be ststed as ________. a. The pure birth process. b. The pure death process. c. The birth death process. d. None of these. Answer: C. 118.In certain situation the customer arrives from one gate and departure takes from another gate. This situation of incoming and outgoing can be stated as _________. a. The pure death process. b. The pure birth process. c. The birth-death process. d. None of these. Answer: C. 119.There are N inventories in the system, one by one all the inventories are consumed with replacing the inventories. This process is stated as_____________. a. The pure birth process. b. The pure death process. c. The birth death process. d. None of these. Answer: A. 120.The departure and arrivals in queuing system are normally considered respectively M/M/1 the arrival and departure distribution are_____________. a. Both Markovian . b. Binomial. c. General. d. None of these. Answer:A. 121.In queue description M/M/1, the number of servers are _____________. a. 1. b. M. c. 2. d. None of these. Answer: A.

122.M/G/2, queue description, the departure arrival distribution respectively are _________. a. General and Markovian. b. Markovian and general. c. Markovian. d. None of these. Answer:A. 123.M/G/3/n,queue description states the number of servers and buffer capacity as _______. a. 3 and M. b. M and 3. c. 3 and N. d. None of these. Answer:C. 124..M/M/3/FCFS/N, queue description, FCFS and N are __________. a. Queue discipline and arrival pattern. b. Queue discipline and buffer capacity. c. Arrival and departure distribution. d. None of these. Answer:B. 125. What is the total annual cost_______? a. Rs.560. b. Rs.986. c. Rs.867. d. Rs.800. Answer:C. 126.Let A: the number of units in the system. B: the number of units waiting for service. C: the number of servers. The following relation holds _________. a. C=A-B. b. C=A+B. c. C=A/B. d. None of these. Answer: A. 127.Consider the situation, when no server is working, then the number of customers in the system are___________. a. Equal to number of customers in queue. b. More than number of customers in queue. c. Less than number of customers in queue. d. None of these. Answer: A. 128.On a certain day, number of customers in a system are 20,and number of customer in service are 12,the number of customers waiting for service are ________. a. 10. b. 8. c. 20.

d. None of these. Answer: B. 129.Let C be the expected number of servers in the system ,C the expected number of serves not busy and C the expected number of servers busy then__________. a. C=C-C. b. C=C+C. c. C=C/C. d. C=C/C. Answer: A. 130. Let be an arrival rate of customer in a system, be an service rate of the system then the expected number of busy servers are _______. a. / . b. + . c. . d. None of these. Answer: A . 131. The expected waiting time in the system is 10 minutes, and expected waiting time in the queue is 5 minutes then the service rate is _______. a. /10. b.1/5. c. 5. d. 0. Answer: B. 132.The traffic intensity for M/M/1 system is given by ________. a. p=/. b. p=/. c. p= . d. None of these. Answer: A. 133.For M/M/1 queueing system, the expected number of customers in the system are ___. a. L =p/1-p. b. L=1-p/p. c. L=1-p. d. None of these. Answer: A . 134. For M/M/1 queueing system, the expected number of customers in the system are_______. a. L= / -. b. L= - / . c. L= / -. d. None of these . Answer: A . 135. For M/M/1 queueing system if arrival rate is 10 customers/day and service rate is 30 customers per day then expected number of customers in the queue on a certain day is _________. a. 1/3. b. 1/6. c. 6.

d. None of these. Answer: A. 136. If arrival rate is 15 customers per minute and service rate is 30 customers per minute, then for M/M/1 queueing system, its traffic intensity is given by__________. a. . b. 2. c. 4. d. None of these. Answer: A . 137. If arrival rate is 20 customers/per week and service rate is 50 customers/week, then the expected number of busy servers for M/M/1 queueing system are _________. a. 2/5. b. 5/2. c. 5 . d. None of these . Answer: A. 138.For M/M/1 system, the expected waiting time in the queue is ________. a. / . b. / (-). c. / -. d. None of these. Answer: B . 139.For M/M/1 model the expected number of busy servers are equal to_______. a. Traffic intensity p . b. Arrival rate . c. Service rate . d. None of these . Answer: A.. 140.For M/M/1 model the probability that there is no customer in the system is ________. a. 1.5 . b. 2. c.3. d.5. Answer: A. 141.For M/M/1/N queue modules, if P n is the number of customers in the system then ________. a. P n=0 for n>N. b. Pn0 for n>N . c. P n=1 for n>N. d. None of these. Answer: A. 142. When p=1, for M/M/1/N queueing system, expected number of customers in the system are__________ . a. N/2. b. N/6. c. N .

d. None of these. Answer: A. 143. For M/M/1/N system, the expected waiting time in the system for p=1 is ________. a. W=N/2 . b. W=N/2 . c. W=1/ . d. None of these . Answer: A. 144. The expected waiting time in the queue for p=1 in M/M/1/N system is __________. a. W= N/2-1/ . b. W=1/. c. W=1/. d. None of these. Answer: A. 145. Let N=10,arrival rate =2,then for M/M/1/N system the expected waiting time the system for p=1 is._________ a. W=10/3. b. W=5/2. c. 3. d. None of these. Answer: B. 146. Let N=15,then for p=1,Pn,the probability of n customer in the system for M/M/1/N queueing system is__________. a. Pn=1/10. b.Pn=1/16. c. Pn=1/3. d. None of these. Answer: B. 147.Let pn be the probability of n units in the system then expected number of units Ls in the system are_________. a. b. . .

c. . d.None of these. Answer : A. 148.The relationship between the expected number of customer in the system, Ls , expected number of customers in queue, Lq , arrival rate of customers at system and service rate of customers in system is a. Ls-Lq= / b. Ls+Lq= / c. Ls/Lq= / d. None of these. Answer:A.

148. Let Ws and Wq be the expected waiting time in the system and queue, and LsandLq be the expected number of customers in system and queue then a. b. . .

c. . d. None of these. Answer:B. 149.If and Ws the expected lenghth of custom in the system Ws be the expected waiting time in the system by littles formula for arrival rate in the system a. Ls= Ws . b. LsWs= . c. Ws= Ls . d. None of these. Answer:C. 150.Little formula states the relationship between a.Ws ,Wq and . b.Ls , Lq and . c.Ws , Ls and . d.None of these. Answer:C. 151.For M/M/1 system, the expected queuing length is a. .

b.

c. . d.None of these. Answer:B 152.The _________ constitutes a convex set. a.Feasible solution. b.Optimal slution c.Bounded solution. d.None of the above. Answer : A. 153.Any feasible solution which optimize the objective function of general linear programming problem is called an _________________ to that linear programming problem. a.Initial basic feasible solution b.Optimal feasible solution. c.Bounded solution. d.None of the above.

Answer : B. 154.Activities that must be completed immediately prior to the start of another activity are called__________. a. predecessor activity. b.Successor activity. c.concurrent activity. d.None of the above. Answer: A. 155.Activities that cannot be started until one or more of the other activities are completed, but immediately succeed them are called a.predecessor activity. b.Successor activity. c.concurrent activity. d.None of the above. Answer: B. 156.Activities which can be accomplished concurrently are known as ___________ . a.predecessor activity. b.Successor activity. c.concurrent activity. d.None of the above. Answer: C. 157.When more than one activity comes and joins, the event is known as___________. a.predecessor activity. b.Successor activity. c.concurrent activity. d.Merge events. Answer: D. 158.A complete network diagram should have _________________ . a.one start point and one finish point. b.two start points and one finish point c.one start point and two finish points. d.two start points and one finish point. Answer: A. 159.The jobs have been built into a closed network _________can be allocated to events from the beginning to the end of the network. a.numbers. b.arrows. c.lines. d.None of the above. Answer: A. 160.___________ arrows are used to avoid ambiguity. a. blank. b.dummy. c.parallel d.None of the above. Answer: B 161.All activities must start and finish with an ____________. a.numbers. b.lines.

c.arrows. d.events. Answer: D. 162.Replacement models discuss the problem where we wish to ________? a.Maximize operational (maintenance)cost b. Minimize operational cost c.Maximize setup cost d. Minimize setup cost Answer: B. 163.In certain replacement model,the average maintanence cost of the system remains constant.Is it better to replace the item on the decision made on maintanence cost_____? a.Yes. b.No. c.Cant say. d.None of these. Answer: B. 164.Replacement problems are associated with ________? a.Setup cost. b.Maintanence cost. c.Value of the equipments. d.None of these. Answer: B. 165.When the equipment starts deteriorating with respect to time,its maintanence cost gradually starts _________? a.Increasing. b.Decreasing. c.Constant. d.None of these. Answer: A. 166. A certain items setup cost and scrap value is constant with respect to time,but its maintanence cost starts increasing with respect to time.If f(n) is the maintanence cost function and A(n) is the average total annual cost then it is better to replace that item when _________? a.f(n)=A(n). b.f(n)<A(n). c.f(n)=Constant. d.A(n)=Constant. Answer:A. 167.The critical activities form a chain running through the network which is called the __________. a.arrows. b.critical path. c.events. d.predecessor activity Answer: D 168.The path which takes the ____________ constitutes the critical path. a.longest path. b.shortest path. c.unknown path.

d.None of these. Answer: A. 169. The slack of an event is the difference between the latest and earliest event times are known as ________ . a.events. b.critical events. c.critical path. d.critical activities. Answer: B. 170.Activities with zero total float are known as ___________. a. event. b.critical events. c.critical path. d.critical activities. Answer: D. 171.The sequence of critical activities in a network is called ___________ . a.critical path. b.critical events. c.successor activity. d.predecessor activity. Answer: A. 172._________ is the earliest possible time at which an activity can start. a.earliest start time. b.earliest finish time. C.latest start time. d.latest finish time. Answer: A. 173. ___________ of an activity is the earliest possible time at which an activity can finish. a.earliest start time. b.earliest finish time. C.latest start time. d.latest finish time. Answer: B. 174.__________ is found by taking the latest event time of the finish event. a.earliest start time. b.earliest finish time. C.latest start time. d.latest finish time. Answer: D. 175.__________ is the latest possible time by which an activity can start and is given by Subtracting the duration time from the latest finish time. a.earliest start time. b.earliest finish time. C.latest start time. d.latest finish time. Answer: C. 176.__________ is the time by which its associated activity must be reduced for the project to meet the target time.

a.negative float. b.positive float. C.total float. d.independent float. Answer: A. 177.__________ is the difference between the latest and earliest event times. a.free float. b.independent float. C.slack. d.total float. Answer: C. 178.____________ is the difference between the latest start time and earliest start time of that activity. a.total float. b.free float. C.independent float. d.negative float. Answer: A. 179. ____________ is defined as the time by which the completion of an activity can be delayed beyond the earliest finish time without affecting the earliest start of a subsequent activity. a.total float. b.free float. C.independent float. d.negative float. Answer: B. 180.___________ is defined as the amount of time by which the start of an activity can be delayed that the preceding activity has finished at its latest finish time. a.total float. b.free float. C.independent float. d.negative float. Answer: C. 181.PERT is designed for scheduling_____________ that involve many inter-related tasks. a. complex projects. b.transportation problems. c.assignment problems. d.replacement problems. Answer: A. 182. _________ is time estimate of an activity when everything is assumed to go well as per plan. a.optimistic time. b.most likely time. c.pessimistic time. d.none of the above. Answer: A. 183. _____________ is time which the activity will take most frequently if performed a number of times-the modal value.

a.optimistic time. b.most likely time. c.pessimistic time. d.none of the above. Answer: B. 184. _________ is the unlikely but possible performance time if what ever could go wrong, goes wrong in series. a.optimistic time. b.most likely time. c.pessimistic time. d.none of the above. Answer:C. 185.___________ is generally used for those projects where time required to complete various activities is not known a priori. a.CPM b.PERT. c.Replacement model d.Queueing model. Answer: B 186.__________ is commonly used for those projects which are repetitive in nature and where one has prior experience of handling similar projects. a.CPM b.PERT. c.Replacement model d.Queueing model. Answer: A. 187.________ deals with the analysis of assets/equipments which deteriorate with time and fix the optimal time of their replacement so that the total cost is the minimum. a.simulation b.decesion theory. c.Replacement model d.Queueing model. Answer: B. 188._________ is the probability of failure increases with increase in the life of an item. a.progressive failure. b.retrogressive failure. c.random failure. d.none of the above. Answer: A 189.__________ have more probability of failure in the beginning of their life and as time passes, the chances of failure become less. a.progressive failures. b.retrogressive failures. c.random failures d.none of the above. Answer: C. 190._______________ I having constant probability of failure is associated with items that fall from random causes such as physical stocks, not related to age. a.progressive failure.

b.retrogressive failure. c.random failure. d.none of the above. Answer: A. 191. The following are the two categories of costs required to determine the optimal period for replacement of an equipment which has a gradual failure mechanism are___ . a.depreciation cost and operating cost. b.depreciation cost and salvage cost. c.salvage cost and maintenance cost. d.ordering cost and purchasing cost. Answer: A. 192.________ if the operating cost of next period is greater than the weighted average of the previous costs. a.replace. b.transpose. c.donot replace d.none of the above. Answer: A. 193. Which of the following is not a main element of the project management process? a.schedule. b.system design. c.plan d.moniter. Answer: B. 194. Which of the following is not a main project objective? a.structure b.time. c.cost d.quality. Answer: A. 195. Which of the following is a main PRINCE project aim? a.deliver on schedule. b.meet specified quantity. c.stay within budget. d.meet specified quality. Answer: C. 196.Which of the following is an integer linear programming problem? a.Transportation problem. b.Assignment problem. c.Primal dual problem. d.All of these. Answer: B. 197.A feasible solution is said to be optimal if it ___________ the total transportation problem. a.minimizes. b.maximizes. c.m+n-1. d.None of these. Answer: A.

198.Decision analysis provides a formal framework for studying the _____________ process. a.Integer programming problem. b.decision making process. c.Non-linear programming problem. d.None of these. Answer: B. 199.___________ refers to individual or a group of individuals responsible for making the choice of an appropriate course of action amongst the available courses of action. a.strategies. b.States of nature. c.The decision maker. d.None of these. Answer: C. 200._________ is useful for portraying the inter-related, sequential and multidimensional aspects of any major decision-problem with in the systems framework. a.Decision tree diagram. b.Dynamic programming problem. c.Bayes theorem. d.None of these. Answer: A.

SUBJECT HANDLED BY :Mrs.GLORY PERCIAL