Description : Hungarian method was developed by ........................ a. T C Koopman b. F L Hitchcock c. D Konig d. George B Dantzig
Last Answer : c. D Konig
Description : ............................is known as father of game theory. a. Von Neumann b. A K Erlang c. George b Dantzig d. Arnoff
Last Answer : a. Von Neumann
Description : .................... is considered as the pioneer of Linear Programming Technique. a. churchman b. D W Miller c. James Lundy d. George B Dantzig
Last Answer : d. George B Dantzig
Description : The term “Operation Research” was coined by : a. Mc Closky and Trefthen b. Arthur Clark c. Churchman, Ackoff and Arnoff d. George B Dantzig
Last Answer : a. Mc Closky and Trefthen
Description : ..............................was the first person who developed a viable queueing theory a. Von Neumann b. Morgenstern c. H M Wagner d. Simeon Dennis Poisson
Last Answer : d. Simeon Dennis Poisson
Description : 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
Last Answer : d. Von-neumann and Morgenstern
Description : ......................... is a series of activities related to a project. a. Network b. Transportation Model c. Assignment model d. None of these
Last Answer : a. Network
Description : Who introduced the concept of “Stored Program” ? (1) John Von Neumann (2) Charles Babbage (3) Blaise Pascal (4) John Mauchly
Last Answer : John Von Neumann
Description : Before formulating a formal L P model, it is better to: a. Verbally identify decision variables b. Express the objective function in words c. Express each constraint in words d. All of the above
Last Answer : d. All of the above
Description : .................... defined Operations Research as “the art of winning wars without actually fighting.” a. H M Wagner b. H A Taha c. T L Saaty d. Arthur Clark
Last Answer : d. Arthur Clark
Description : Who defined Operations Research as “the art of giving bad answers to problems which otherwise have worse answers”? a. H M Wagner b. H A Taha c. T L Saaty d. Arthur Clark
Last Answer : c. T L Saaty
Description : In Transportation Problem, LCM stands for ............................. a. Lowest Common Multiplier b. Least Cost Method c. Lowest Cell Method d. None of these
Last Answer : b. Least Cost Method
Description : 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
Last Answer : c. North West Corner Method
Description : 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
Last Answer : c. VAM
Description : For a minimisation Transportation Problem, the objective is to minimise: a. Profit b. Cost c. Solution d. None of these
Last Answer : b. Cost
Description : A Transportation Problem is said to be unbalanced when total supply is not equal to ............ a. Total cost b. Total demand c. Both a and b d. None of these
Last Answer : b. Total demand
Description : Initial feasible solution to a transportation Problem can be found out by ......................... a. VAM b. MODI Method c. Both a and b d. None of these
Last Answer : a. VAM
Description : In transportation Problems, VAM stands for ......................... a. Value Addition Method b. Vogel’s Approximation Method c. Virgenean Approximation Method d. None of these
Last Answer : b. Vogel’s Approximation Method
Description : The allocated cells in the transportation table are called .............................. a. Occupied cells b. Empty cells c. Unoccupied cells d. None of these
Last Answer : a. Occupied cells
Description : The Hungarian method for solving an assignment problem can also be used to solve: a. A transportation problem b. A travelling salesman problem c. A linear programming problem d. Both a and b
Last Answer : b. A travelling salesman problem
Description : The assignment problem is: a. Requires that only one activity be assigned to each resource b. Is a special case of transportation problem c. Can be used to maximise resource d. All the above
Last Answer : d. All the above
Description : An assignment problem can be solved by ......................... a. Simplex method b. Transportation method c. Both a and b d. None of these
Last Answer : c. Both a and b
Description : The solution to a transportation problem with ‘m’ rows and ‘n’ columns is feasible if the number of positive allocations are: a. m + n b. m x n c. m +n – 1 d. m +n + 1
Last Answer : c. m +n – 1
Description : The dummy source/destination in a transportation problem is added to ........................ a. Satisfy rim constraints b. Prevent solution from becoming degenerate c. Ensure total cost does not exceed a limit d. None of the above
Last Answer : a. Satisfy rim constraints
Description : Who defined Operations Research as scientific approach to problem solving for executive management. a. E L Arnoff b. H M Wagner c. Churchman d. None of these
Last Answer : b. H M Wagner
Description : Who designed the first electronics computer ? ENIAC/ A) Von Neumann B) Joseph M Jacquard C) J. P. Eckert and J. W. Mauchly D) All of above
Last Answer : Answer : C
Description : First Computer mouse was built by_______ A. Douglas Engelbart B. William English C. Robert Zawacki D. Von Neumann
Last Answer : A. Douglas Engelbart
Description : What is von Neumann or Princeton architecture ?
Last Answer : John von Neumann is a famous Hungarian American immigrant mathematician. He designed the computer architecture based on the Stored Procedure in 1945, at the end of World War II . The architectural design he mentioned was later used for computers.
Description : Who was Von Neumann ?
Last Answer : Von Neumann was a scientist.
Description : Von Neumann Architecture is a _______ A. Multiple Instruction Multiple Data(MIMD) B. Single Instruction Multiple Data(SIMD) C. Multiple Instruction Single Data(MISD) D. Single Instruction Single Data(SISD)
Last Answer : D. Single Instruction Single Data(SISD)
Description : Electronic Delay Storage Automatic Computer(EDSAC) was invented by _________ (A) Herman Hollerith (B) JW Mauchy (C) John Von Neumann (D) None of the Above
Last Answer : (C) John Von Neumann
Description : Who coined the term “Artificial Intelligence”? (A) Charles Babbage (B) Alan Tuning (C) Von Neumann (D) John McCarthy
Last Answer : (D) John McCarthy
Description : “Stored Program” concept was developed by ______ (A) Maurice Wilkes (B) Von Neumann (C) M.H.A. Newman (D) None of the Above
Last Answer : (B) Von Neumann
Description : Computer’s basic architecture was developed by a. John Von Neumann b. Charles Babbage c. Blaiscpascal d. Jordan Murn
Last Answer : a. John Von Neumann
Description : Who coined the term "Computer ethics" as a branch of philosophy? a. Aryabhatt b. Grace Hoppers c. John Von Neumann d. Walter Maner
Last Answer : d. Walter Maner
Description : State the differences between Von Neumann and Harvard architecture.
Last Answer : Von Neumann ✔ Same memory holds data, instructions. ✔ A single set of address/data buses between CPU and memory Prepared Harvard ✔ Separate memories for data and instructions. ✔ Two sets of address/data buses between CPU and memory
Description : The external system bus architecture is created using from ______ architecture: a. Pascal b. Dennis Ritchie c. Charles Babbage d. Von Neumann
Last Answer : d. Von Neumann
Description : Which of the following processor architecture supports easier instruction pipelining? A. Harvard B. Von Neumann C. Both of them D. None of these
Last Answer : A. Harvard
Description : Which architecture provides separate buses for program and data memory? A. Harvard architecture B. Von Neumann architecture C. None of the mentioned D. All of the mentioned
Last Answer : A. Harvard architecture
Description : Which architecture involves both the volatile and the non-volatile memory? A. Harvard architecture B. Von Neumann architecture C. None of the mentioned D. All of the mentioned
Description : Which architecture is followed by general purpose microprocessors? A. Harvard architecture B. Von Neumann architecture C. None of the mentioned D. All of the mentioned
Last Answer : B. Von Neumann architecture
Description : A LPP model doesnot contain: a. Decision b. Constraints c. Feasible solution d. Spread Sheet
Last Answer : d. Spread Sheet
Description : ........................ model is a map which indicates roads, highways, towns and inter- relationships a. Iconic model b. Analogue model c. Mathematical model d. None of these
Last Answer : b. Analogue model
Description : An organisation chart is an example of ........................... a. Iconic model b. Mathematical model c. Analogue model d. None of these
Last Answer : c. Analogue model
Description : Which of the following is true with regard to a Linear Programming Model? a. No guarantee to get integer valued solution b. The relationship among decision variables is liner c. Both a and b d. None of the these
Last Answer : d. None of the these
Description : A constraint in a Linear Programming Model restricts: a. Value of objective function b. Value of decision variable c. Use of available resources d. All of the above
Description : ............................... is used to imitate an operation prior to actual performance. a. Inventory control b. Simulation c. Game theory d. Integrated Production Model
Last Answer : b. Simulation
Description : All the parameters in the linear programming model are assumed to be ..................... a. Variables b. Constraints c. Functions d. None of these
Last Answer : b. Constraints
Description : A model is a ........................... a. An essence of reality b. An approximation c. An idealisation d. All of the above