MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 82 Mcqs, each offering curated multiple-choice questions to sharpen your Bachelor of Computer Applications (BCA) knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Who defined Operations Research as scientific method of providing executive departments with a quantitative basis for decisions regarding the operations under their control? |
| A. | Morse and Kimball (1946) |
| B. | P.M.S. Blackett (1948) |
| C. | E.L. Arnoff and M.J. Netzorg |
| D. | None of the above |
| Answer» B. P.M.S. Blackett (1948) | |
| 2. |
Who defined Operations Research as scientific approach to problem solving for executive management ? |
| A. | E.L. Arnoff |
| B. | P.M.S. Blackett |
| C. | H.M. Wagner |
| D. | None of the above |
| Answer» D. None of the above | |
| 3. |
Who defined Operations Research as an aid for the executive in marketing his decisions by providing him with the quantitative information based on the scientific method of analysis ? |
| A. | C. Kitte |
| B. | H.M. Wagner |
| C. | E.L. Arnoff |
| D. | None of the above |
| Answer» B. H.M. Wagner | |
| 4. |
Operations Research simply helps in improving the of the solution but does not result in a perfect solution. |
| A. | Quality |
| B. | Clarity |
| C. | Look |
| D. | None of the above |
| Answer» B. Clarity | |
| 5. |
There is a great scope for working as a team to solve problems of defence by using the Operations Research approach |
| A. | Economists |
| B. | Administrators |
| C. | Statisticians and Technicians |
| D. | All of the above |
| Answer» E. | |
| 6. |
Operations Research involves attack of complex problems to arrive at the optimum solution |
| A. | Scientific |
| B. | Systematic |
| C. | Both A and B |
| D. | Statistical |
| Answer» D. Statistical | |
| 7. |
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» B. Dynamic Models | |
| 8. |
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» B. Dynamic Models | |
| 9. |
Operations Research emphasizes on the overall approach to the system. This charecteristics of Operations Research is often referred as |
| A. | System Orientation |
| B. | System Approach |
| C. | Interdisciplinary Team Approach |
| D. | none |
| Answer» E. | |
| 10. |
Please state which statement is incorrect. (i) Linear programming was first formulated by an English economist L.V. Kantorovich (ii) LP is generally used in solving maximization or minimization problems subject to certain assumptions. |
| A. | (ii) only |
| B. | (i) only |
| C. | Both (i) and( ii) |
| D. | Both are correct |
| Answer» C. Both (i) and( ii) | |
| 11. |
A path formed by allowing horizontal and vertical lines and the entire corner cells of which are occupied is called a |
| A. | Occupied path |
| B. | Open path |
| C. | Closed path |
| D. | None of the above |
| Answer» D. None of the above | |
| 12. |
What is also defined as the non negative variables which are added in the LHS of the constraint to convert the inequality < into an equation? |
| A. | Slack variables |
| B. | Simplex algorithm |
| C. | Key element |
| D. | None of the above |
| Answer» B. Simplex algorithm | |
| 13. |
An assumption that implies that finite numbers of choices are available to a decision maker and the decision variables do not assume negative values is known as |
| A. | Certainty |
| B. | Continuity |
| C. | Finite choices |
| D. | None of the above |
| Answer» D. None of the above | |
| 14. |
What is also defined as the non negative variables which are added in the LHS of the constraint to convert the inequality < into an equation? |
| A. | Slack variables |
| B. | Simplex algorithm |
| C. | Key element |
| D. | None of the above |
| Answer» B. Simplex algorithm | |
| 15. |
An assumption that implies that finite numbers of choices are available to a decision maker and the decision variables do not assume negative values is known as |
| A. | Certainty |
| B. | Continuity |
| C. | Finite choices |
| D. | None of the above |
| Answer» D. None of the above | |
| 16. |
The type of constraint which specifies maximum capacity of a resource is or equal to constraint. |
| A. | less than |
| B. | greater than |
| C. | not greater than |
| D. | not less than |
| Answer» B. greater than | |
| 17. |
Which technique is used in finding a solution for optimizing a given objective, such as profit maximization or cost minimization under certain constraints? |
| A. | Quailing Theory |
| B. | Waiting Line |
| C. | Both A and B |
| D. | Linear Programming |
| Answer» E. | |
| 18. |
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» C. Both A and B | |
| 19. |
Who originally called it Programming of interdependent activities in a linear structure but later shortened it to Linear Programming ? |
| A. | Dantzig |
| B. | Kantorovich |
| C. | Marshall |
| D. | None of the above |
| Answer» B. Kantorovich | |
| 20. |
What can be defined as a useful idle resource which has economic value eg; raw materials, spare parts, finished items, etc? |
| A. | Inventory Control |
| B. | Inventory |
| C. | Inventory Planning |
| D. | None of the above |
| Answer» C. Inventory Planning | |
| 21. |
After determining every basic cell with in this cycle, adjustment is obtained as minimum value in basic cells . this is known as |
| A. | Adjustment amount |
| B. | aa |
| C. | Both A and B |
| D. | Alternatives |
| Answer» D. Alternatives | |
| 22. |
What enables us to determine the earliest and the latest times for each of the events and activities and thereby helps in the identification of the critical path? |
| A. | Programme Evaluation |
| B. | Review Technique (PERT) |
| C. | Both A and B |
| D. | Deployment of resources |
| Answer» D. Deployment of resources | |
| 23. |
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» B. James B. Dantzig | |
| 24. |
What is concerned with the prediction of replacement costs and determination of the most economic replacement policy ? |
| A. | Search Theory |
| B. | Theory of replacement |
| C. | Probabilistic Programming |
| D. | None of the above |
| Answer» C. Probabilistic Programming | |
| 25. |
What is concerned with the prediction of replacement costs and determination of the most economic replacement policy ? |
| A. | Search Theory |
| B. | Theory of replacement |
| C. | Probabilistic Programming |
| D. | None of the above |
| Answer» C. Probabilistic Programming | |
| 26. |
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» D. None of the above | |
| 27. |
Simple linear programming problem with variables can be easily solved by the graphical method. |
| A. | One decision |
| B. | Four decisions |
| C. | Three decisions |
| D. | Two decisions |
| Answer» E. | |
| 28. |
Simple linear programming problem with variables can be easily solved by the graphical method. |
| A. | One decision |
| B. | Four decisions |
| C. | Three decisions |
| D. | Two decisions |
| Answer» E. | |
| 29. |
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» B. 1988 | |
| 30. |
Key concept under which technique are network of events and activities , resource allocation, time and cost considerations, network paths and critical paths ? |
| A. | Game Theory |
| B. | Network Analysis |
| C. | Decision Theory |
| D. | None of the above |
| Answer» C. Decision Theory | |
| 31. |
Key concept under which technique are network of events and activities , resource allocation, time and cost considerations, network paths and critical paths ? |
| A. | Game Theory |
| B. | Network Analysis |
| C. | Decision Theory |
| D. | None of the above |
| Answer» C. Decision Theory | |
| 32. |
An objective function which states the determinants of the quantity to be either maximized or minimized is called |
| A. | Feasible function |
| B. | Optimal function |
| C. | Criterion function |
| D. | None of the above |
| Answer» D. None of the above | |
| 33. |
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» E. | |
| 34. |
Who defined Operations Research as an aid for the executive in marketing his decisions by providing him with the quantitative information based on the scientific method of analysis |
| A. | C. Kitte |
| B. | H.M. Wagner |
| C. | E.L. Arnoff |
| D. | None of the above |
| Answer» B. H.M. Wagner | |
| 35. |
What refers to Linear Programming that includes an evaluation of relative risks and uncertainties in various alternatives of choice for management decisions ? |
| A. | Probabilistic Programming |
| B. | Stochastic Programming |
| C. | Both A and B |
| D. | Linear Programming |
| Answer» D. Linear Programming | |
| 36. |
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» D. None of the above | |
| 37. |
LP can be applied in farm management problems is relates to the allocation of resources such as , in such a way that is maximizes net revenue |
| A. | Acreage |
| B. | Labour |
| C. | Water supply or working capital |
| D. | All of the above |
| Answer» E. | |
| 38. |
models involves the allocation of resources to activities in such a manner that some measure of effectiveness is optimized. |
| A. | Sequencing |
| B. | Allocation Models |
| C. | Queuing Theory |
| D. | Decision Theory |
| Answer» C. Queuing Theory | |
| 39. |
The word may be defined as some action that we apply to some problems or hypothesis. |
| A. | Research |
| B. | Operation |
| C. | Both A and B |
| D. | None of the above |
| Answer» C. Both A and B | |
| 40. |
Which theory concerns making sound decisions under conditions of certainity, risk and uncertainty |
| A. | Game Theory |
| B. | Network Analysis |
| C. | Decision Theory |
| D. | None of the above |
| Answer» D. None of the above | |
| 41. |
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» D. French Revolution | |
| 42. |
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» B. m | |
| 43. |
If the total supply is less than the total demand, a dummy source (row) is included in the cost matrix with |
| A. | Dummy Demand |
| B. | Dummy Supply |
| C. | Zero Cost |
| D. | Both A and B |
| Answer» D. Both A and B | |
| 44. |
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» C. Decision Making | |
| 45. |
If the total supply is less than the total demand, a dummy source (row) is included in the cost matrix with |
| A. | Dummy Demand |
| B. | Dummy Supply |
| C. | Zero Cost |
| D. | Both A and B |
| Answer» D. Both A and B | |
| 46. |
In simplex algorithm , which method is used to deal with the situation where an infeasible starting basic solution is given? |
| A. | Slack variable |
| B. | Simplex method |
| C. | M method |
| D. | None of the above |
| Answer» D. None of the above | |
| 47. |
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» D. None of the above | |
| 48. |
In simplex algorithm , which method is used to deal with the situation where an infeasible starting basic solution is given? |
| A. | Slack variable |
| B. | Simplex method |
| C. | M method |
| D. | None of the above |
| Answer» D. None of the above | |
| 49. |
assumption means the prior knowledge of all the coefficients in the objective function, the coefficients of the constraints and the resource values. |
| A. | Proportionality |
| B. | Certainty |
| C. | Finite choices |
| D. | Continuity |
| Answer» C. Finite choices | |
| 50. |
In which phase is optimization done and how does that phase also checks for optimality conditions? |
| A. | Phase II |
| B. | Phase I |
| C. | Phase II |
| D. | None of the above |
| Answer» D. None of the above | |