McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Bachelor of Computer Applications (BCA) , Bachelor of Management Studies (BMS) .
| 101. |
‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ are the representation of reality |
| A. | Models |
| B. | Phases |
| C. | Both A and B |
| D. | None of the above |
| Answer» A. Models | |
| 102. |
‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ are called mathematical models |
| A. | Iconic Models |
| B. | Analogue Models |
| C. | Symbolic Models |
| D. | None of the above |
| Answer» C. Symbolic Models | |
| 103. |
It is not easy to make any modification or improvement in |
| A. | Iconic Models |
| B. | Analogue Models |
| C. | Symbolic Models |
| D. | None of the above |
| Answer» C. Symbolic Models | |
| 104. |
In ‐‐‐‐‐‐‐‐‐‐ models one set of properties is used to represent another set of properties |
| A. | Iconic Models |
| B. | Analogue Models |
| C. | Symbolic Models |
| D. | None of the above |
| Answer» A. Iconic Models | |
| 105. |
Allocation Models are ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Iconic models |
| B. | Analogue Models |
| C. | Symbolic Models |
| D. | None of the above |
| Answer» C. Symbolic Models | |
| 106. |
Probabilistic models are also known as |
| A. | Deterministic Models |
| B. | Stochastic Models |
| C. | Dynamic Models |
| D. | Static Models |
| Answer» B. Stochastic Models | |
| 107. |
‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ models assumes that the values of the variables do not change with time during a particular period |
| A. | Static Models |
| B. | Dynamic Models |
| C. | Both A and B |
| D. | None of the above |
| Answer» A. Static Models | |
| 108. |
A ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ models considers time as one of the important variable |
| A. | Static Models |
| B. | Dynamic Models |
| C. | Both A and B |
| D. | None of the above |
| Answer» B. Dynamic Models | |
| 109. |
Replacement Model is a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ model |
| A. | Static Models |
| B. | Dynamic Models |
| C. | Both A and B |
| D. | None of the above |
| Answer» B. Dynamic Models | |
| 110. |
‐‐‐‐‐‐‐‐‐‐‐‐‐‐ may be defined as a method of determining an optimum programme inter dependent activities in view of available resources |
| A. | Goal Programming |
| B. | Linear Programming |
| C. | Decision Making |
| D. | None of the above |
| Answer» B. Linear Programming | |
| 111. |
‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ are expressed is n the form of inequities or equations |
| A. | Constraints |
| B. | Objective Functions |
| C. | Both A and B |
| D. | None of the above |
| Answer» A. Constraints | |
| 112. |
The objective functions and constraints are linear relationship between ‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Variables |
| B. | Constraints |
| C. | Functions |
| D. | All of the above |
| Answer» A. Variables | |
| 113. |
Assignment problem helps to find a maximum weight identical in nature in a weighted ‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Tripartite graph |
| B. | Bipartite graph |
| C. | Partite graph |
| D. | None of the above |
| Answer» B. Bipartite graph | |
| 114. |
All the parameters in the linear programming model are assumed to be ‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Variables |
| B. | Constraints |
| C. | Functions |
| D. | None of the above |
| Answer» B. Constraints | |
| 115. |
The solution need not be in ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ numbers |
| A. | Prime Number |
| B. | Whole Number |
| C. | Complex Number |
| D. | None of the above |
| Answer» B. Whole Number | |
| 116. |
Graphic method can be applied to solve a LPP when there are only ‐‐‐‐‐‐‐‐‐‐‐‐‐ variable |
| A. | One |
| B. | More than One |
| C. | Two |
| D. | Three |
| Answer» C. Two | |
| 117. |
If the feasible region of a LPP is empty, the solution is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Infeasible |
| B. | Unbounded |
| C. | Alternative |
| D. | None of the above |
| Answer» A. Infeasible | |
| 118. |
The variables whose coefficient vectors are unit vectors are called ‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Unit Variables |
| B. | Basic Variables |
| C. | Non basic Variables |
| D. | None of the above |
| Answer» B. Basic Variables | |
| 119. |
Any column or raw of a simplex table is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Vector |
| B. | Key column |
| C. | Key Raw |
| D. | None of the above |
| Answer» A. Vector | |
| 120. |
A minimization problem can be converted into a maximization problem by changing the sign of coefficients in the ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Constraints |
| B. | Objective Functions |
| C. | Both A and B |
| D. | None of the above |
| Answer» B. Objective Functions | |
| 121. |
If in a LPP , the solution of a variable can be made infinity large without violating the constraints, the solution is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Infeasible |
| B. | Unbounded |
| C. | Alternative |
| D. | None of the above |
| Answer» B. Unbounded | |
| 122. |
In maximization cases , ‐‐‐‐‐‐‐‐‐‐‐‐‐ are assigned to the artificial variables as their coefficients in the objective function |
| A. | +m |
| B. | –m |
| C. | 0 |
| D. | None of the above |
| Answer» A. +m | |
| 123. |
In simplex method , we add ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ variables in the case of ‘=’ |
| A. | Slack Variable |
| B. | Surplus Variable |
| C. | Artificial Variable |
| D. | None of the above |
| Answer» C. Artificial Variable | |
| 124. |
In simplex method, if there is tie between a decision variable and a slack (or surplus) variable, ‐‐‐ ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ should be selected |
| A. | Slack variable |
| B. | Surplus variable |
| C. | Decision variable |
| D. | None of the above |
| Answer» C. Decision variable | |
| 125. |
A BFS of a LPP is said to be ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ if at least one of the basic variable is zero |
| A. | Degenerate |
| B. | Non‐degenerate |
| C. | Infeasible |
| D. | Unbounded |
| Answer» A. Degenerate | |
| 126. |
In LPP, degeneracy occurs in ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ stages |
| A. | One |
| B. | Two |
| C. | Three |
| D. | Four |
| Answer» B. Two | |
| 127. |
Every LPP is associated with another LPP is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Primal |
| B. | Dual |
| C. | Non‐linear programming |
| D. | None of the above |
| Answer» B. Dual | |
| 128. |
As for maximization in assignment problem, the objective is to maximize the ‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Profit |
| B. | optimization |
| C. | cost |
| D. | None of the above |
| Answer» A. Profit | |
| 129. |
If there are more than one optimum solution for the decision variable the solution is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Infeasible |
| B. | Unbounded |
| C. | Alternative |
| D. | None of the above |
| Answer» C. Alternative | |
| 130. |
Dual of the dual is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Primal |
| B. | Dual |
| C. | Alternative |
| D. | None of the above |
| Answer» A. Primal | |
| 131. |
Operations Research approach is |
| A. | Multi‐disciplinary |
| B. | Scientific |
| C. | Initiative |
| D. | All of the above |
| Answer» A. Multi‐disciplinary | |
| 132. |
For analyzing the problem , decision – makers should normally study |
| A. | Its qualitative aspects |
| B. | Its quantitative aspects |
| C. | Both A and B |
| D. | Neither A and B |
| Answer» A. Its qualitative aspects | |
| 133. |
Decision variables are |
| A. | Controllable |
| B. | Uncontrollable |
| C. | Parameters |
| D. | None of the above |
| Answer» D. None of the above | |
| 134. |
The issue of decision models |
| A. | Is possible when the variable’s value is |
| B. | Reduces the scope of judgment and intuition known with certainty in decision making |
| C. | Requires the knowledge of computer software use |
| D. | None of the above |
| Answer» D. None of the above | |
| 135. |
‐‐‐‐‐‐‐‐‐‐‐‐‐ is one of the fundamental combinatorial optimization problems. |
| A. | Assignment problem |
| B. | Transportation problem |
| C. | Optimization Problem |
| D. | None of the above |
| Answer» A. Assignment problem | |
| 136. |
An optimization model |
| A. | Mathematically provides the best decision |
| B. | Provides decision within its limited context |
| C. | Helps in evaluating various alternatives constantly |
| D. | All of the above |
| Answer» D. All of the above | |
| 137. |
The quantitative approach to decision analysis is a |
| A. | Logical approach |
| B. | Rational approach |
| C. | Scientific approach |
| D. | All of the above |
| Answer» C. Scientific approach | |
| 138. |
Operations Research approach is typically based on the use of |
| A. | Physical model |
| B. | Mathematical model |
| C. | Iconic model |
| D. | Descriptive model |
| Answer» B. Mathematical model | |
| 139. |
In a manufacturing process, who takes the decisions as to what quantities and which process or processes are to be used so that the cost is minimum and profit is maximum? |
| A. | Supervisor |
| B. | Manufacturer |
| C. | Producer |
| D. | Production manager |
| Answer» D. Production manager | |
| 140. |
Linear programming has been successfully applied in ‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Agricultural |
| B. | Industrial applications |
| C. | Both A and B |
| D. | Manufacturing |
| Answer» C. Both A and B | |
| 141. |
The term linearity implies ‐‐‐‐‐‐‐‐‐‐‐ among the relevant variables: |
| A. | Straight line |
| B. | Proportional relationships |
| C. | Linear lines |
| D. | Both A and B |
| Answer» D. Both A and B | |
| 142. |
Process refers to the combination of ‐‐‐‐‐‐‐‐‐‐‐‐ inputs to produce a particular output. |
| A. | one or more |
| B. | two or more |
| C. | one |
| D. | None of the above |
| Answer» A. one or more | |
| 143. |
What has always been very important in the business and industrial world, particularly with regard to problems concerning productions of commodities? |
| A. | Linear Programming |
| B. | Production |
| C. | Decision – making |
| D. | None of the above |
| Answer» C. Decision – making | |
| 144. |
What are the main questions before a production manager? |
| A. | Which commodity/ commodities to produce |
| B. | In what quantities |
| C. | By which process or processes |
| D. | All of the above |
| Answer» D. All of the above | |
| 145. |
Who pointed out that the businessman always studies his production function and his input prices and substitutes one input for another till his costs become the minimum possible? |
| A. | Alan Marshall |
| B. | Alfred Marsh |
| C. | Alfred Marshall |
| D. | None of the above |
| Answer» C. Alfred Marshall | |
| 146. |
Who invented a method of formal calculations often termed as ? |
| A. | A.V. Kantorovich |
| B. | L.V. Kantorovich |
| C. | T.S. Kantorovich |
| D. | Alfred Marshall |
| Answer» D. Alfred Marshall | |
| 147. |
Who developed Linear Programming for the purpose of scheduling the complicated procurement activities of the United States Air Force? |
| A. | George B. Dantzig |
| B. | James B. Dantzig |
| C. | George B. Dante |
| D. | George V. Dantzig |
| Answer» A. George B. Dantzig | |
| 148. |
This method of formal calculations often termed as Linear Programming was developed later in which year? |
| A. | 1947 |
| B. | 1988 |
| C. | 1957 |
| D. | 1944 |
| Answer» A. 1947 | |
| 149. |
What is being considered as one of the most versatile management tools? |
| A. | Electronic Computers |
| B. | Linear Programming |
| C. | Computer Programming |
| D. | None of the above |
| Answer» B. Linear Programming | |
| 150. |
LP is a major innovation since ‐‐‐‐‐‐‐‐‐‐‐‐ in the field of business decision – making, particularly under conditions of certainty. |
| A. | Industrial Revolution |
| B. | World War I |
| C. | World War II |
| D. | French Revolution |
| Answer» C. World War II | |
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.