MCQS, Queuing Theory, Game Theory

In queuing theory, Lq is.
A. Expected number of customers in system

B. Expected number of customers in queue
C. Expected waiting time in system
D. Expected waiting time in queue
ANSWER: B
In queuing theory, Wq is.

ANSWER: D
In queuing theory, Ls is.

ANSWER: A
In queuing theory, Ws is.

ANSWER: C
In queuing theory, Pn is.

A. Probability of n customers in system
B. Probability of n customers in queue
C. Probability of n customers in service
D. None of these
ANSWER: A
In (M/M/1):(GD/N/Infinity) Model.
A. there M servers
B. there is one server
C. there are N servers
D. there are infinite servers
ANSWER: B
In (M/M/c):(GD/N/Infinity) Model.
A. there c servers
B. there is M servers
C. there are N servers
D. there are infinite servers
ANSWER: A
In (M/M/1):(GD/N/Infinity) Model, service discipline is.

A. FCFS
B. LCFS
C. Random
D. General
ANSWER: D
In (M/M/1):(GD/N/Infinity) Model, maximum customers allowed in the system are.

A. Infinite
B. N
C. M
D. One
ANSWER: B
In (M/M/1):(GD/N/Infinity) Model, maximum number of calling source is.

A. Infinite
B. N
C. M
D. One
ANSWER: A
There is no limit on calling source in the Queuing Model.

A. (M/M/1):(GD/N/N)
B. (M/M/1):(GD/10/N)
C. (M/M/1):(GD/N/Infinity)
D. None of these
ANSWER: C
In Queuing theory, Lambda is the.

A. Mean arrival rate.
B. Mean service rate.
C. Number of people in the system.
D. None of these.
ANSWER: A
In Queuing theory, meu is the.

A. Mean arrival rate.
B. Mean service rate.
C. Number of people in the system.
D. None of these.
ANSWER: B
In Queuing theory, customers deciding not to join the queue if it is too long then it is called.
A. Balking
B. Reneging
C. Jockeying
D. None of these
ANSWER: A
In Queuing theory, customers leave the queue if they have waited too long for service then
it is called.
A. Balking
B. Reneging
C. Jockeying
D. None of these
ANSWER: B
In Queuing theory, customers switch between queues if they think they will get served
faster by so doing.
A. Balking
B. Reneging
C. Jockeying
D. None of these
ANSWER: C
Jockeying is done in.

A. Single Server
B. Parallel Server
C. Tandem Queue
D. None of these
ANSWER: C
If the same line is served by several servers, it is called.

A. Single Server
B. Parallel Server
C. Tandem Queue
D. None of these
ANSWER: B
If each of multiple servers has their own queue or line, it is called.

A. Single Server
B. Parallel Server
C. Tandem Queue
D. None of these
ANSWER: C
Service mechanism includes.

A. Length of time a customer is serviced
B. Number of servers available to help the customers
C. Whether customers are served one by one or in batches
D. The order in which customers are
E. All of these
ANSWER: E
Balking, Reneging and Jockeying are types of.

A. Arrival Process
B. Service Discipline
C. Behavior
D. None of these
ANSWER: C
The first queuing theory problem was in 1908 considered by.

A. Erlang
B. Little
C. Hamedy
D. None of these
ANSWER: A
The first queuing theory problem was considered in.

A. 1900
B. 1908
C. 1934
D. None of these
ANSWER: B
A basic queuing system consists of.

A. An arrival process
B. The service process
C. Departures from the system
D. All of these
ANSWER: D
In (a/b/c):(d/e/f) Model, a stands for.

A. The number of servers
B. Probability distribution for arrival process
C. Probability distribution for service process
D. Maximum number of customers allowed in system
ANSWER: B
In (a/b/c):(d/e/f) Model, b stands for.

ANSWER: C
In (a/b/c):(d/e/f) Model, c stands for.
ANSWER: A
In (a/b/c):(d/e/f) Model, e stands for.

C. Maximum number of Calling Source
ANSWER: D
In (a/b/c):(d/e/f) Model, f stands for.

C. Maximum number of Calling Source
ANSWER: C
Game is called fair if value of the game is.

A. 0
B. 1
C. -1
D. Infinity
ANSWER: A
The expected payoff of each game is called.

A. Pure strategy
B. Mixed strategy
C. Value of the game
D. None of these
ANSWER: C
The game is strictly determinable if value of game is.

A. Greater than zero
B. Equal to Maximin and Minimax
C. Not equal to zero
D. All of these
ANSWER: B
Saddle point exists if.

A. Maximin is not equal to Minimax
B. Maximin is equal to Minimax
C. Maximin is greater than Minimax
D. Maximin is smaller than Minimax
ANSWER: B
Pure strategy exists if.

A. Maximin is not equal to Minimax
B. Maximin is equal to Minimax
C. Maximin is greater than Minimax
D. Maximin is smaller than Minimax
ANSWER: B
Game is in the favor of maximizing player (whose gain in positive values) if value of the
game is.
A. Greater than zero
B. Less than zero
C. Equal to zero
D. All of these
ANSWER: A
In dominance rule, a column is dominated whose values are.

