198 + Mcqs in General McqOptions

1.	For a salesman who has to visit n cities which of the following are the ways of his tour plan
A.	n!
B.	(n+1)!
C.	(n-1)!
D.	n
Answer» D. n

Discussion

2.	Markov analysis might be effectively used for
A.	technology transfer studies.
B.	university retention analysis.
C.	accounts receivable analysis.
D.	all of the above
Answer» E.

Discussion

3.	Whenever all the constraints in a linear program are expressed as equalities, the linear program is said to be written in
A.	standard form.
B.	bounded form.
C.	feasible form.
D.	alternative form.
Answer» B. bounded form.

Discussion

4.	Infeasibility means that the number of solutions to the linear programming models that satisfies all constraints is
A.	at least 1.
B.	0.
C.	an infinite number.
D.	at least 2.
Answer» C. an infinite number.

Discussion

5.	Which of the following characteristics apply to queuing system
A.	Customer population
B.	Arrival process
C.	Both a & b
D.	Neither a nor b
Answer» D. Neither a nor b

Discussion

6.	While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity cost because the objective is to
A.	Minimize total cost of assignment
B.	Reduce the cost of assignment to zero
C.	Reduce the cost of that particular assignment to zero
D.	All of the above
Answer» B. Reduce the cost of assignment to zero

Discussion

7.	An optimal solution of an assignment problem can be obtained only if
A.	Each row & column has only one zero element
B.	Each row & column has at least one zero element
C.	The data is arrangement in a square matrix
D.	None of the above
Answer» E.

Discussion

8.	Customer behavior in which the customer moves from one queue to another in a multiple channel situation is
A.	Balking
B.	Reneging
C.	Jockeying
D.	Altering
Answer» D. Altering

Discussion

9.	The smallest quantity is chosen at the corners of the closed path with negative sign to be assigned at unused cell because
A.	It improve the total cost
B.	It does not disturb rim conditions
C.	It ensure feasible solution
D.	All of the above
Answer» D. All of the above

Discussion

10.	If there were n workers & n jobs there would be
A.	n! solutions
B.	(n-1)! solutions
C.	(n!)n solutions
D.	n solutions
Answer» B. (n-1)! solutions

Discussion

11.	Which of the following methods is used to verify the optimality of the current solution of the transportation problem
A.	Least cost method
B.	Vogel’s approximation method
C.	Modified distribution method
D.	All of the above
Answer» B. Vogel’s approximation method

Discussion

12.	Priority queue discipline may be classified as
A.	Finite or infinite
B.	Limited & unlimited
C.	Pre-emptive or non-pre-emptive
D.	All of the above
Answer» D. All of the above

Discussion

13.	The assignment problem
A.	Requires that only one activity be assigned to each resource
B.	Is a special case of transportation problem
C.	Can be used to maximize resources
D.	All of the above
Answer» E.

Discussion

14.	Which of the following is not a key operating characteristics apply to queuing system
A.	Utilization factor
B.	Percent idle time
C.	Average time spent waiting in the system & queue
D.	None of the above
Answer» E.

Discussion

15.	Every basic feasible solution of a general assignment problem, having a square pay-off matrix of order, n should have assignments equal to
A.	2n+1
B.	2n-1
C.	m+n-1
D.	m+n
Answer» C. m+n-1

Discussion

16.	The calling population is assumed to be infinite when
A.	Arrivals are independent of each other
B.	Capacity of the system is infinite
C.	Service rate is faster than arrival rate
D.	All of the above
Answer» B. Capacity of the system is infinite

Discussion

17.	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 LP problem
D.	Both a & b
Answer» C. A LP problem

Discussion

18.	The method used for solving an assignment problem is called
A.	Reduced matrix method
B.	MODI method
C.	Hungarian method
D.	None of the above
Answer» D. None of the above

Discussion

19.	The purpose of a dummy row or column in an assignment problem is to
A.	Obtain balance between total activities & total resources
B.	Prevent a solution from becoming degenerate
C.	Provide a means of representing a dummy problem
D.	None of the above
Answer» B. Prevent a solution from becoming degenerate

Discussion

20.	Simulation should not be applied in all cases because it
A.	Requires considerable talent for model building & extensive computer programming efforts
B.	Consumes much computer time
C.	Provides at best approximate solution to problem
D.	All of the above
Answer» E.

Discussion

21.	The general purpose system simulation language
A.	Requires programme writing
B.	Does not require programme writing
C.	Requires predefined coding forms
D.	Needs a set of equations to describe a system
Answer» C. Requires predefined coding forms

