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 [Link] Graphical solution the feasible region is_____________ . [Link] all the constraints are satisfied simultaneously. [Link] one constraint is satisfied . [Link] the first constraint is satisfied . [Link] one of the above condition. Answer:A. [Link] LPP has _________ . a. one optimal solutions. b. two optimal solutions. c. three . d. none of these. Answer:D. [Link] LPP deals with problems involving only_________. a. single objective. b. multiple objective. c. two objective. d. none of these. Answer:A. [Link] of the following is not associated with any LPP_____________. a. feasible solution . b. optimum solution. [Link] solution . d. Quadratic equation. Answer:D. [Link] 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. [Link] 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. [Link] 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. [Link] 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. [Link] 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. [Link] 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.. [Link] 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. [Link] than or equal to type. Answer:D. [Link] 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. [Link] canonical form of LPP if the objective function is of minimization then all the constraints other than non-negativity conditions are ________. [Link] than type. [Link] than type. [Link] than or equal to type. d. lesser than or equal to type. Answer: C. [Link] 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.

[Link] standard form of LPP if the objective function is of minimization then the right hand side of the constraints should be__________. [Link] . [Link] . [Link]-negative . [Link] . Answer:C. [Link] problem is a special class of __________. [Link]. [Link] problem. [Link] of the two. [Link] 1 and 2. Answer:A. [Link] Objective function of Transportation problem is to________. [Link] the total cost. [Link] or maximize the total cost. [Link] the total cost . [Link] 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 _____________. [Link] west corner rule. [Link] cost method. [Link] approximation method. [Link] method . Answer:C. [Link] Transportation problem the improved solution of the initial basic feasible solution is called ___________. [Link] solution . [Link] solution. [Link] solution. [Link]-degenerate solution. Answer:B. [Link] Transportation problem optimal solution can be verified by using ________. [Link] west corner rule. [Link] cost method . [Link] method. [Link] method . Answer:C. [Link] 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.

[Link] North west corner rule the allocation is done in ________. [Link] left corner. [Link] right corner. [Link] cell in the transportation table. [Link] with the lowest cost. Answer:A. [Link] Least cost method the allocation is done by selecting ___________. [Link] left corner. [Link] right corner. [Link] cell in the transportation table. [Link] with the lowest cost. Answer:D. [Link] Transportation problem is said to be balanced if ________. [Link] supply is not equal to total demand . [Link] supply is greater than total demand. [Link] supply is lesser than total demand. [Link] supply is equal to total demand . Answer:D. [Link] Transportation problem is said to be unbalanced if _________. [Link] supply is not equal to total demand . [Link] supply is greater than total demand. [Link] supply is lesser than total demand. [Link] supply is equal to total demand . Answer:A. [Link] basic feasible solution to a transportation problem is said to be optimal if it __________________. [Link] or minimizes the transportation cost. [Link] the transportation cost. [Link] the transportation cost . [Link] degenerate solution. Answer:C. [Link] necessary and sufficient condition for the existence of a feasible solution to a transportation problem is a solution that satisfies all the conditions of_________. [Link]. [Link]. [Link] and demand. [Link] supply or demand. Answer:C. 28. Purpose of MODI method is to get__________. [Link] solution. [Link]-degenerate solution. [Link]. [Link] feasible solution. Answer:C.

[Link] transportation problem the solution is said to non-degenerate solution if occupied cells is __________. [Link] than m+n-1. [Link] than m+n-1. [Link] than or equal to m+n-1. [Link] than or equal to m+n-1. Answer:B. [Link] transportation problem the solution is said to degenerate solution if occupied cells is____________. [Link] than m+n-1. [Link] than m+n-1. [Link] than or equal to m+n-1. [Link] than or equal to m+n-1. Answer:C. [Link] transportation problem if total supply > total demand we add _________. [Link] row with cost 0. [Link] column with cost 0. [Link] row with cost 1. [Link] column with cost 1. Answer:B. [Link] transportation problem if total supply < total demand we add __________. [Link] row with cost 0. [Link] column with cost 0. [Link] row with cost 1. [Link] column with cost 1. Answer:A. [Link] North west corner rule if the demand in the column is satisfied one must move to the ___________. [Link] cell in the next column. [Link] cell in the next row. [Link] cell in the next column. [Link] cell in the next row. Answer:C. [Link] North west corner rule if the supply in the row is satisfied one must move _____________. [Link] in the next row. [Link] in the next row. [Link] cell in the next column. [Link] cell in the next row. Answer:A. [Link] case in transportation problem the objective is to __________. [Link] the total profit. [Link] the total loss . [Link] maximize nor minimize. [Link] cost. Answer:A.