A. Not less than corresponding values of any other column
B. Less than corresponding values of any other column
C. Equal to the corresponding values of any other column
D. Less than or equal to corresponding values of any other column
ANSWER: A
In dominance rule, a row is dominated whose values are.

A. Not less than corresponding values of any other column
B. Greater than corresponding values of any other column
C. Equal to the corresponding values of any other column
D. Less than or equal to corresponding values of any other column
ANSWER: D
For Graphical solution of 2 by n games, we consider.

A. Lower envelope
B. Upper envelope
C. Both lower and upper envelopes
D. None of these
ANSWER: A
For Graphical solution of m by 2 games, we consider.

A. Lower envelope
B. Upper envelope
C. Both lower and upper envelopes
D. None of these
ANSWER: B
Problem of Game theory can be solved graphically if there are.
A. 2 by n game
B. m by 2 game
C. 2 by n game or m by 2 game
D. None of these
ANSWER: C
For Graphical solution of 2 by n games, only those strategies are considered whose lines
pass through the point.
A. Minimax
B. Maximin
C. Both Minimax and Maximin
D. None of these
ANSWER: B
In game theory, an opponent is referred to as a.

A. Player
B. Strategy
D. Payoff matrix
ANSWER: A
Each player has a number of choices (finite or infinite) which are called.
A. Games
B. Strategies
D. Payoff matrix
ANSWER: B
A game with two players, where a gain of one player equals to a loss of other, is known as.
A. Two person zero-sum game
B. Two person non-zero sum game
C. Both zero sum and non-zero sum game
D. None of these
ANSWER: A
The game matrix (payoff matrix) is usually expressed in terms of the payoff to player’s A
whose strategies are represented by.
A. Columns
B. Rows
C. Both rows and columns
D. None of these
ANSWER: B
When minimax equals to maximin then corresponding pure strategies are called.
A. Optimal
B. Basic
C. Infeasible
D. None of these
ANSWER: A
When minimax equals to maximin then game is said to have a.

A. Mixed strategy
B. Non-zero sum game
C. Saddle point
D. All of these
ANSWER: C
If minimax is not equal to maximin then game is called.

A. Stable
B. In state of equilibrium
C. Unstable
D. None of these
ANSWER: C
To solve (m X n) game if minimax is not equal to maximin, we use.

A. Graphical method
B. General linear programming method
C. Both graphical method and general linear programing method
D. None of these
ANSWER: B
If minimax is not equal to maximin, to solve (m X 2) or (2 X n) game, we use.

A. Graphical method
B. General linear programming method
C. Both graphical method and general linear programing method
D. None of these
ANSWER: A
If the maximin value of a two person zero-sum game is negative, the long run outcome of
the game will indicate a net loss to player.
A. B
B. A
C. Both A and B
D. None of these
ANSWER: B
If the maximin value of a two person zero-sum game is positive, the long run outcome of
the game will indicate a net loss to player.
A. B
B. A
C. Both A and B
D. None of these
ANSWER: A

MCQS, Queuing Theory, Game Theory

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

MCQS, Queuing Theory, Game Theory

Uploaded by

Copyright:

Available Formats

In queuing theory, Lq is.

A. Expected number of customers in system

In queuing theory, Wq is.

In queuing theory, Ls is.

In queuing theory, Ws is.

In queuing theory, Pn is.

In (M/M/1):(GD/N/Infinity) Model, service discipline is.

In (M/M/1):(GD/N/Infinity) Model, maximum customers allowed in the system are.

In (M/M/1):(GD/N/Infinity) Model, maximum number of calling source is.

There is no limit on calling source in the Queuing Model.

In Queuing theory, Lambda is the.

In Queuing theory, meu is the.

Jockeying is done in.

If the same line is served by several servers, it is called.

If each of multiple servers has their own queue or line, it is called.

Service mechanism includes.

Balking, Reneging and Jockeying are types of.

The first queuing theory problem was in 1908 considered by.

The first queuing theory problem was considered in.

A basic queuing system consists of.

In (a/b/c):(d/e/f) Model, a stands for.

In (a/b/c):(d/e/f) Model, b stands for.

In (a/b/c):(d/e/f) Model, e stands for.

In (a/b/c):(d/e/f) Model, f stands for.

Game is called fair if value of the game is.

The expected payoff of each game is called.

The game is strictly determinable if value of game is.

Saddle point exists if.

Pure strategy exists if.

In dominance rule, a column is dominated whose values are.

In dominance rule, a row is dominated whose values are.

For Graphical solution of 2 by n games, we consider.

For Graphical solution of m by 2 games, we consider.

In game theory, an opponent is referred to as a.

When minimax equals to maximin then game is said to have a.

If minimax is not equal to maximin then game is called.

To solve (m X n) game if minimax is not equal to maximin, we use.

If minimax is not equal to maximin, to solve (m X 2) or (2 X n) game, we use.

You might also like