McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Bachelor of Science in Computer Science (BSc CS) .
| 51. |
When we solve a system of simultaneous linear equations by using two-phase method, the values of decision variables will be _______. |
| A. | positive |
| B. | negative |
| C. | zero |
| D. | positive and/or negative |
| Answer» D. positive and/or negative | |
| 52. |
The transportation problem deals with the transportation of ________. |
| A. | a single product from a source to several destinations |
| B. | a single product from several sources to several destinations |
| C. | a single product from several sources to a destination |
| D. | a multi -product from several sources to several destinations |
| Answer» A. a single product from a source to several destinations | |
| 53. |
The transportation problem is balanced, if _______. |
| A. | total demand and total supply are equal and the number of sources equals the number of destinations. |
| B. | none of the routes is prohibited |
| C. | total demand equals total supply irrespective of the number of sources and destinations |
| D. | number of sources matches with number of destinations |
| Answer» C. total demand equals total supply irrespective of the number of sources and destinations | |
| 54. |
The calling population is considered to be infinite when ________. |
| A. | all customers arrive at once |
| B. | capacity of the system is infinite |
| C. | service rate is faster than arrival rate |
| D. | arrivals are independent of each other |
| Answer» B. capacity of the system is infinite | |
| 55. |
The assignment problem is a special case of transportation problem in which ______. |
| A. | number of origins are less than the number of destinations |
| B. | number of origins are greater than the number of destinations |
| C. | number of origins are greater than or equal to the number of destinations |
| D. | number of origins equals the number of destinations |
| Answer» D. number of origins equals the number of destinations | |
| 56. |
Identify the correct statement |
| A. | an assignment problem may require the introduction of both dummy row and dummy column |
| B. | an assignment problem with m rows and n columns will involves a total of m x n possible assignments |
| C. | an unbalanced assignment is one where the number of rows is more than, or less than the number of columns |
| D. | balancing any unbalanced assignment problem involves adding one dummy row or column |
| Answer» C. an unbalanced assignment is one where the number of rows is more than, or less than the number of columns | |
| 57. |
The minimum number of lines covering all zeros in a reduced cost matrix of order n can be _____. |
| A. | at the most n |
| B. | at the least n |
| C. | n-1 |
| D. | n+1 |
| Answer» A. at the most n | |
| 58. |
In an assignment problem involving 5 workers and 5 jobs, total number of assignments possible are _______. |
| A. | 5 |
| B. | 10 |
| C. | 15 |
| D. | 25 |
| Answer» A. 5 | |
| 59. |
In marking assignments, which of the following should be preferred? |
| A. | Only row having single zero |
| B. | Only column having single zero |
| C. | Only row/column having single zero |
| D. | Column having more than one zero |
| Answer» C. Only row/column having single zero | |
| 60. |
The average arrival rate in a single server queuing system is 10 customers per hour and average service rate is 15 customers per hour. The average time that a customer must wait before it is taken up for service shall be _______minutes. |
| A. | 6 |
| B. | 8 |
| C. | 12 |
| D. | 20 |
| Answer» B. 8 | |
| 61. |
Customers arrive at a box office window, being manned ny single individual, according to Poisson input process with mean rate of 20 per hour, while the mean service time is 2 minutes. Which of the following is not true for this system? |
| A. | E(n) = 2 customers |
| B. | E(m) = 4/3 customers |
| C. | E(v) = 6 minutes |
| D. | E(w) = 16 minutes |
| Answer» A. E(n) = 2 customers | |
| 62. |
A petrol pump has two pumps; Vehicles arrive at the petrol pump according to poison input process at average of 12 per hour. The service time follows exponential distribution with a mean of 4 minutes. The pumps are expected to be idle for _____. |
| A. | 33% |
| B. | 43% |
| C. | 53% |
| D. | 65% |
| Answer» B. 43% | |
| 63. |
The initial solution of a transportation problem can be 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. | the solution be degenerate |
| Answer» B. the rim conditions are satisfied | |
| 64. |
An assignment problem can be solved by______. |
| A. | Simplex Method |
| B. | Transportation Method |
| C. | Dual simplex method |
| D. | Simplex and Transportation Method |
| Answer» D. Simplex and Transportation Method | |
| 65. |
A game is said to be fair if___ |
| A. | both upper and lower values of the game are same and zero |
| B. | upper and lower values of the game are not equal |
| C. | upper values is more than lower value of the game |
| D. | lower values is more than upper value of the game |
| Answer» A. both upper and lower values of the game are same and zero | |
| 66. |
A mixed strategy game can be solved by ____. |
| A. | Simplex Method |
| B. | Dual Simplex Method |
| C. | Transportation Method |
| D. | Graphical Method |
| Answer» D. Graphical Method | |
| 67. |
When the sum of gains of one player is equal to the sum of losses to another player in a game, this situation is known as_____. |
| A. | two person game |
| B. | zero-sum game |
| C. | two person zero sum game |
| D. | non zero sum game |
| Answer» B. zero-sum game | |
| 68. |
The critical path satisfy the condition that _____. |
| A. | Ei=Li and Ej=Lj |
| B. | Ei-Li=Ej-Lj |
| C. | Lj-Ei=Li-Ej |
| D. | Lj+Ei=Li+Ej |
| Answer» A. Ei=Li and Ej=Lj | |
| 69. |
In Program Evaluation Review Technique the maximum time that is required to perform the activity under extremely bad conditions is known as_____. |
| A. | normal time |
| B. | optimistic time |
| C. | most likely time |
| D. | pessimistic time |
| Answer» D. pessimistic time | |
| 70. |
._____is a mathematical technique used to solve the problem of allocating limited resource among the competing activities |
| A. | Linear Programming problem |
| B. | Assignment Problem |
| C. | Replacement Problem |
| D. | Non linear Programming Problem |
| Answer» A. Linear Programming problem | |
| 71. |
The Hungarian method used for finding the solution of the assignment problem is also called ___________. |
| A. | Vogel's Approximation Method |
| B. | Modi Method |
| C. | Simplex Method |
| D. | Dual Simplex Method |
| Answer» B. Modi Method | |
| 72. |
Traveling salesman problem will have a total of _____different sequences. |
| A. | n! |
| B. | n-1 |
| C. | (n-a)!. |
| D. | n |
| Answer» D. n | |
| 73. |
In the production lot size model, increasing the rate of production _______ . |
| A. | increase the optimal number of orders to place each year |
| B. | does not influence the optimal number of orders |
| C. | decrease the optimal number of orders to place each year |
| D. | exactly the optimal number of orders to place each year. |
| Answer» A. increase the optimal number of orders to place each year | |
| 74. |
The __________ time for an activity can be reduced by using increased resources. |
| A. | normal |
| B. | optimistic |
| C. | pessimistic |
| D. | most likely |
| Answer» A. normal | |
| 75. |
Graphical method of linear programming is useful when the number of decision variable are _______ |
| A. | 2 |
| B. | 3 |
| C. | 4 |
| D. | 1 |
| Answer» A. 2 | |
| 76. |
The activity cost corresponding to the crash time is called the _____. |
| A. | critical time |
| B. | normal time |
| C. | cost slope |
| D. | crash cost |
| Answer» D. crash cost | |
| 77. |
The irreducible minimum duration of the project is called______. |
| A. | critical time |
| B. | crashed duration |
| C. | cost slope |
| D. | crash cost |
| Answer» B. crashed duration | |
| 78. |
In the network, only one activity may connect any _______nodes |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» B. 2 | |
| 79. |
If the constraints of an Linear Programming Problem has an in equation of greater than or equal to type, the variable to be added to are ___________ |
| A. | slack |
| B. | surplus |
| C. | artificial |
| D. | decision |
| Answer» B. surplus | |
| 80. |
If the constraint of an Linear Programming Problem has an in equation of less than or equal to type, the variables to be added are__________ |
| A. | slack |
| B. | surplus |
| C. | artificial |
| D. | decision |
| Answer» A. slack | |
| 81. |
A feasible solution of an Linear Programming Problem that optimizes then the objective function is called _________ |
| A. | basic feasible solution |
| B. | optimum solution |
| C. | feasible solution |
| D. | solution |
| Answer» B. optimum solution | |
| 82. |
A set of feasible solution to a Linear Programming Problem is ___________ |
| A. | convex |
| B. | polygon |
| C. | triangle |
| D. | bold |
| Answer» A. convex | |
| 83. |
The cost of a slack variable is _________. |
| A. | zero |
| B. | 1 |
| C. | 2 |
| D. | -1 |
| Answer» A. zero | |
| 84. |
The cost of a surplus variable is _________. |
| A. | zero |
| B. | 1 |
| C. | 2 |
| D. | -1 |
| Answer» A. zero | |
| 85. |
If all the constraints of the primal problem in equations are of type less than or equal to then the constraints in the dual problem is ___________. |
| A. | less than or equal to |
| B. | greater than or equal to |
| C. | equal to |
| Answer» B. greater than or equal to | |
| 86. |
In an Linear Programming Problem functions to be maximized or minimized are called ___________. |
| A. | constraints |
| B. | objective function |
| C. | basic solution |
| D. | feasible solution |
| Answer» B. objective function | |
| 87. |
Linear Programming Problem that can be solved by graphical method has______. |
| A. | linear constraints |
| B. | quadratic constraints |
| C. | non linear constraints |
| D. | bi-quadratic constraints |
| Answer» A. linear constraints | |
| 88. |
Charnes method of penalty is called __________ |
| A. | Simplex Method |
| B. | Dual Simplex Method |
| C. | Big-M Method |
| D. | Graphical Method |
| Answer» C. Big-M Method | |
| 89. |
If the primal problem has n constraints and m variables then the number of constraints in the dual problem is __________. |
| A. | mn |
| B. | m+n |
| C. | m-n |
| D. | m/n |
| Answer» A. mn | |
| 90. |
Graphical method is also known as ___________. |
| A. | Simplex Method |
| B. | Dual Simplex Method |
| C. | Big-M Method |
| D. | Search Approach Method |
| Answer» D. Search Approach Method | |
| 91. |
The area bounded by all the given constraints is called _____________. |
| A. | feasible region |
| B. | basic solution |
| C. | non feasible region |
| D. | optimum basic feasible solution |
| Answer» A. feasible region | |
| 92. |
If one or more variable vanish then a basic solution to the system is called ____________. |
| A. | non feasible region |
| B. | feasible region |
| C. | degenerate solution |
| D. | basic solution |
| Answer» C. degenerate solution | |
| 93. |
The non basic variables are called ___________. |
| A. | shadow cost |
| B. | opportunity cost |
| C. | slack variable |
| D. | surplus variable |
| Answer» A. shadow cost | |
| 94. |
If the given Linear Programming Problem is in its canonical form then primal-dual pair is ___________. |
| A. | symmetric |
| B. | unsymmetric |
| C. | square |
| D. | non square |
| Answer» B. unsymmetric | |
| 95. |
If the given Linear Programming Problem is in its standard form then primal-dual pair is ____________. |
| A. | symmetric |
| B. | unsymmetric |
| C. | slack |
| D. | square |
| Answer» B. unsymmetric | |
| 96. |
The dual of the dual is ____________. |
| A. | dual-primal |
| B. | primal-dual |
| C. | dual |
| D. | primal |
| Answer» D. primal | |
| 97. |
Key element is also known as ___________. |
| A. | slack |
| B. | surplus |
| C. | artificial |
| D. | pivot |
| Answer» D. pivot | |
| 98. |
____________ method is an alternative method of solving a Linear Programming Problem involving artificial variables |
| A. | Simplex Method |
| B. | Big-M Method |
| C. | Dual Simplex Method |
| D. | Graphical Mehtod |
| Answer» B. Big-M Method | |
| 99. |
The method used to solve Linear Programming Problem without use of the artificial variable is called __________. |
| A. | Simplex Method |
| B. | Big-M Method |
| C. | Dual Simplex Method |
| D. | Graphical Mehtod |
| Answer» C. Dual Simplex Method | |
| 100. |
All the basis for a transportation problem is ____________. |
| A. | square |
| B. | rectangle |
| C. | triangle |
| D. | polygon |
| Answer» C. triangle | |
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.