Discussion

22.	Special simulation languages are useful because they
A.	Reduce programme preparation time & cost
B.	Have the capability to generate random variables
C.	Require no prior programming knowledge
D.	All of the above
Answer» E.

Discussion

23.	To make simulation more popular, we need to avoid
A.	Large cost over runs
B.	Prolonged delays
C.	User dissatisfaction with simulation results
D.	All of the above
Answer» E.

Discussion

24.	An assignment problem can be solved by
A.	Simplex method
B.	Transportation method
C.	Both a & b
D.	None of the above
Answer» D. None of the above

Discussion

25.	Biased random sampling is made from among alternatives which have
A.	Equal probability
B.	Unequal probability
C.	Probability which do not sum to 1
D.	None of the above
Answer» C. Probability which do not sum to 1

Discussion

26.	To proceed with the MODI algorithm for solving an assignment problem, the number of dummy allocations need to be added are
A.	n
B.	2n
C.	n-1
D.	2n-1
Answer» D. 2n-1

Discussion

27.	Simulation is defined as
A.	A technique that uses computers
B.	An approach for reproducing the processes by which events by chance & changes are created in a computer
C.	A procedure for testing & experimenting on models to answer what if ___, then so & so ___ types of questions
D.	All of the above
Answer» E.

Discussion

28.	While assigning random numbers in Monte Carlo simulation, it is
A.	Not necessary to assign the exact range of random number interval as the probability
B.	Necessary to develop a cumulative probability distribution
C.	Necessary to assign the particular appropriate random numbers
D.	All of the above
Answer» C. Necessary to assign the particular appropriate random numbers

Discussion

29.	Few causes of simulation analysis failure are
A.	Inadequate level of user participation
B.	Inappropriate levels of detail
C.	Incomplete mix of essential skills
D.	All of the above
Answer» E.

Discussion

30.	If a matrix of transition probability is of the order n*n, then the number of equilibrium equations would be
A.	n
B.	n-1
C.	n+1
D.	None of the above
Answer» B. n-1

Discussion

31.	The cost of providing service in a queuing system decreases with
A.	Decreased average waiting time in the queue
B.	Decreased arrival rate
C.	Increased arrival rate
D.	None of the above
Answer» E.

Discussion

32.	Service mechanism in a queuing system is characterized by
A.	Server’s behavior
B.	Customer’s behavior
C.	Customers in the system
D.	All of the above
Answer» B. Customer’s behavior

Discussion

33.	The first-order Markov chain is generally used when
A.	Transition probabilities are fairly stable
B.	Change in transition probabilities is random
C.	No sufficient data are available
D.	All of the above
Answer» B. Change in transition probabilities is random

Discussion

34.	A problem is classified as Markov chain provided
A.	There are finite number of possible states
B.	States are collectively exhaustive & mutually exclusive
C.	Long-run probabilities of being in a particular state will be constant over time
D.	All of the above
Answer» E.

Discussion

35.	A calling population is considered to be infinite when
A.	All customers arrive at once
B.	Arrivals are independent of each other
C.	Arrivals are dependent upon each other
D.	All of the above
Answer» C. Arrivals are dependent upon each other

Discussion

36.	An advantage of simulation as opposed to optimization is that
A.	Several options of measure of performance can be examined
B.	Complex real-life problems can be studied
C.	It is applicable in cases where there is an element of randomness in a system
D.	All of the above
Answer» E.

Discussion

37.	In Markov analysis, state probabilities must
A.	Sum to one
B.	Be less than one
C.	Be greater than one
D.	None of the above
Answer» B. Be less than one

Discussion

38.	As simulation is not an analytical model, therefore the result of simulation must be viewed as
A.	Unrealistic
B.	Exact
C.	Approximation
D.	Simplified
Answer» D. Simplified

Discussion

39.	While calculating equilibrium probabilities for a Markov process, it is assumed that
A.	There is a single absorbing state
B.	Transition probabilities do not change
C.	There is a single non-absorbing state
D.	None of the above
Answer» C. There is a single non-absorbing state

Discussion

40.	Which of the cost estimates & performance measures are not used for economic analysis of a queuing system
A.	Cost per server per unit of time
B.	Cost per unit of time for a customer waiting in the system
C.	Average number of customers in the system
D.	Average waiting time of customers in the system
Answer» E.

Discussion

41.	In the long run, the state probabilities become 0 & 1
A.	In no case
B.	In same cases
C.	In all cases
D.	Cannot say
Answer» D. Cannot say

