McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Uncategorized topics .
| 251. |
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» D. Average waiting time of customers in the system | |
| 252. |
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» B. Arrivals are independent of each other | |
| 253. |
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» D. None of the above | |
| 254. |
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» A. Server’s behavior | |
| 255. |
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» D. All of the above | |
| 256. |
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» A. Row | |
| 257. |
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» C. Retention | |
| 258. |
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» A. Sum to one | |
| 259. |
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» A. Sum to 1 | |
| 260. |
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» A. n | |
| 261. |
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» C. In all cases | |
| 262. |
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» B. Transition probabilities do not change | |
| 263. |
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» A. Transition probabilities are fairly stable | |
| 264. |
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» D. All of the above | |
| 265. |
The transition matrix elements remain positive from one point to the next. This property is known as: |
| A. | Steady-state property |
| B. | Equilibrium property |
| C. | Regular property |
| D. | All of the above |
| Answer» C. Regular property | |
| 266. |
Markov analysis is useful for: |
| A. | Predicting the state of the system at some future time |
| B. | Calculating transition probabilities at some future time |
| C. | All of the above |
| D. | None of the above |
| Answer» C. All of the above | |
| 267. |
Which of the following is not one of the assumptions of Markov analysis: |
| A. | There are a limited number of possible states |
| B. | A future state can be predicted from the preceding one |
| C. | There are limited number of future periods |
| D. | All of the above |
| Answer» C. There are limited number of future periods | |
| 268. |
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» D. All of the above | |
| 269. |
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» D. All of the above | |
| 270. |
Which of the following is not the special purpose simulation language |
| A. | BASIC |
| B. | GPSS |
| C. | GASP |
| D. | SIMSCRIPT |
| Answer» A. BASIC | |
| 271. |
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» C. Approximation | |
| 272. |
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» B. Necessary to develop a cumulative probability distribution | |
| 273. |
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» C. Identify suitable values of decision variables for the specific choices of system parameters | |
| 274. |
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» B. Unequal probability | |
| 275. |
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» C. They may be expensive to write and use as an experimental device | |
| 276. |
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» D. All of the above | |
| 277. |
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» D. All of the above | |
| 278. |
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» B. Does not require programme writing | |
| 279. |
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» D. All of the above | |
| 280. |
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» D. All of the above | |
| 281. |
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» D. All of the above | |
| 282. |
The important step required for simulation approach in solving a problem is to |
| A. | Test & validate the model |
| B. | Design the experiment |
| C. | Conduct the experiment |
| D. | All of the above |
| Answer» D. All of the above | |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.