[Link] Maximization case in transportation problem we convert into minimization by subtracting all the elements from the ___________. [Link]. [Link]. [Link] element. [Link] element. Answer:C. [Link] application of assignment problems is to obtain _________. [Link] minimum cost. [Link] maximum profit. [Link] cost or maximum profit . [Link] the jobs. Answer:C. [Link] assignment problem is said to be unbalanced if __________. [Link] of rows is greater than number of columns. [Link] of rows is lesser than number of columns. [Link] of rows is equal to number of columns. [Link] 1 and 2. Answer:B. [Link] assignment problem is said to be balanced if _________. [Link] of rows is greater than number of columns. [Link] of rows is lesser than number of columns. [Link] of rows is equal to number of columns. [Link] the entry of row is zero. Answer:C [Link] assignment problem is said to be balanced if it is __________. [Link] matrix. [Link] matrix. [Link] matrix . [Link] matrix. Answer:A. [Link] assignment problem if number of rows is greater than column then _______. [Link] column is added . [Link] row added . [Link] with cost 1 is added. [Link] with cost 1 is added. Answer:A. [Link] assignment problem if number of column is greater than row then _________. [Link] column is added . [Link] row added . [Link] with cost 1 is added. [Link] with cost 1 is added. Answer:B.

[Link] transportation technique or simplex method cannot be used to solve the assignment problem because of [Link]. [Link]-degeneracy. [Link] matrix. [Link] one of the above. Answer:A. [Link] objective of assignment problem is to assign ___________. [Link] of origins to equal number of destinations at minimum cost . [Link] of origins to equal number of destination at maximum cost. [Link] to maximize cost . [Link] to maximize the profit. Answer:A. 45. Competitive situation is called_______________. [Link]. [Link] point. [Link]. [Link]. Answer:A. [Link] of a player is the decision _________. [Link] of action. [Link]. [Link] off. [Link]. Answer:B. [Link] are classified into___________. [Link] and mixed. [Link] and complex. [Link]. [Link]. Answer:A.. [Link] point is the position in____________. [Link] off matrix. [Link]. [Link] A. [Link] B. Answer:A. [Link] is called Two person zero sum game if___________. [Link] of one player equal to loss of the other. [Link] of one player is not equal to loss of the other. [Link] of player A is always greater than the loss of Player B. [Link] of player B is always greater than the loss of Player A. Answer:A. [Link] is called pure if ____________. [Link] may be able to choose only one strategy. [Link] player knows in advance of the play that is to be adopted. [Link] player do not knows in advance of the play that is to be adopted. [Link] player may not be able to choose any strategy. Answer:B.

[Link] point is the point of intersection of _____________. [Link] strategy. [Link] strategy. [Link] strategy. [Link] strategy. Answer:A. [Link] gains resulting from a game is called_____________. [Link] off. [Link]. [Link] of the game. [Link] game. Answer:A. [Link] of the game is___________. [Link] of row. [Link] of row. [Link] of column maxima. [Link] of row minima. Answer:D. [Link] of the game is___________. [Link] of row. [Link] of row. [Link] of column maxima. [Link] of row minima. Answer:C.. [Link] is stable when there is ___________. a. no saddle point. b. saddle point. c. Strategy. d. Outcome Answer:B. [Link] is said to be fair if ____________. [Link]= maximin =0. [Link]= maximin =value of the game. [Link] row = maximum of column. [Link] column = maximum of row. Answer:A. [Link] 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. [Link] of the methods for simplifying game with mixed strategy is___________. [Link] row minima. [Link] column maxima. [Link]. [Link] one of the above methods. Answer:C.

[Link] can be solved graphically only if the pay off matrix is in the form of____________ . a. mx2. b. 2xn. c.mx2 or 2xn. [Link]. Answer:C. [Link] 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. [Link] 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. [Link] of the methods for simplifying game with mixed strategy is________. [Link] row minima. [Link] column maxima. [Link]. [Link] one of the above methods. Answer:C. [Link] of the game is denoted by______________. a.. . b.. c.. d.. Answer:D [Link] 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 [Link] Value of the game for the given pay off 4 1 is__________. a.3 . b.-3. c.5. d.-5. Answer:A.