Discussion

42.	Large complicated simulation models are appreciated because
A.	Their average costs are not well-defined
B.	It is difficult to create the appropriate events
C.	They may be expensive to write and use as an experimental device
D.	All of the above
Answer» D. All of the above

Discussion

43.	In a matrix of transition probability, the element aij where i=j is a
A.	Gain
B.	Loss
C.	Retention
D.	None of the above
Answer» D. None of the above

Discussion

44.	Probabilities of occurrence of any state are
A.	Collectively exhaustive
B.	Mutually exclusive
C.	Representing one of the finite numbers of states of nature in the system
D.	All of the above
Answer» E.

Discussion

45.	State transition probabilities in the Markov chain should
A.	Sum to 1
B.	Be less than 1
C.	Be greater than 1
D.	None of the above
Answer» B. Be less than 1

Discussion

46.	In a matrix of transition probability, the probability values should add up to one in each
A.	Row
B.	Column
C.	Diagonal
D.	All of the above
Answer» B. Column

Discussion

47.	The purpose of using simulation technique is to
A.	Imitate a real-world situation
B.	Understand properties & operating characteristics of complex real-life problems
C.	Reduce the cost of experiment on a model of real situation
D.	All of the above
Answer» E.

Discussion

48.	Analytical results are taken into consideration before a simulation study so as to
A.	Identify suitable values of the system parameters
B.	Determine the optimal decision
C.	Identify suitable values of decision variables for the specific choices of system parameters
D.	All of the above
Answer» D. All of the above

Discussion

49.	Which of the following is not the special purpose simulation language
A.	BASIC
B.	GPSS
C.	GASP
D.	SIMSCRIPT
Answer» B. GPSS

Discussion

50.	If the probability of making a transition from a state is 0, then that state is called a(n)
A.	steady state.
B.	final state.
C.	origin state.
D.	absorbing state.
Answer» E.

Discussion

Explore topic-wise MCQs in Testing Subject.

For a salesman who has to visit n cities which of the following are the ways of his tour plan

Markov analysis might be effectively used for

Whenever all the constraints in a linear program are expressed as equalities, the linear program is said to be written in

Infeasibility means that the number of solutions to the linear programming models that satisfies all constraints is

Which of the following characteristics apply to queuing system

While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity cost because the objective is to

An optimal solution of an assignment problem can be obtained only if

Customer behavior in which the customer moves from one queue to another in a multiple channel situation is

The smallest quantity is chosen at the corners of the closed path with negative sign to be assigned at unused cell because

If there were n workers & n jobs there would be

Which of the following methods is used to verify the optimality of the current solution of the transportation problem

Priority queue discipline may be classified as

The assignment problem

Which of the following is not a key operating characteristics apply to queuing system

Every basic feasible solution of a general assignment problem, having a square pay-off matrix of order, n should have assignments equal to

The calling population is assumed to be infinite when

The Hungarian method for solving an assignment problem can also be used to solve

The method used for solving an assignment problem is called

The purpose of a dummy row or column in an assignment problem is to

Simulation should not be applied in all cases because it

The general purpose system simulation language

Special simulation languages are useful because they

To make simulation more popular, we need to avoid

An assignment problem can be solved by

Biased random sampling is made from among alternatives which have

To proceed with the MODI algorithm for solving an assignment problem, the number of dummy allocations need to be added are

Simulation is defined as

While assigning random numbers in Monte Carlo simulation, it is

Few causes of simulation analysis failure are

If a matrix of transition probability is of the order n*n, then the number of equilibrium equations would be

The cost of providing service in a queuing system decreases with

Service mechanism in a queuing system is characterized by

The first-order Markov chain is generally used when

A problem is classified as Markov chain provided

A calling population is considered to be infinite when

An advantage of simulation as opposed to optimization is that

In Markov analysis, state probabilities must

As simulation is not an analytical model, therefore the result of simulation must be viewed as

While calculating equilibrium probabilities for a Markov process, it is assumed that

Which of the cost estimates & performance measures are not used for economic analysis of a queuing system

In the long run, the state probabilities become 0 & 1

Large complicated simulation models are appreciated because

In a matrix of transition probability, the element aij where i=j is a

Probabilities of occurrence of any state are

State transition probabilities in the Markov chain should

In a matrix of transition probability, the probability values should add up to one in each

The purpose of using simulation technique is to

Analytical results are taken into consideration before a simulation study so as to

Which of the following is not the special purpose simulation language

If the probability of making a transition from a state is 0, then that state is called a(n)