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, ...................... 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 : In queuing theory, ............................ stands for mean arrival rate of customers. a. μ b. λ c. t d. none of these
Last Answer : b. λ
Description : The ration between mean arrival rate and mean service rate is called ................... a. Idle period b. Average length of queue c. Traffic intensity d. None of these
Last Answer : c. Traffic intensity
Description : a customer’s behaviour of leaving the queue when he does not like to wait in the queue due to lack of time or space is called ..................... a. Jockying b. Reneging c. Collusion d. Balking
Last Answer : d. Balking
Description : A customer’s behaviour of jumping from one queue to another is called ............................ a. Jockying b. Reneging c. Collusion d. Balking
Last Answer : a. Jockying
Description : A customer’s behaviour of leaving the queue due to impatience is called ....................... a. Jockying b. Reneging c. Collusion d. Balking
Last Answer : b. Reneging
Description : ............................refers to the manner in which the customers behave while being in the queue. a. Service pattern b. Service pattern c. Queue discipline d. None of these
Last Answer : c. Queue discipline
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, ...................... 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 : 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 : ....................... 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 : ....................... 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 : ............................ 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 : A queue is formed when the demand for a service: a. Exceeds the capacity to provide that service b. Is less than the capacity to provide that service c. a or b d. None of these
Last Answer : a. Exceeds the capacity to provide that service
Description : Excess of service facilities over and above the number of customers results: a. Idleness of service capacity b. Queues c. Both a and b d. None of these
Last Answer : a. Idleness of service capacity
Description : The outlet where the services are being provided to the customers is called................. a. Waiting line b. Service facility c. Idle facility d. Traffic intensity
Last Answer : b. Service facility
Description : ____ is a data-centric middleware standard for device-to-device and machine-to-machine communication. A. Data Distribution Serviced (DDS) B. Advance Message Queuing Protocol (AMQP) C. Extensible Messaging and Presence Protocol (XMPP) D. Message Queue Telemetry Transport (MQTT)
Last Answer : A. Data Distribution Serviced (DDS)
Description : Shadow price is also called ...................... a. Dual price b. Unit price c. Total cost d. None of these
Last Answer : a. Dual price
Description : The variables whose coefficient vectors are unit vectors, are called ...................... a. Unit variables b. Basic variables c. Non-basic variables d. None of these
Last Answer : b. Basic variables
Description : In India, first Operations Research unit was set up at ................................. a. Regional Research Laboratory, Hyderabad b. Indian Statistical Institute, Kolkotha c. Indian Institute of Science and Technology, Bengaluru d. Indian Institute of Science and Technology, Mohali
Last Answer : a. Regional Research Laboratory, Hyderabad
Description : Operations Research emphasises on the overall approach to the system. This characteristic of Operations Research is often referred to as ................................. a. System orientation b. System approach c. Inter-disciplinary d. Team approach
Last Answer : d. Team approach
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 : An activity which does not consume either resource or time is called ............................. a. Predecessor activity b. Successor activity c. Dummy activity d. Terminal activity
Last Answer : c. Dummy activity
Description : Controllable variables are also called.................................. a. Slack variables b. Surplus variables c. Artificial variable d. Decision variables
Last Answer : d. Decision variables
Description : The variables which cannot be manipulated by the decision maker are called.................... a. Controllable variables b. Uncontrollable variables c. Both a and b d. None of these
Last Answer : b. Uncontrollable variables
Description : The variables which can be manipulated by the decision maker are called.................... a. Controllable variables b. Uncontrollable variables c. Both a and b d. None of these
Last Answer : a. Controllable variables
Description : VAM is also called........................ a. Matrix Minima Method b. Penalty Method c. MODI Method d. None of these
Last Answer : b. Penalty Method
Description : MODI Method to test the optimality of a feasible solution to TP is also called............... a. Stepping Stone Method b. u. v. Method c. both a and b d. none of these
Last Answer : b. u. v. Method
Description : Matrix Minima Method to find initial feasible solution to a TP is also called ....................... a. NWCM b. LCM c. VAM d. None of these
Last Answer : c. VAM
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 : A matrix which shows the gains and losses resulting from moves and counter moves is called.................................. a. Cost matrix b. Pay off matrix c. Both a and b d. None of these
Last Answer : b. Pay off matrix
Description : Each participant of the game is called................... a. Strategist b. Winner c. Player d. Loser
Last Answer : c. Player
Description : Activities that cannot be started until one or more of the other activities are completed, are called.......................................... a. Dummy activities b. Initial activities c. Successor activities d. Predecessor activities
Last Answer : c. Successor activities
Description : Activities lying on critical path are called ............................ a. Critical activities b. Non-critical activities c. Dummy activities d. None of these
Last Answer : a. Critical activities
Description : An activity which must be completed before commencement of one or more other activities is called................................. a. Successor activity b. Predecessor activity c. Dummy activity d. None of these
Last Answer : b. Predecessor activity
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 : While solving a LPP graphically, the area bounded by constraints is called ................. a. Feasible region b. Infeasible region c. Unbounded region d. None of these
Last Answer : a. Feasible region
Description : Every Linear Programming Problem is related to another Linear Programming Problem, called .......................... a. Primal b. Dual c. Non-linear Programming d. None of these
Last Answer : b. Dual
Description : Probabilistic models are also called ........................... a. Deterministic models b. Dynamic models c. Stochastic models d. None of these
Last Answer : c. Stochastic models
Description : .........................are called mathematical models. a. Iconic models b. Symbolic models c. Analogue models d. None of these
Last Answer : b. Symbolic models
Description : ........................... is the latest time by which an activity can be finished without delaying the completion of the project. a. LST b. LFT c. EFT d. EST
Last Answer : b. LFT
Description : The EST + activity duration = .............................. a. Earliest Finish Time b. Latest Start Time c. Latest Finish Time d. None of these
Last Answer : a. Earliest Finish Time
Description : ..................... is the duration by which an activity can be delayed without delaying the completion of the project. a. Earliest Start Time b. Earliest Finish Time c. Latest Start Time d. Latest Finish Time
Last Answer : c. Latest Start Time
Description : PERT emphasises on ........................... a. Activity b. Time c. Cost d. None of these
Last Answer : b. Time
Description : .......................models consider time as one of the important variable. a. Dynamic b. Static c. Botha and b d. None of these
Last Answer : a. Dynamic