[Link] 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___________.

[Link] 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. [Link] the given pay off matrix 1 3 1 0 -4 -3 1 5 -1 [Link] point do not exists. [Link] point exists. [Link] plays mixed strategy. [Link] plays pure strategy. Answer:B. [Link] given game -5 2 - 7 -4 [Link] determinable game. [Link] game. [Link] game. [Link] game. Answer:A. [Link] given game 0 2 -1 4

is______________.

is___________.

is__________.

[Link] determinable game. [Link] game. [Link] game. [Link] game. Answer:C. [Link] 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.

[Link] optimum strategies for the game -5 -7

2 -4

is___________.

a.A2, B2. b.A1, B1. c.A2, B1. d.A1, B2. Answer:A. [Link] 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_________. [Link]. [Link]. [Link] or maximized. [Link]. Answer:B. [Link] of the following is not associated with any L.P.P_________? [Link] solution. [Link] solution. [Link] solution. [Link] equation. Answer:D. [Link] programming is______________. a.a constraint optimization model. b.a constraint decision making model. c.a mathematical programming model. [Link] the above. Answer:D. [Link] of the following is not true about feasibility______________. a. it cannot be determined in a graphical solution of an L.P.P.

[Link] is independent of the objective function. [Link] implies that there must be a convex region satisfying all the constraints. [Link] points of the convex region gives the optimum solution. Answer:A. [Link] method can be used only when the decision variables is___________. [Link] than 3. [Link] than1. [Link]. [Link]. Answer:C. [Link] an LPP the Objective function is to be____________. [Link]. [Link]. [Link] or maximized. [Link]. Answer:C . [Link] region on the graph sheet with satisfies the constraints including the non- negativity restrictions is called the _______ space. [Link]. [Link]. [Link]. [Link]. Answer:A. [Link] __________ is the method available for solving an L.P.P are. [Link] method. [Link] cost method. [Link] method. [Link] method. Answer:A. [Link] initial solution of a transportation problem can b obtained by applying any known method. However, the only condition is that__________. [Link] solution be optimal. [Link] rim conditions are satisfied. [Link] solution not be degenerate. [Link] degenerate. Answer:B. [Link] disadvantage of using north west corner rule to find initial solution to the transportation problem is that_____________. [Link] is difficult to use. [Link] does not take into account cost of transportation. [Link] leads to a degenerate initial solution. [Link] cost is maximum. Answer:B. [Link] solution of a transportation problem with m rows and n-columns is feasible if number of positive allocations are__________. a.m+n. [Link]. c.m+n-1.

d.m+n+1. Answer:C. [Link] total supply is equal to total demand in a transportation problem, the problem is said to be__________. [Link]. [Link]. [Link]. [Link]-degenerate. Answer:A. [Link] of the following is methods is used to verify the optimality of the current solution of the transportation problem__________. [Link] cost method. [Link] method. [Link] west corner rule. [Link] method. Answer:D. [Link] method used for solving an assignment problem is called____________. [Link] matrix method. [Link] method. [Link] method. [Link] method. Answer:C. [Link] purpose of dummy row or column in an assignment problem is to_________. [Link] balance between total activities and total resources. [Link] a solution from becoming degenerate. [Link] a means of representing a dummy problem. [Link] one of the above. Answer:A. [Link] assignment problem is said to be a balanced one if__________. [Link] of rows is equal to columns. [Link] of rows is greater than columns. [Link] of columns is greater to rows. [Link] one of the above. Answer:A. [Link] optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to number of_________. [Link] or columns. [Link] and columns. [Link]+columns-1. [Link]. Answer:C. [Link] theory models are classified by the__________. [Link] of players. [Link] of all payoffs. [Link] of strategies. [Link] the above.

