Description : 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
Last Answer : d. F L Hitchcock
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 : 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 : ..............................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 : 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 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 : 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 : Commonly assumed probability distribution of service pattern are ....................... a. Poisson distribution b. Exponential distribution c. Erlang distribution d. b and c
Last Answer : d. b and c
Description : Queuing theory is also termed as ............................ a. Game theory b. Replacement theory c. Waiting line theory d. None of these
Last Answer : c. Waiting line theory
Description : 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
Last Answer : d. All of the above
Description : ....................... is an important Operations Research Technique to analyse the queuing behaviour. a. Game theory b. Waiting line theory c. Decision theory d. Simulation
Last Answer : b. Waiting line theory
Description : The O R technique which helps in minimising total waiting and service cost is: a. Game theory b. Queuing theory c. Both a and b d. Decision theory
Last Answer : b. Queuing theory
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 : ....................... deals with the concepts such as critical path, float, events, etc. a. Game theory b. Decision theory c. Queuing theory d. Network analysis
Last Answer : d. Network analysis
Description : ......................... deals with making sound decisions under conditions of certainty, risk and uncertainty. a. Game theory b. Network analysis c. Decision theory d. None of these
Last Answer : c. Decision theory
Description : The outcome of a game is known as.................... a. Profit b. Loss c. Pay off d. None of these
Last Answer : c. Pay off
Description : In India, first Operations Research application was made by ........................... a. Pranab K Sen b. Prof. Mahalonobis c. Samarendra Nath Roy d. Raghu Raj Bahadur
Last Answer : b. Prof. Mahalonobis
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 : 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 : 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 : 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 : Traffic intensity in Queuing Theory is also called........................... a. Service factor b. Arrival factor c. Utilisation factor d. None of these
Last Answer : c. Utilisation factor
Description : In queuing theory, FCFS stand for .............................. a. First Cum First Served b. First Customer Fist Served c. Fast Channel First Served
Last Answer : a. First Cum First Served
Description : ...................... 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
Last Answer : c. Markov Analysis
Description : In queuing theory, ............................ stands for mean service rate. a. μ b. λ c. t d. none of these
Last Answer : a. μ
Description : In queuing theory, ............................ stands for mean arrival rate of customers. a. μ b. λ c. t d. none of these
Last Answer : b. λ
Description : 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
Last Answer : d. Queue length
Description : In queuing theory, ...................... is a person by whom service is rendered. a. Customer b. Server c. a or b d. none of these
Last Answer : b. Server
Description : 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
Last Answer : b. Customer
Description : ............................... is concerned with determination of the most economic replacement policy. a. Probabilistic programming b. Linear programming c. Search theory d. Replacement theory
Last Answer : d. Replacement theory
Description : ............................ models involve the allocation of resources to activities in such a way that some measure of effectiveness is optimised. a. Sequencing b. Allocation c. Queuing theory d. Decision theory
Last Answer : b. Allocation
Description : 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
Last Answer : b. Zero sum game
Description : A game is said to be fair if the value of the game is......................... a. One b. Two c. Three d. Zero
Last Answer : d. Zero
Description : 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
Last Answer : c. Value of the game
Description : Each participant of the game is called................... a. Strategist b. Winner c. Player d. Loser
Last Answer : c. Player
Description : Who developed the Game Theory a. J.R. Hicks b. William J. Baumol c. Neumann Morgenstern d. Samuelson P.T.
Last Answer : c. Neumann Morgenstern