McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Bachelor of Business Administration (BBA) , Master of Commerce (M.com) .
| 201. |
The maximise criteria is ........................... |
| A. | Optimistic |
| B. | Pessimistic |
| C. | Neutral |
| D. | None of these |
| Answer» B. Pessimistic | |
| 202. |
Decision making under certainty refers to .............................. situation. |
| A. | Deterministic |
| B. | Probabilistic |
| C. | Competitive |
| D. | None of these |
| Answer» A. Deterministic | |
| 203. |
............................is known as father of game theory. |
| A. | Von Neumann |
| B. | A K Erlang |
| C. | George b Dantzig |
| D. | Arnoff |
| Answer» A. Von Neumann | |
| 204. |
Which of the following is an assumption of game theory? |
| A. | The players act rationally and intelligently |
| B. | Each payer has a finite set of possible courses of action |
| C. | The players attempt to maximise gains or minimises losses |
| D. | All of the above |
| Answer» D. All of the above | |
| 205. |
Each participant of the game is called................... |
| A. | Strategist |
| B. | Winner |
| C. | Player |
| D. | Loser |
| Answer» C. Player | |
| 206. |
The outcome of a game is known as.................... |
| A. | Profit |
| B. | Loss |
| C. | Pay off |
| D. | None of these |
| Answer» C. Pay off | |
| 207. |
A matrix which shows the gains and losses resulting from moves and counter moves is called.................................. |
| A. | Cost matrix |
| B. | Pay off matrix |
| C. | Both a and b |
| D. | None of these |
| Answer» B. Pay off matrix | |
| 208. |
When all the players of the game follow their optimal strategies, then the expected pay off of the game is called....................... |
| A. | Gain of the game |
| B. | Loss of the game |
| C. | Value of the game |
| D. | None of these |
| Answer» C. Value of the game | |
| 209. |
The position in the pay off matrix where the maximin coincides with the minimax. |
| A. | Saddle point |
| B. | Break even point |
| C. | Pivot point |
| D. | None of the above |
| Answer» A. Saddle point | |
| 210. |
A game is said to be fair if the value of the game is......................... |
| A. | One |
| B. | Two |
| C. | Three |
| D. | Zero |
| Answer» D. Zero | |
| 211. |
In a ........................game the amounts won by all winners together is equal to the sum of the amounts lost by all losers together. |
| A. | Non-zero sum game |
| B. | Zero sum game |
| C. | Rectangular game |
| D. | None of these |
| Answer» B. Zero sum game | |
| 212. |
Which of the following method is used to solve mixed strategy problems: |
| A. | Probability method |
| B. | Graphic method |
| C. | Linear Programming method |
| D. | All of the above |
| Answer» D. All of the above | |
| 213. |
A queue is formed when the demand for a service: |
| A. | Exceeds the capacity to provide that service |
| B. | Is less than the capacity to provide that service |
| C. | a or b |
| D. | None of these |
| Answer» A. Exceeds the capacity to provide that service | |
| 214. |
Queuing theory is also termed as ............................ |
| A. | Game theory |
| B. | Replacement theory |
| C. | Waiting line theory |
| D. | None of these |
| Answer» C. Waiting line theory | |
| 215. |
In queuing theory, ...................... refers to those waiting in a queue or receiving service. |
| A. | Service provider |
| B. | Customer |
| C. | Both a and b |
| D. | None of these |
| Answer» B. Customer | |
| 216. |
In queuing theory, ...................... is a person by whom service is rendered. |
| A. | Customer |
| B. | Server |
| C. | a or b |
| D. | none of these |
| Answer» B. Server | |
| 217. |
In waiting line theory, number of customers waiting in the queue is referred to as ................ |
| A. | Traffic intensity |
| B. | Queuing system |
| C. | Service pattern |
| D. | Queue length |
| Answer» D. Queue length | |
| 218. |
Number of customers in the queue per unit of time is called ...................... |
| A. | Queuing system |
| B. | Length of queue |
| C. | Average length of queue |
| D. | None of these |
| Answer» C. Average length of queue | |
| 219. |
The ration between mean arrival rate and mean service rate is called ................... |
| A. | Idle period |
| B. | Average length of queue |
| C. | Traffic intensity |
| D. | None of these |
| Answer» C. Traffic intensity | |
| 220. |
Commonly assumed probability distribution of arrival pattern is ....................... |
| A. | Poisson distribution |
| B. | Binomial distribution |
| C. | Normal distribution |
| D. | None of these |
| Answer» A. Poisson distribution | |
| 221. |
Commonly assumed probability distribution of service pattern are ....................... |
| A. | Poisson distribution |
| B. | Exponential distribution |
| C. | Erlang distribution |
| D. | b and c |
| Answer» D. b and c | |
| 222. |
a customer’s behaviour of leaving the queue when he does not like to wait in the queue due to lack of time or space is called ..................... |
| A. | Jockying |
| B. | Reneging |
| C. | Collusion |
| D. | Balking |
| Answer» D. Balking | |
| 223. |
A customer’s behaviour of leaving the queue due to impatience is called ....................... |
| A. | Jockying |
| B. | Reneging |
| C. | Collusion |
| D. | Balking |
| Answer» B. Reneging | |
| 224. |
A customer’s behaviour of jumping from one queue to another is called ............................ |
| A. | Jockying |
| B. | Reneging |
| C. | Collusion |
| D. | Balking |
| Answer» A. Jockying | |
| 225. |
In queuing theory, ............................ stands for mean arrival rate of customers. |
| A. | μ |
| B. | λ |
| C. | t |
| D. | none of these |
| Answer» B. λ | |
| 226. |
In queuing theory, ............................ stands for mean service rate. |
| A. | μ |
| B. | λ |
| C. | t |
| D. | none of these |
| Answer» A. μ | |
| 227. |
...................... is a method of analysing the current movement of the some variable in an effort to predict the future movement of the same variable. |
| A. | Goal programming |
| B. | Queuing theory |
| C. | Markov Analysis |
| D. | Replacement theory |
| Answer» C. Markov Analysis | |
| 228. |
Initial feasible solution to a transportation problem arrived through which of the following method is very near to the optimal solution: |
| A. | NWCM |
| B. | LCM |
| C. | VAM |
| D. | None of these |
| Answer» C. VAM | |
| 229. |
In Transportation Problem, NWCM stands for ............................. |
| A. | North West Cost Method |
| B. | Net Worth Corner Method |
| C. | North West Corner Method |
| D. | None of these |
| Answer» C. North West Corner Method | |
| 230. |
In Transportation Problem, LCM stands for ............................. |
| A. | Lowest Common Multiplier |
| B. | Least Cost Method |
| C. | Lowest Cell Method |
| D. | None of these |
| Answer» B. Least Cost Method | |
| 231. |
Matrix Minima Method to find initial feasible solution to a TP is also called ....................... |
| A. | NWCM |
| B. | LCM |
| C. | VAM |
| D. | None of these |
| Answer» C. VAM | |
| 232. |
MODI Method to test the optimality of a feasible solution to TP is also called............... |
| A. | Stepping Stone Method |
| B. | u. v. Method |
| C. | both a and b |
| D. | none of these |
| Answer» B. u. v. Method | |
| 233. |
............................refers to the manner in which the customers behave while being in the queue. |
| A. | Service pattern |
| B. | Service pattern |
| C. | Queue discipline |
| D. | None of these |
| Answer» C. Queue discipline | |
| 234. |
Excess of service facilities over and above the number of customers results: |
| A. | Idleness of service capacity |
| B. | Queues |
| C. | Both a and b |
| D. | None of these |
| Answer» A. Idleness of service capacity | |
| 235. |
................................was the first person who developed a viable queueing theory |
| A. | Von Neumann |
| B. | Morgenstern |
| C. | H M Wagner |
| D. | Simeon Dennis Poisson |
| Answer» D. Simeon Dennis Poisson | |
| 236. |
Traffic intensity in Queuing Theory is also called........................... |
| A. | Service factor |
| B. | Arrival factor |
| C. | Utilisation factor |
| D. | None of these |
| Answer» C. Utilisation factor | |
| 237. |
Traffic intensity is computed by using the formula: |
| A. | λ/μ |
| B. | μ/λ |
| C. | 1- λ/μ |
| D. | 1- μ/λ |
| Answer» A. λ/μ | |
| 238. |
Game theory became popular when the book “Theory of Games and Economic Behaviour” was published in 1944 by .............................. |
| A. | Von Neumann |
| B. | Mc Closky |
| C. | Von-Neumann and Mc Closky |
| D. | Von-neumann and Morgenstern |
| Answer» D. Von-neumann and Morgenstern | |
| 239. |
Which of the following is a characteristic of a dual problem: |
| A. | Dual of a dual is primal |
| B. | If dual has a finite optimal solution, then the primal also has finite optimal solution |
| C. | If dual has no feasible solution, then the primal also has no feasible solution |
| D. | All of the above |
| Answer» D. All of the above | |
| 240. |
Shadow price is also called ...................... |
| A. | Dual price |
| B. | Unit price |
| C. | Total cost |
| D. | None of these |
| Answer» A. Dual price | |
| 241. |
................................is that element of the simplex table which lis both in the key row and key column. |
| A. | Key element |
| B. | Pivot element |
| C. | Both a and b |
| D. | None of these |
| Answer» C. Both a and b | |
| 242. |
Transportation model was first introduced by ........................ in the year 1941. |
| A. | T C Koopman |
| B. | George B Dantzig |
| C. | Von-neumann |
| D. | F L Hitchcock |
| Answer» D. F L Hitchcock | |
| 243. |
VAM is also called........................ |
| A. | Matrix Minima Method |
| B. | Penalty Method |
| C. | MODI Method |
| D. | None of these |
| Answer» B. Penalty Method | |
| 244. |
Which of the following methods is used to solve an assignment problem: |
| A. | Enumeration Method |
| B. | Hungarian Method |
| C. | Simplex Method |
| D. | All of the above |
| Answer» D. All of the above | |
| 245. |
Hungarian method was developed by ........................ |
| A. | T C Koopman |
| B. | F L Hitchcock |
| C. | D Konig |
| D. | George B Dantzig |
| Answer» C. D Konig | |
| 246. |
.................... is the popular method for solving an assignment problem. |
| A. | Hungarian Method |
| B. | Enumeration Method |
| C. | Simplex Method |
| D. | None of the above |
| Answer» A. Hungarian Method | |
| 247. |
The outlet where the services are being provided to the customers is called................. |
| A. | Waiting line |
| B. | Service facility |
| C. | Idle facility |
| D. | Traffic intensity |
| Answer» B. Service facility | |
| 248. |
The variables which can be manipulated by the decision maker are called.................... |
| A. | Controllable variables |
| B. | Uncontrollable variables |
| C. | Both a and b |
| D. | None of these |
| Answer» A. Controllable variables | |
| 249. |
The variables which cannot be manipulated by the decision maker are called.................... |
| A. | Controllable variables |
| B. | Uncontrollable variables |
| C. | Both a and b |
| D. | None of these |
| Answer» B. Uncontrollable variables | |
| 250. |
Controllable variables are also called.................................. |
| A. | Slack variables |
| B. | Surplus variables |
| C. | Artificial variable |
| D. | Decision variables |
| Answer» D. Decision variables | |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.