Answer:D. [Link] a mixed strategy game____________. [Link] saddle point exists. [Link] point exists. [Link] player selects same strategy. [Link] player selects different strategy. Answer:A. [Link] theory is the study of___________. [Link] optimal strategies. [Link] conflict between players. [Link] 1and 2. [Link] 1 or 2. Answer:A. [Link] size of the payoff matrix of a game can be reduced by using the principle of___________. [Link] inversion. [Link] reduction. [Link]. [Link] combination. Answer:C. 96.A saddle point exists_________. [Link]=minimax. [Link]=maximin. [Link]=maximax. [Link]=maximax. Answer:A. [Link] 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___________. [Link] game. [Link]-sum game. [Link] game. [Link] game. Answer:B. [Link] which involve more than 2 players___________. [Link] games. [Link] games. [Link]-sum game. d.n person games. Answer:D. [Link] maximin and minimax values of the game exists then_____________. [Link] exists. [Link] solution exists. [Link] is mixed. [Link] point exists. Answer:D. [Link] payoff value for which each player in a game always select the same strategy is called the__________. [Link] point.

[Link] point. [Link] 1 and 2. [Link]. Answer:C. 101.A mixed strategy game can be solved by___________. [Link] method. [Link] method. [Link] method. [Link] 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. [Link] 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. [Link] 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. [Link] 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. [Link] 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. [Link] interarrival time is 10 minutes the arrival rate is ________ . a.8. b.1/10. c.3. d.2. Answer:A . [Link] 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. [Link] mean and standard deviation of exponential distribution are _________. a. Equal. b. Mean>s. d. c. Mean< s. d. d. None of these. Answer: C . [Link] 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. [Link] 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.

[Link] 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. [Link] 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. [Link] 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. [Link] 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. [Link] 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. [Link] 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. [Link] 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. [Link] 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. [Link] 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. [Link] 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. [Link] 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. [Link] traffic intensity for M/M/1 system is given by ________. a. p=/. b. p=/. c. p= . d. None of these. Answer: A. [Link] 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. [Link] M/M/1 system, the expected waiting time in the queue is ________. a. / . b. / (-). c. / -. d. None of these. Answer: B . [Link] 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.. [Link] 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. [Link] 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. [Link]=1/16. c. Pn=1/3. d. None of these. Answer: B. [Link] pn be the probability of n units in the system then expected number of units Ls in the system are_________. a. b. . .

c. . [Link] of these. Answer : A. [Link] 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. [Link] 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. [Link] formula states the relationship between [Link] ,Wq and . [Link] , Lq and . [Link] , Ls and . [Link] of these. Answer:C. [Link] M/M/1 system, the expected queuing length is a. .

b.

c. . [Link] of these. Answer:B [Link] _________ constitutes a convex set. [Link] solution. [Link] slution [Link] solution. [Link] of the above. Answer : A. [Link] feasible solution which optimize the objective function of general linear programming problem is called an _________________ to that linear programming problem. [Link] basic feasible solution [Link] feasible solution. [Link] solution. [Link] of the above.

Answer : B. [Link] that must be completed immediately prior to the start of another activity are called__________. a. predecessor activity. [Link] activity. [Link] activity. [Link] of the above. Answer: A. [Link] that cannot be started until one or more of the other activities are completed, but immediately succeed them are called [Link] activity. [Link] activity. [Link] activity. [Link] of the above. Answer: B. [Link] which can be accomplished concurrently are known as ___________ . [Link] activity. [Link] activity. [Link] activity. [Link] of the above. Answer: C. [Link] more than one activity comes and joins, the event is known as___________. [Link] activity. [Link] activity. [Link] activity. [Link] events. Answer: D. 158.A complete network diagram should have _________________ . [Link] start point and one finish point. [Link] start points and one finish point [Link] start point and two finish points. [Link] start points and one finish point. Answer: A. [Link] jobs have been built into a closed network _________can be allocated to events from the beginning to the end of the network. [Link]. [Link]. [Link]. [Link] of the above. Answer: A. 160.___________ arrows are used to avoid ambiguity. a. blank. [Link]. [Link] [Link] of the above. Answer: B [Link] activities must start and finish with an ____________. [Link]. [Link].

[Link]. [Link]. Answer: D. [Link] models discuss the problem where we wish to ________? [Link] operational (maintenance)cost b. Minimize operational cost [Link] setup cost d. Minimize setup cost Answer: B. [Link] certain replacement model,the average maintanence cost of the system remains [Link] it better to replace the item on the decision made on maintanence cost_____? [Link]. [Link]. [Link] say. [Link] of these. Answer: B. [Link] problems are associated with ________? [Link] cost. [Link] cost. [Link] of the equipments. [Link] of these. Answer: B. [Link] the equipment starts deteriorating with respect to time,its maintanence cost gradually starts _________? [Link]. [Link]. [Link]. [Link] 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 [Link] 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. [Link] critical activities form a chain running through the network which is called the __________. [Link]. [Link] path. [Link]. [Link] activity Answer: D [Link] path which takes the ____________ constitutes the critical path. [Link] path. [Link] path. [Link] path.

[Link] of these. Answer: A. 169. The slack of an event is the difference between the latest and earliest event times are known as ________ . [Link]. [Link] events. [Link] path. [Link] activities. Answer: B. [Link] with zero total float are known as ___________. a. event. [Link] events. [Link] path. [Link] activities. Answer: D. [Link] sequence of critical activities in a network is called ___________ . [Link] path. [Link] events. [Link] activity. [Link] activity. Answer: A. 172._________ is the earliest possible time at which an activity can start. [Link] start time. [Link] finish time. [Link] start time. [Link] finish time. Answer: A. 173. ___________ of an activity is the earliest possible time at which an activity can finish. [Link] start time. [Link] finish time. [Link] start time. [Link] finish time. Answer: B. 174.__________ is found by taking the latest event time of the finish event. [Link] start time. [Link] finish time. [Link] start time. [Link] 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. [Link] start time. [Link] finish time. [Link] start time. [Link] finish time. Answer: C. 176.__________ is the time by which its associated activity must be reduced for the project to meet the target time.

[Link] float. [Link] float. [Link] float. [Link] float. Answer: A. 177.__________ is the difference between the latest and earliest event times. [Link] float. [Link] float. [Link]. [Link] float. Answer: C. 178.____________ is the difference between the latest start time and earliest start time of that activity. [Link] float. [Link] float. [Link] float. [Link] 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. [Link] float. [Link] float. [Link] float. [Link] 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. [Link] float. [Link] float. [Link] float. [Link] float. Answer: C. [Link] is designed for scheduling_____________ that involve many inter-related tasks. a. complex projects. [Link] problems. [Link] problems. [Link] problems. Answer: A. 182. _________ is time estimate of an activity when everything is assumed to go well as per plan. [Link] time. [Link] likely time. [Link] time. [Link] of the above. Answer: A. 183. _____________ is time which the activity will take most frequently if performed a number of times-the modal value.

[Link] time. [Link] likely time. [Link] time. [Link] of the above. Answer: B. 184. _________ is the unlikely but possible performance time if what ever could go wrong, goes wrong in series. [Link] time. [Link] likely time. [Link] time. [Link] of the above. Answer:C. 185.___________ is generally used for those projects where time required to complete various activities is not known a priori. [Link] [Link]. [Link] model [Link] 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. [Link] [Link]. [Link] model [Link] 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. [Link] [Link] theory. [Link] model [Link] model. Answer: B. 188._________ is the probability of failure increases with increase in the life of an item. [Link] failure. [Link] failure. [Link] failure. [Link] 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. [Link] failures. [Link] failures. [Link] failures [Link] 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. [Link] failure.

[Link] failure. [Link] failure. [Link] 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___ . [Link] cost and operating cost. [Link] cost and salvage cost. [Link] cost and maintenance cost. [Link] cost and purchasing cost. Answer: A. 192.________ if the operating cost of next period is greater than the weighted average of the previous costs. [Link]. [Link]. [Link] replace [Link] of the above. Answer: A. 193. Which of the following is not a main element of the project management process? [Link]. [Link] design. [Link] [Link]. Answer: B. 194. Which of the following is not a main project objective? [Link] [Link]. [Link] [Link]. Answer: A. 195. Which of the following is a main PRINCE project aim? [Link] on schedule. [Link] specified quantity. [Link] within budget. [Link] specified quality. Answer: C. [Link] of the following is an integer linear programming problem? [Link] problem. [Link] problem. [Link] dual problem. [Link] of these. Answer: B. 197.A feasible solution is said to be optimal if it ___________ the total transportation problem. [Link]. [Link]. c.m+n-1. [Link] of these. Answer: A.

[Link] analysis provides a formal framework for studying the _____________ process. [Link] programming problem. [Link] making process. [Link]-linear programming problem. [Link] 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. [Link]. [Link] of nature. [Link] decision maker. [Link] 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. [Link] tree diagram. [Link] programming problem. [Link] theorem. [Link] of these. Answer: A.

SUBJECT HANDLED BY :[Link] PERCIAL