Id 1

Question In transportation problem, the points of demand is classified as

A Transportation

B Sources

C Destinations

D Origins

Answer c

Marks 1

Unit 1

Id 2

Question In transportation problem, the points of supply is classified as

A Transportation

B Sources

C Destinations

D Cost

Answer b

Marks 1

Unit 1

Id 3

Question The objectives such as minimizing the total transportation cost are
considered as

A Assignment Models

B Transportation Models

C Destination Models

D Origins Models

Answer b

Marks 1

Unit 1

Id 4
Question Which of the following is true about assignment problem:

A An assignment problem can be solved by enumeration method

B An assignment problem can be solved by Floods technique

C An assignment problem can be solved by Hungarian method

D All of the above

Answer d

Marks 1

Unit 1

Id 5

Question In Assignment Problem the variable of decision variable is

A Any positive value

B One or zero

C Two or one

D Any value

Answer b

Marks 1

Unit 1

Id 6

Question An artificial source added to a transportation table when total demand is greater than total supply is
called -------------

A Filler source

B Dummy destination

C Dummy source

D Supply source

Answer c

Marks 1

Unit 1

Id 7

Question What is said to be present when total demand equals total supply in a
 transportation problem?

A An equilibrium problem

B A harmonized problem

C A balanced problem

D All of the above

Answer c

Marks 1

Unit 1

Id 8

Question Which of the following statements is accurate with regard to

assignment problems?

A A job can be assigned to more than one workman.

B Only one workman can be assigned to each job.

C A workman can be assigned to more than one job.

D both a and c

Answer b

Marks 1

Unit 1

Id 9

Question The matrix of assignment problem is always a-----------

A Identity matrix

B Rectangular matrix.

C Transpose matrix.

D Square matrix.

Answer d

Marks 1

Unit 1

Id 10
Question Which of the following accurately describes step of the NWCM , after
making the initial allocation of units in the northwest cell?

A Move down first, and then move right.

B Move right first, and then move down.

C Move right or down first, depending on whether the demand

requirement or the supply capacity, respectively, is exhausted first.

D Move diagonally first

Answer c

Marks 1

Unit 1

Id 11

Question In a transportation problem, units are allocated from sources to

destinations

A At a maximum cost

B At a minimum cost

C At a minimum profit

D At a minimum revenue

Answer b

Marks 1

Unit 1

Id 12

Question In an assignment. problem, in Row Reduction step.

A Subtract all the element from highest value of matrix

B Subtract smallest value of each row from its corresponding row

element

C Subtract each value of a row from its largest value of that

corresponding row.

D Subtract smallest value of each column from its corresponding

column element

Answer c

Marks 1

Unit 1
Id 13

Question Which of the following is an assumption of assignment problems?

A The number of assignees and the number of jobs are the same

B The objective is to minimize the number of assignments not made.

C Each job is to be performed by exactly one assignee.

D a. and c. only.

Answer d

Marks 1

Unit 1

Id 14

Question In North-West Corner Rule, if the demand in the column is satisfied

one must move to the ---------------
A Left cell in the next column,

B Down cell in the next row

C Right cell in the next column.

D Left cell in the next row.

Answer c

Marks 1

Unit 1

Id 15

Question In transportation problem if total supply greater than total demand we

add -------------. (if supply points are along row wise)
A Dummy row with cost, O.

B Dummy column with cost 0.

C Dummy row with cost 1.

D Dummy column with cost 1.

Answer b

Marks 1

Unit 1

Id 16
Question When the problem involves the allocation of n different facilities to n
different tasks, it is often termed as
A Transportation problem

B Assignment problem.

C Queue problem

D Facility planning

Answer b

Marks 1

Unit 1

Id 17

Question In an assignment problem

A The number of rows and columns must be equal.

B The number of rows must equal or exceed the number of columns.

C The number of columns must equal or exceed the number of rows.

D The number of rows must exceed the number of columns.

Answer a

Marks 1

Unit 1

Id 18

Question In North-West Corner Rule, if the supply in the row is satisfied one
must move ------------ (supply points are along the row wise)
A Down in the next row,

B Next lowest cost cell

C Right cell in the next column.

D Left cell in the next row.

Answer a

Marks 1

Unit 1

Id 19

Question The Transportation problem is said to be balanced if -------------

A Total supply is not equal to total demand.

B Total supply is greater than total demand

C Total supply is lesser than total demand,

D Total supply is equal to total demand.

Answer d

Marks 1

Unit 1

Id 20

Question The two most common objectives for the assignment problem are the
minimization of -----------------
A Total profit or inexperience

B Total costs or inexperience

C Total costs or total time

D Total sales or inexperience

Answer c

Marks 1

Unit 1

Id 21

Question An assignment algorithm was developed by-----------

A Hungarian

B Vogel's

C Modi

D Erlang

Answer a

Marks 1

Unit 1

Id 22

Question The Least cost method

A Is used to find an initial feasible solution

B Is used to find an optimal solution

C Is based on the concept of minimizing opportunity cost

D None of the given

Answer c

Marks 1

Unit 1

Id 23

Question The North-West Corner Rule is used to find-------------

A An Initial feasible solution,

B An optimal solution.

C Non optimal solution.

D None of these

Answer a

Marks 1

Unit 1

Id 24

Question The only restriction for the initial solution of a transportation problem
is that
A Demand must equal supply.

B All constraints must be satisfied.

C Nonzero quantities in a majority of the cells.

D Number of rows equal to number of columns

Answer a

Marks 1

Unit 1

Id 25

Question Which of the following is not a step in the Hungarian method of

assignment?
A Find the opportunity-cost table

B Draw horizontal and vertical line to cover all zeros of opportunity-

cost table
C Enumerate all possible solutions

D Revise the opportunity-cost table

Answer c

Marks 1

Unit 1

Id 26

Question Maximization case in transportation problem the objective is to---------

------
A Maximize the total profit.

B Minimize the total loss .

C Neither maximize nor minimize,

D Optimal cost.

Answer a

Marks 1

Unit 1

Id 27

Question In a transportation problem, when number of occupied cells is less

than number of rows plus number of columns we say that solution is
A Feasible solution

B Multiple solution

C Degenerate solution

D Unbalanced solution

Answer c

Marks 1

Unit 1

Id 28

Question Decision Science approach is

A Multi-disciplinary

B Intuitive
C Scientific

D All of the above

Answer a

Marks 1

Unit 1

Id 29

Question

For analyzing a problem, decision-makers should study

A Its qualitative aspects

B Its quantitative aspects

C Both a &b

D Neither a nor b

Answer c

Marks 1

Unit 1

Id 30

Question

Decision variables are

A Controllable

B Uncontrollable

C Parameters

D None of the above

Answer a

Marks 1

Unit 1

Id 31

Question

Managerial decisions are based on

A An evaluation of quantitative data
B The use of qualitative factors

C Results generated by formal models

D All of the above

Answer d

Marks 1

Unit 1

Id 32

Question

The use of decision models

A Is possible when the variables value is known

B Reduces the scope of judgement &intuition known with certainty in

decision-making

C Require the use of computer software

D None of the above

Answer d

Marks 1

Unit 1

Id 33

Question
An optimization model
A Provides the best decision

B Provides decision within its limited context

C Helps in evaluating various alternatives

D All of the above

Answer a

Marks 1

Unit 1

Id 34

Question
The quantitative approach to decision analysis is a
A Logical approach
B Rational approach

C Scientific approach

D All of the above

Answer c

Marks 1

Unit 1

Id 35

Question
The qualitative approach to decision analysis relies on
A Experience

B Judgement

C Intuition

D All of the above

Answer d

Marks 1

Unit 1

Id 36

Question
The initial solution of a transportation problem can be obtained by
applying any known method. However, the only condition is that
a.

b.
c.
d.
A The solution be optimal

B The rim conditions are satisfied

C The solution not be degenerate

D All of the above

Answer b

Marks 1

Unit 1
Id 37

Question
The dummy source or destination in a transportation problem is
added to
a.
b.
c.
d.
A Satisfy rim conditions

B Prevent solution from becoming degenerate

C Ensure that total cost does not exceed a limit

D None of the above

Answer a

Marks 1

Unit 1

Id 38

Question
The occurrence of degeneracy while solving a transportation problem
means that
a.
b.
c.
d.
A Total supply equals total demand

B The solution so obtained is not feasible

C The few allocations become negative

D None of the above

Answer b

Marks 1

Unit 1

Id 39

Question
An alternative optimal solution to a minimization transportation
problem exists whenever opportunity cost corresponding to unused
route of transportation is:
a.
b.
c.
d.
A Positive &greater than zero

B Positive with at least one equal to zero

C Negative with at least one equal to zero

D None of the above

Answer b

Marks 1

Unit 1

Id 40

Question
One disadvantage of using North-West Corner rule to find initial
solution to the transportation problem is that
a.
b.
c.
d.
A It is complicated to use

B It does not take into account cost of transportation

C It leads to a degenerate initial solution

D All of the above

Answer b

Marks 1

Unit 1

Id 41

Question
The solution to a transportation problem with ‘m’ rows (supplies) &‘n’
columns (destination) is feasible if number of positive allocations are
a.
b.
c.
d.
A m+n

B m*n

C m+n-1

D m+n+1

Answer c
Marks 1

Unit 1

Id 42

Question
If an opportunity cost value is used for an unused cell to test
optimality, it should be
a.
b.
c.
d.
A Equal to zero

B Most negative number

C Most positive number

D Any value

Answer b

Marks 1

Unit 1

Id 43

Question
During an iteration while moving from one solution to the next,
degeneracy may occur when
a.
b. .
c.

d.
A The closed path indicates a diagonal move

B Two or more occupied cells are on the closed path but neither of
them represents a corner of the path

C Two or more occupied cells on the closed path with minus sign are
tied for lowest circled value

D Either of the above

Answer c

Marks 1

Unit 1
Id 44

Question
The large negative opportunity cost value in an unused cell in a
transportation table is chosen to improve the current solution because
a.
b.
c.
d.
A It represents per unit cost reduction

B It represents per unit cost improvement

C It ensure no rim requirement violation

D None of the above

Answer a

Marks 1

Unit 1

Id 45

Question
The smallest quantity is chosen at the corners of the closed path with
negative sign to be assigned at unused cell because
a.
b.
c.
d.
A It improve the total cost

B It does not disturb rim conditions

C It ensure feasible solution

D All of the above

Answer c

Marks 1

Unit 1

Id 46

Question
When total supply is equal to total demand in a transportation
problem, the problem is said to be
a.
b.
c.
d.
A Balanced

B Unbalanced

C Degenerate

D None of the above

Answer c

Marks 1

Unit 1

Id 47

Question
The degeneracy in the transportation problem indicates that
a.
b.
c.
d.
A Dummy allocation(s) needs to be added

B The problem has no feasible solution

C The multiple optimal solution exist

D a &b but not c

Answer c

Marks 1

Unit 1

Id 48

Question
An optimal assignment requires that the maximum number of lines
that can be drawn through squares with zero opportunity cost be
equal to the number of
a.
b.
c.
d.
A Rows or columns

B Rows &columns

C Rows + columns – 1

D None of the above

Answer d
Marks 1

Unit 1

Id 49

Question
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.
b.
c.
d.
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 a

Marks 1

Unit 1

Id 50

Question
The method used for solving an assignment problem is called
a.
b.
c.
d.
A Reduced matrix method

B MODI method

C Hungarian method

D None of the above

Answer c

Marks 1

Unit 1

Id 51

Question
The purpose of a dummy row or column in an assignment problem is
to
 a.
b.
c.
d.
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 a

Marks 1

Unit 1

Id 52

Question
Maximization assignment problem is transformed into a minimization
problem by
a.
b.
c.
d.
A Adding each entry in a column from the maximization value in that
column

B Subtracting each entry in a column from the maximum value in that

column

C Subtracting each entry in the table from the maximum value in that
table

D none of the above

Answer c

Marks 1

Unit 1

Id 53

Question
For a salesman who has to visit n cities which of the following are the
ways of his tour plan
a.
b.
c.
d.
A n!

B (n+1)!
C (n-1)!

D n

Answer c

Marks 1

Unit 1

Id 54

Question
The assignment problem
a.
b.
c.
d.
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 d

Marks 1

Unit 1

Id 55

Question
The Hungarian method for solving an assignment problem can also
be used to solve
a.
b.
c.
d.
A A transportation problem

B A travelling salesman problem

C A LP problem

D Both a &b

Answer b

Marks 1

Unit 1
Id 56

Question
An optimal solution of an assignment problem can be obtained only if
a.
b.
c.
d.
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 d

Marks 1

Unit 1

Id 1

Question Simulation

A Does not guarantee optimality.

B Flexible and does not require the assumptions of theoretical models+

C Allows testing of the system without affecting the real system.

D All of the above

Answer d

Marks 1

Unit 2

Id 2

Question A simulation model uses the mathematical expressions and logical

relationships of the
A Real system.

B Computer model.

C Performance measures.

D Estimated inferences.

Answer a

Marks 1

Unit 2

Id 3

Question All of the following are various ways of generating random numbers
except

A Table of random numbers

B Use of computer

C Spin of roulette wheel

D Fibonacci series

Answer d

Marks 1

Unit 2

Id 4

Question Analysis of a Markov process

A Describes future behavior of the system.

B Optimizes the system.

C Leads to higher order decision making.

D All of the above.

Answer a

Marks 1

Unit 2

Id 5

Question Markov analysis assumes that the states are both---- and-----

A Finite, recurrent
B Infinite, absorbing

C Generally inclusive, always independent

D Collectively exhaustive, mutually exclusive

Answer d

Marks 1

Unit 2

Id 6

Question In Markov analysis, the likelihood that any system will change from
one period to the next is revealed by the

A Identity matrix.

B Transition elasticity.

C Matrix of state probabilities.

D Matrix of transition probabilities

Answer d

Marks 1

Unit 2

Id 7

Question Which technique is used to imitate an operation prior to actual

performance?

A Simulation

B Queuing Models

C Inventory Models

D Game Theory

Answer a

Marks 1

Unit 2

Id 8

Question Values for the probabilistic inputs to a simulation are

A Selected by the decision maker.

B Controlled by the decision maker.

C Randomly generated based on historical information.

D Calculated by fixed mathematical formulas

Answer c

Marks 1

Unit 2

Id 9

Question Simulation should be thought of as a technique for

A Increasing ones understanding of a problem.

B Obtaining a relatively inexpensive solution to a problem.

C Obtaining an optimal solution to a problem,

D None of the above

Answer a

Marks 1

Unit 2

Id 10

Question The following is not an assumption of Markov analysis..

A There is an infinite number of possible states

B The probability of changing states remains the same over time.

C We can predict any future state from the previous state and the
matrix of transition probabilities.

D All of the above

Answer a

Marks 1

Unit 2

Id 11

Question A condition in which state probabilities do not change after a long

number of period is

A Constant
B Redundant

C Stagnant

D Equilibrium

Answer d

Marks 1

Unit 2

Id 12

Question The probability that an entity in the Markov process is in a particular

state is indicated by

A Transition Matrix

B State Probability Vector

C Identity Matrix

D Equilibrium matrix

Answer a

Marks 1

Unit 2

Id 13

Question The first step in simulation is to

A Construct a numerical model

B Validate the model.

C Set up possible courses of action for testing.

D Define the problem

Answer a

Marks 1

Unit 2

Id 14

Question Which of the following statements is incorrect regarding the

advantages of simulation-

A Simulation is relatively easy to explain and understand.

B Simulation guarantees an optimal solution.

C Simulation models are flexible.

D A simulation model provides 'a convenient experimental laboratory for

the real system

Answer b

Marks 1

Unit 2

Id 15

Question Which of the following are advantages of simulation?

A Simulation allows "what-if 7' type of questions.

B Simulation can usually be performed by hand or using a smell

calculator.

C Simulation does not interfere with the real-world system.

D a and c only

Answer d

Marks 1

Unit 2

Id 16

Question Markov analysis is a technique that deals with the probabilities of

future occurrences by

A Using Baye's theorem,

B Analyzing presently known probabilities.

C Time series forecasting.

D The maximal flow technique

Answer b

Marks 1

Unit 2

Id 17

Question In transition probability matrix

A The sum of each column is 1

B The sum of each column is 0

C The sum of each row is 1

D The sum of each row is 0

Answer c

Marks 1

Unit 2

Id 18

Question Markov Analysis studies

A Market

B Brand Name

C Brand Switching Behavior

D None of the above

Answer c

Marks 1

Unit 2

Id 19

Question The simulation model uses the mathematical expressions and logical
relationships of the

A Real system.

B Computer model

C Performance measures.

D Estimated inferences.

Answer d

Marks 1

Unit 2

Id 20

Question The fax machine in an office is very unreliable. If it was working

yesterday, there is a 90% chance it will work today. if it was not
working yesterday, there is a 5% chance it will work today. The
probability that it is not working today, if it was not working yesterday,
is
A 0.90

B 0.10

C 0.05

D 0.95

Answer d

Marks 1

Unit 2

Id 21

Question In Markov analysis, we assume that the states are

A Mutually exclusive

B Collectively Exhaustive

C Finite

D All of the above

Answer d

Marks 1

Unit 2

Id 22

Question Simulation is a

A Optimization method

B Descriptive Method

C Measuring Method

D All of the above

Answer b

Marks 1

Unit 2

Id 23

Question A market research organization studied the car purchasing behavior

in a certain region. It was found that there are currently 50000 small
car owner and 30,000 large car owners in the region. What is current
market share vector?
A U =[ 0.5 0.3 ]

B V [0.62 0.38)

C W = [0.6 0.4]

D Can't say

Answer a

Marks 1

Unit 2

Id 24

Question For a situation with weekly purchase of either an Coke or Pepsi cold
drink,

A The weekly purchase is the trial and the cold drink is the state.

B The weekly purchase is the state and the cold drink is the trial.

C The weekly purchase is the trend and the cold drink is the transition.

D The weekly purchase is the transition and the cold drink is the trend.

Answer a

Marks 1

Unit 2

Id 25

Question In a matrix of transition probability, the diagonal element represents.

A Gain

B Loss

C Retention

D None of the above

Answer c

Marks 1

Unit 2

Id 26

Question Which of the following is not true?

A The probabilities of switching from one state to another are called

 transition probabilities.

B Markov chain analysis assumes that the given system has a finite
number of states.

C Switching of different brands of soap within a given set is likely to be

a case of non-absorbing chains.

D An absorbing state is one which if a customer reaches in, then be has

to immediately leave it and return to the initial state

Answer d

Marks 1

Unit 2

Id 27

Question An LPP deals with problems involving only ------------------

A Single objective

B Multiple objectives.

C Two objective.

D None of these.

Answer a

Marks 1

Unit 2

Id 28

Question In LPP, feasible solution -----------------

A Must satisfy all the constraints of the problem simultaneously

B Need not satisfy all of the constraints, only some of them

C Must optimize the value of the objective function.

D Must be a corner point of the feasible region.

Answer a

Marks 1

Unit 2

Id 29

Question While solving LPP graphically to find optimum solution, which of the
 method is used

A Corner point method

B lso- Line method

C Simplex method

D Both a and b

Answer d

Marks 1

Unit 2

Id 30

Question Which of the following is associated with any LPP

A Simulated solution

B Optimum solution

C Network flow

D Quadratic equation

Answer b

Marks 1

Unit 2

Id 31

Question Which of the following is not associated with any LPP

A Feasible solution

B Optimum solution

C Basic solution

D Quadratic equation

Answer d

Marks 1

Unit 2

Id 32

Question Which of the following is not true about feasible region

A It cannot be determined in a graphical solution of an LPP.

B It is independent of the objective function.

C It implies that there must be a convex region satisfying all the

constraints.

D An extreme point of the convex feasible region gives the optimum

solution.

Answer a

Marks 1

Unit 2

Id 33

Question The constraints in LPP model represent

A Availability

B Requirement

C Objective

D .Both a and b

Answer d

Marks 1

Unit 2

Id 34

Question In mathematical programming, the goal represented by objective

function includes

A Profit value

B Total cost and revenue

C Production capacity

D all of the above

Answer d

Marks 1

Unit 2

Id 35

Question In LPP maximization problem, the optimal solution occurring at the

 corner point yields the

A Mid value of objective function

B Highest value of objective function

C Lowest value of objective function

D Mean value of objective function

Answer b

Marks 1

Unit 2

Id 36

Question Practically multiple optimal solutions

A are infeasible

B are unbounded

C are degenerate

D provide management with greater flexibility in selecting and using

resources

Answer d

Marks 1

Unit 2

Id 37

Question Infeasibility means that the number of solutions to the linear

programming problem that satisfies all constraints is

A Zero.

B At least 1.

C All.

D At least 2.

Answer a

Marks 1

Unit 2

Id 38
Question Graphical method of linear programming is useful when the number
of decision variables is

A 1

B 2

C 3

D More than 3

Answer b

Marks 1

Unit 2

Id 39

Question In LPP, the area bounded by all the given constraints is

A Non feasible region

B Basic solution

C Feasible region

D Optimum basic feasible solution

Answer c

Marks 1

Unit 2

Id 40

Question Decision variables

A Tell about how much or how many of something to produce, invest,

purchase, hire, etc,

B Represent the values of the constraints.

C Measure the objective function.

D Must exist for each constraint.

Answer a

Marks 1

Unit 2

Id 41
Question Multiple solution exist in a LPP when

A One of the constraint is redundant

B Objective function is parallel to one of the constraints

C Two constraints are parallel

D All of the above

Answer b

Marks 1

Unit 2

Id 42

Question The overall goal stated as to represent the function of decision

variable in LPP is best classified as

A Constraint function

B Objective function

C Functional modeling

D Programme function

Answer b

Marks 1

Unit 2

Id 43

Question
The mathematical model of an LP problem is important because
A a. It helps in converting the verbal description &numerical data into
mathematical expression

B Decision-makers prefer to work with formal models

C It captures the relevant relationship among decision factors

D It enables the use of algebraic technique

Answer a

Marks 1

Unit 2
Id 44

Question
Linear programming is a
A Constrained optimization technique

B Technique for economic allocation of limited resources

C Mathematical technique

D All of the above

Answer d

Marks 1

Unit 2

Id 45

Question
A constraint in an LP model restricts
a.
b.
c.
d.
A Value of objective function

B Value of a decision variable

C Use of the available resources

D All of the above

Answer d

Marks 1

Unit 2

Id 46

Question
The distinguishing feature of an LP model is
A Relationship among all variables is linear

B It has single objective function &constraints

C Value of decision variables is non-negative

D All of the above

Answer a

Marks 1
Unit 2

Id 47

Question
Constraints in an LP model represents
A Limitations

B Requirements

C Balancing limitations &requirements

D All of the above

Answer d

Marks 1

Unit 2

Id 48

Question
Non-negativity condition is an important component of LP model
because
a.
b.
c.
d.
A Variables value should remain under the control of the decision-
maker

B Value of variables make sense &correspond to real-world problems

C Variables are interrelated in terms of limited resources

D None of the above

Answer b

Marks 1

Unit 2

Id 49

Question
Before formulating a formal LP model, it is better to
a.
b.
c.
d.
A Express each constrain in words
B Express the objective function in words

C Verbally identify decision variables

D All of the above

Answer d

Marks 1

Unit 2

Id 50

Question
Maximization of objective function in an LP model means
a.
b.
c.
d.
A Value occurs at allowable set of decisions

B Highest value is chosen among allowable decisions

C Neither of above

D Both a &b

Answer a

Marks 1

Unit 2

Id 51

Question
Which of the following is not a characteristic of the LP model
a.
b.
c.
d..
A Alternative courses of action

B An objective function of maximization type

C Limited amount of resources

D Non-negativity condition on the value of decision variables

Answer b

Marks 1

Unit 2
Id 52

Question
The best use of linear programming technique is to find an optimal
use of
a.
b.
c.
d.
A Money

B Manpower

C Machine

D All of the above

Answer d

Marks 1

Unit 2

Id 53

Question
Which of the following is not a characteristic of the LP
a.
b.
c.
d.
A Resources must be limited

B Only one objective function

C Parameters value remains constant during the planning period

D The problem must be of minimization type

Answer d

Marks 1

Unit 2

Id 54

Question
Non-negativity condition in an LP model implies
a.
b.
c.
d.
A A positive coefficient of variables in objective function
B A positive coefficient of variables in any constraint

C Non-negative value of resources

D None of the above

Answer d

Marks 1

Unit 2

Id 55

Question
Which of the following is an assumption of an LP model
a.
b.
c.
d.
A Divisibility

B Proportionality

C Additivity

D All of the above

Answer d

Marks 1

Unit 2

Id 56

Question
Which of the following is a limitation associated with an LP model
a.
b.
c.
d.
A The relationship among decision variables in linear

B No guarantee to get integer valued solutions

C No consideration of effect of time &uncertainty on LP model

D All of the above

Answer d

Marks 1

Unit 2
Id 57

Question
The graphical method of LP problem uses
a.
b.
c.
d.
A Objective function equation

B Constraint equations

C Linear equations

D All of the above

Answer d

Marks 1

Unit 2

Id 58

Question
feasible solution to an LP problem
a.
b.
c.
d.
A Must satisfy all of the problem’s constraints simultaneously

B Need not satisfy all of the constraints, only some of them

C Must be a corner point of the feasible region

D Must optimize the value of the objective function

Answer a

Marks 1

Unit 2

Id 59

Question
Which of the following statements is true with respect to the optimal
solution of an LP problem
a.
b.
c.
d
A Every LP problem has an optimal solution
B Optimal solution of an LP problem always occurs at an extreme point

C At optimal solution all resources are completely used

D If an optimal solution exists, there will always be at least one at a

corner

Answer d

Marks 1

Unit 2

Id 60

Question
An iso-profit line represents
a.
b.
c.
d.
A An infinite number of solutions all of which yield the same profit

B An infinite number of solution all of which yield the same cost

C An infinite number of optimal solutions

D A boundary of the feasible region

Answer a

Marks 1

Unit 2

Id 61

Question
If an iso-profit line yielding the optimal solution coincides with a
constaint line, then
a.
b.
c.
d.
A The solution is unbounded

B The solution is infeasible

C The constraint which coincides is redundant

D None of the above

Answer d

Marks 1
Unit 2

Id 62

Question
While plotting constraints on a graph paper, terminal points on both
the axes are connected by a straight line because
a.
b.
c.
d.
A The resources are limited in supply

B The objective function as a linear function

C The constraints are linear equations or inequalities

D All of the above

Answer c

Marks 1

Unit 2

Id 63

Question
constraint in an LP model becomes redundant because
a.
b.
c.
d.
A Two iso-profit line may be parallel to each other

B The solution is unbounded

C This constraint is not satisfied by the solution values

D None of the above

Answer d

Marks 1

Unit 2

Id 64

Question
If two constraints do not intersect in the positive quadrant of the
graph, then

a.
 b.
c.
d.
A The problem is infeasible

B The solution is unbounded

C One of the constraints is redundant

D None of the above

Answer a

Marks 1

Unit 2

Id 65

Question
Constraints in LP problem are called active if they
a.
b.
c.
d.
A Represent optimal solution

B At optimality do not consume all the available resources

C Both a &b

D None of the above

Answer a

Marks 1

Unit 2

Id 66

Question
The solution space (region) of an LP problem is unbounded due to
a.
b.
c.
d.
A An incorrect formulation of the LP model

B Objective function is unbounded

C Neither a nor b

D Both a &b

Answer c
Marks 1

Unit 2

Id 67

Question
While solving a LP model graphically, the area bounded by the
constraints is called
a.
b.
c.
d.
A Feasible region

B Infeasible region

C Unbounded solution

D None of the above

Answer a

Marks 1

Unit 2

Id 68

Question
Alternative solutions exist of an LP model when
a.
b.
c.
d.
A One of the constraints is redundant

B Objective function equation is parallel to one of the constraints

C Two constraints are parallel

D All of the above

Answer b

Marks 1

Unit 2

Id 69

Question
While solving a LP problem, infeasibility may be removed by
a.
b.
 c.
d.
A Adding another constraint

B Adding another variable

C Removing a constraint

D Removing a variable

Answer c

Marks 1

Unit 2

Id 70

Question
If a non-redundant constraint is removed from an LP problem then
a.
b.
c.
d.
A Feasible region will become larger

B Feasible region will become smaller

C Solution will become infeasible

D None of the above

Answer a

Marks 1

Unit 2

Id 71

Question
If one of the constraint of an equation in an LP problem has an
unbounded solution, then
a.
b.
c.
d.
A Solution to such LP problem must be degenerate

B Feasible region should have a line segment

C Alternative solutions exist

D None of the above

Answer b
Marks 1

Unit 2

Id 72

Question
In Markov analysis, state probabilities must
a.
b.
c.
d.
A Sum to one

B Be less than one

C Be greater than one

D None of the above

Answer a

Marks 1

Unit 2

Id 73

Question
State transition probabilities in the Markov chain should
a.
b.
c.
d.
A Sum to 1

B Be less than 1

C Be greater than 1

D None of the above

Answer a

Marks 1

Unit 2

Id 74

Question
The first-order Markov chain is generally used when
a.
b.
c.
 d.
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

Marks 1

Unit 2

Id 75

Question
A problem is classified as Markov chain provided
a.
b.
c.
d.
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

Marks 1

Unit 2

Id 76

Question
The transition matrix elements remain positive from one point to the
next. This property is known as:

a.
b.
c.
d.
A Steady-state property

B Equilibrium property

C Regular property

D All of the above

Answer c

Marks 1

Unit 2

Id 77

Question
Markov analysis is useful for:
a.
b.
c.
d.
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

Marks 1

Unit 2

Id 78

Question
Which of the following is not one of the assumptions of Markov
analysis:
a.
b.
c.
d.
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

Marks 1

Unit 2

Id 79

Question
An advantage of simulation as opposed to optimization is that
 a.
b.
c.
d.
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

Marks 1

Unit 2

Id 80

Question
The purpose of using simulation technique is to
a.
b.
c.
d.
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

Marks 1

Unit 2

Id 81

Question
As simulation is not an analytical model, therefore the result of
simulation must be viewed as
a.
b.
c.
d.
A Unrealistic

B Exact

C Approximation
D Simplified

Answer c

Marks 1

Unit 2

Id 82

Question
While assigning random numbers in Monte Carlo simulation, it is
a.
b.
c.
d.
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

Marks 1

Unit 2

Id 83

Question
Large complicated simulation models are appreciated because
a.
b.
c.
d.
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

Marks 1

Unit 2

Id 84
Question
Simulation should not be applied in all cases because it
a.
b.
c.
d.
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

Marks 1

Unit 2

Id 1

Question In a decision theory problem under complete uncertainty, which one

of the following approaches will not be possible?

A Expected monetary value

B Maximin

C Minimax

D Hurwitz

Answer a

Marks 1

Unit 3

Id 2

Question What will you obtain when you sum the profit for each combination
of a state and action times the probability of the occurrence of the
state?

A Expected monetary value

B Expected opportunity loss

C Expected value of perfect information

D None of the above

Answer a

Marks 1

Unit 3

Id 3

Question Which of the following refers to the chance occurrences that can
affect the outcome of an individual's decision?

A Payoff

B State of nature

C Course of action

D Decision criteria

Answer b

Marks 1

Unit 3

Id 4

Question A situation in which a decision maker knows all of the possible

outcomes of a decision and also knows the probability associated
with each outcome is referred to as

A Certainty

B Risk

C Uncertainty

D Competition

Answer b

Marks 1

Unit 3

Id 5

Question A matrix that, for each state of nature and strategy, shows the
difference between a strategy's payoff and the best strategy's payoff
is called

A maximin matrix

B a minimax regret matrix

C payoff matrix

D maximax matrix

Answer b

Marks 1

Unit 3

Id 6

Question Which theory concerns making sound decisions under conditions of

certainty, risk and uncertainty

A Game Theory

B Network Analysis

C Decision Theory

D None of the above

Answer c

Marks 1

Unit 3

Id 7

Question A pessimistic decision making criterion is

A maximax

B equally likely

C maximin

D decision making under certainty

Answer c

Marks 1

Unit 3

Id 8

Question In decision making under ------------, there are several possible

outcomes for each alternative, and the decision maker knows the
probability of occurrence of each outcome.

A risk

B utility
C certainty

D probability

Answer a

Marks 1

Unit 3

Id 9

Question Each player should follow the same strategy regardless of the other
player's strategy in which of the following games?

A Constant Strategy

B Mixed Strategy

C Pure Strategy

D Dominance strategy

Answer c

Marks 1

Unit 3

Id 10

Question In a zero-sum game,

A what one player wins, the other loses.

B the sum of each player's winnings if the game is played many times
must be zero.

C the game is fair each person has an equal chance of winning.

D long-run profits must be zero.

Answer a

Marks 1

Unit 3

Id 11

Question In a decision theory problem under complete uncertainty, which one

of the following approaches will not be possible?

A Expected monetary value

B Maxmin
C Minimax

D Hurwicz

Answer a

Marks 1

Unit 3

Id 12

Question For decision making under uncertainty, identify the decision rule that
is appropriate for the optimist.

A Laplace

B Maximax

C Minimax regret

D Maxmin

Answer b

Marks 1

Unit 3

Id 13

Question The equally likely decision criteria is also known as

A Bayes

B Laplace

C Minimax

D Hurwicz

Answer b

Marks 1

Unit 3

Id 14

Question The criteria of expected monetary value is used for making decisions
under

A Certainty

B Uncertainty
C Risk

D all of the above

Answer c

Marks 1

Unit 3

Id 15

Question The maximax criteria is

A Optimistic

B Neutral

C Pessimistic

D Can be any one of the above

Answer a

Marks 1

Unit 3

Id 16

Question Which of the following might be viewed as ar-pessimistic decision

criterion?

A Hurwicz criterion

B Maximin

C Maximax

D Minimax

Answer b

Marks 1

Unit 3

Id 17

Question In a zero-sum game,

A what one player wins, the other loses.

B the sum of each player's winnings if the game is played many times
must be zero.
C the game is fair each person has an equal chance of winning.

D long-run profits must be zero.

Answer a

Marks 1

Unit 3

Id 18

Question Point of intersection of pure strategies is called :

A Payoff

B Zero sum game

C Saddle point

D Algebraic

Answer c

Marks 1

Unit 3

Id 19

Question In a maximization problem when each element is subtracted from

largest element.. the resultant matrix indicates

A Pay-off matrix

B Game matrix

C Minimum matrix

D Opportunity loss matrix

Answer d

Marks 1

Unit 3

Id 20

Question A mixed strategy 2 x 2 game is solved by method.

A Sub-game method

B Algebraic method

C Dominance rule
D Saddle point method

Answer b

Marks 1

Unit 3

Id 21

Question In a pure strategy game, probability of selection of his optimal

strategy by a player is

A 0

B 1

C 0.5

D None of the above

Answer b

Marks 1

Unit 3

Id 22

Question Point of intersection of pure strategies called :

A Value of game

B Probability of optimum strategy

C Algebraic sum

D None of the above

Answer a

Marks 1

Unit 3

Id 23

Question A mixed strategy is decision of player to select :

A Same strategy

B Constant Strategy

C Different strategy
D Only one strategy

Answer c

Marks 1

Unit 3

Id 24

Question The equally likely decision criterion is also known as

A Bay's

B Laplace

C Hurwicz

D Maximin

Answer b

Marks 1

Unit 3

Id 25

Question A decision maker who looks at the worst result for every decision,
and chooses the decision with the least disappointing possibility is
using :

A Minimax regret approach

B Conservative approach

C Optimistic approach

D Equally approach

Answer b

Marks 1

Unit 3

Id 26

Question The decision alternatives

A Show what might occur in the problem

B Are not under the control of the decision maker

C List the actions the decision maker can select

D All of the above

Answer c

Marks 1

Unit 3

Id 27

Question Rules for selecting the best alternatives are called :

A Objective

B Outcome

C Events

D Criteria

Answer d

Marks 1

Unit 3

Id 28

Question The size of payoff matrix of a game can be reduced by using the
principle of

A Game inversion

B Rotation reduction

C Dominance

D Game transpose

Answer d

Marks 1

Unit 3

Id 29

Question Game theory models are classified by the

A Number of players

B Sum of all payoffs

C Number of strategies

D All of the above

Answer d

Marks 1

Unit 3

Id 30

Question Which of the following criteria is not used for decision making under
uncertainty

A Maximin

B Maximax

C Minimax

D Minimize expected loss

Answer d

Marks 1

Unit 3

Id 31

Question Which of the following criteria is not used for decision making under
risk

A Maximize expected return

B Maximize return

C Minimize expected loss

D Knowledge of likelihood occurrence of each state of nature

Answer b

Marks 1

Unit 3

Id 32

Question The difference between the expected profit under condition of risk
and the expected profit with perfect information is called

A Expected value of perfect information

B Expected marginal loss

C Expected opportunity loss

D None of the above

Answer a

Marks 1

Unit 3

Id 33

Question The optimization technique which helps in minimizing total waiting

and service costs is

A Queuing Theory

B Decision Theory

C Both A and B

D None of the above

Answer a

Marks 1

Unit 3

Id 34

Question The passenger and the train in queuing system describers

A Customer and server

B Server and customer

C Both Servers

D Both Customers

Answer a

Marks 1

Unit 3

Id 35

Question In Queuing Model which cost is difficult to find

A Service cost

B Facility cost

C Calling cost

D Waiting cost

Answer b
Marks 1

Unit 3

Id 36

Question A single channel system must have

A One queue discipline

B One waiting line

C One customer allowed to stand

D One stage where service is received before exiting the system.

Answer b

Marks 1

Unit 3

Id 37

Question The number of customers in the waiting line means

A Service order

B Queue length

C Waiting time in queue

D None of the above

Answer c

Marks 1

Unit 3

Id 38

Question Which of the following items is not a part of the queuing system?

A Arrival rate

B Service facility

C Queue

D Activity flow

Answer c

Marks 1
Unit 3

Id 39

Question The Server utilization factor is also known as

A Traffic intensity

B Poisson distribution

C Exponential distribution

D Server Idleness

Answer c

Marks 1

Unit 3

Id 40

Question In queue Model, M/M/2, the number of servers is

A 1

B M

C 2

D None of these

Answer b

Marks 1

Unit 3

Id 41

Question The most important factors to consider in analyzing a queuing

system are

A The service and arrival rate

B The nature of the calling population

C The queue discipline

D All of the above

Answer c

Marks 1

Unit 3
Id 42

Question The customers are selected for service at random. This is known as

A First-come, first served

B Random service discipline

C Last come first served

D None of the above

Answer b

Marks 1

Unit 3

Id 43

Question The customer who arrives at a system, move from one queue to
other in multiple server system is

A Balking

B Cropping

C Reneging

D Jockeying

Answer b

Marks 1

Unit 3

Id 44

Question In a departmental store customers arrive at a rate of 15 customers

per hour. The average number of customers that can be handled by
cashier is 20 per hour. The time between successive customer is

A 5 min

B 3 min

C 4 min

D 6 min

Answer c

Marks 1

Unit 3
Id 45

Question The customer who arrives at a bank, see a long line, and leaves to
return another time is

A Cropping

B Jockeying

C Balking

D Reneging

Answer c

Marks 1

Unit 3

Id 46

Question In a departmental store customers arrive at a rate of 24 customers

per hour. The average number of customers that can be handled by
cashier is 30 per hour. What is service rate in this problem?

A 30

B 3

C 24

D 10

Answer a

Marks 1

Unit 3

Id 47

Question The machine and the repairmen in queuing system describes

A Customer and server

B Server and customer

C Both Servers

D Both Customers

Answer a

Marks 1

Unit 3
Id 48

Question In the A/B/C designation for queuing systems, the A term represents
information about

A Service time

B Arrival rate

C Number of channels

D Queue size

Answer b

Marks 1

Unit 3

Id 49

Question For unloading cargo, queue discipline is used

A First come first served

B Last come first served

C Random come first served

D None of the above

Answer b

Marks 1

Unit 3

Id 50

Question
Customer behavior in which the customer moves from one queue to
another in a multiple channel situation is
a.
b.
c.
d.
A Balking

B Reneging

C Jockeying

D Altering
Answer c

Marks 1

Unit 3

Id 51

Question
Which of the following characteristics apply to queuing system
a.
b.
c.
d.
A Customer population

B Arrival process

C Both a &b

D Neither a nor b

Answer c

Marks 1

Unit 3

Id 52

Question
Which of the following is not a key operating characteristics apply to
queuing system
a.
b.
c.
d.
A Utilization factor

B Percent idle time

C Average time spent waiting in the system &queue

D None of the above

Answer d

Marks 1

Unit 3

Id 53

Question
Priority queue discipline may be classified as
 a.
b.
c.
d.
A Finite or infinite

B Limited &unlimited

C Pre-emptive or non-pre-emptive

D All of the above

Answer c

Marks 1

Unit 3

Id 54

Question
The calling population is assumed to be infinite when
a.
b.
c.
d.
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 a

Marks 1

Unit 3

Id 55

Question
Which of the cost estimates &performance measures are not used for
economic analysis of a queuing system
a.
b.
c.
d.
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

Marks 1

Unit 3

Id 56

Question
The cost of providing service in a queuing system decreases with
a.
b.
c.
d.
A Decreased average waiting time in the queue

B Decreased arrival rate

C Increased arrival rate

D None of the above

Answer d

Marks 1

Unit 3

Id 57

Question
Service mechanism in a queuing system is characterized by
a.
b.
c.
d.
A Server’s behavior

B Customer’s behavior

C Customers in the system

D All of the above

Answer a

Marks 1

Unit 3

Id 58

Question
Probabilities of occurrence of any state are
a.
 b.
c.
d.
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

Marks 1

Unit 3

Id 59

Question
In a matrix of transition probability, the probability values should add
up to one in each
a.
b.
c.
d.
A Row

B Column

C Diagonal

D All of the above

Answer a

Marks 1

Unit 3

Id 60

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

a.
b.
c.
d.
A Gain

B Loss
C Retention

D None of the above

Answer c

Marks 1

Unit 3

Id 1

Question -------- is a series of related activities which result in some product or services.

A Network

B transportation mode

C assignment

D none of these

Answer a

Marks 1

Unit 4

Id 2

Question Any activity which does not consume either any resource or time is called activity.

A Predecessor

B Successor

C Dummy

D End

Answer c

Marks 1

Unit 4

Id 3

Question An activity which must be completed before one or more other activities start is known as activity.
A Predecessor

B Successor

C Dummy

D End

Answer a

Marks 1

Unit 4

Id 4

Question Activities that cannot be started until one or more of the other activities are completed, but immediately
succeed them are called ----------- activities

A Predecessor

B Successor

C Dummy

D End

Answer b

Marks 1

Unit 4

Id 5

Question An event which represents the beginning of more than one activity is known as --------event.

A Merge

B Net

C Burst

D None of the above

Answer c

Marks 1

Unit 4

Id 6

Question ----------- is that sequence of activities which determines the total project time.

A Net work
B Critical path

C Critical activities

D None of the above

Answer b

Marks 1

Unit 4

Id 7

Question Activities lying on the critical path are called---------

A Net work

B Critical path

C Critical activities

D None of the above

Answer c

Marks 1

Unit 4

Id 8

Question It----------- at which an activity can start.

A EST

B EFT

C LST

D LFT

Answer a

Marks 1

Unit 4

Id 9

Question With respect to PERT and CPM, slack

A marks the start or completion of a task.

B is the amount of time a task may be delayed without changing the overall project completion time.
C is a task or subproject that must be completed.

D is the latest time an activity can be started without delaying the entire project.

Answer b

Marks 1

Unit 4

Id 10

Question An activity has an optimistic time of 15 days, a most likely time of 18 days, and a pessimistic time of 27
days. What is its expected time?

A 60 days

B 20 days

C 18 days

D 19 days

Answer d

Marks 1

Unit 4

Id 11

Question An activity has an optimistic time of 11 days, a most likely time of 15 days, and a pessimistic time of 23
days. What is its variance?

A 16.33

B 15.6

C 4

D 2

Answer c

Marks 1

Unit 4

Id 12

Question Time an activity would take assuming very unfavorable conditions is represented by the

A Optimistic time

B Most likely time

C Pessimistic time

D Expected time

Answer c

Marks 1

Unit 4

Id 13

Question In an AON network representation, the -------- represents the activities.

A Arrow

B Node

C Time estimate

D Arcs

Answer b

Marks 1

Unit 4

Id 14

Question The earliest start (ES) of an activity is the ----------- earliest finish (EF) of the immediate------------

A smallest, successors

B largest, successors

C smallest, predecessors

D largest, predecessors

Answer d

Marks 1

Unit 4

Id 15

Question The time of an activity in a network can be approximated by which distribution?

A Binomial

B Normal

C Chi-square
D Beta

Answer d

Marks 1

Unit 4

Id 16

Question Which of these may require the use of a dummy activity?

A Gantt Chart

B Activity-on-arrow network.

C Activity-on-node network.

D Both b and C

Answer b

Marks 1

Unit 4

Id 17

Question CPM is :

A Critical Project Management

B Critical Path Management

C Critical Path Method

D Crash Project Method

Answer c

Marks 1

Unit 4

Id 18

Question Activities G, P, and R are the immediate predecessors for activity W. If the earliest finish times for the
three are 12, 15, and 10, then the earliest start time for W

A is 10.

B is 12.

C is 15.

D cannot be determined. –
Answer c

Marks 1

Unit 4

Id 19

Question Activities K, M and S immediately follow activity H, and their latest start times are 14, 18, and 11. The
latest finish time for activity H

A is 11.

B is 14.

C s 18.

D can not be determined.

Answer a

Marks 1

Unit 4

Id 20

Question The critical path

A is any path that goes from the starting node to the completion node.

B is a combination of all paths.

C is the shortest path.

D is the longest path.

Answer d

Marks 1

Unit 4

Id 21

Question Which of the following statements regarding PERT times is true?

A Optimistic time estimate is an estimate of the minimum time an activity will require.

B Optimistic time estimate is an estimate of the maximum time an activity will require.

C Most likely time estimate is an estimate of the maximum time an activity will require.

D Pessimistic time estimate is an estimate of the minimum time an activity will require.

Answer a
Marks 1

Unit 4

Id 22

Question At the completion of the forward and backward passes, the slack for an activity is given by the

A difference between early start and early finish.

B difference between early start and latest finish.

C difference between latest start and early finish

D difference between latest start and early start

Answer d

Marks 1

Unit 4

Id 23

Question A project has three paths: A--B—C has a length of 25 days. A—D—C has a length of 15 days. A—E--C
has a length of 20 days. Which of the following statements is correct?

A A—D—C is the critical path.

B A—B—C has the most slack.

C The expected duration of the project is 25 days.

D The expected duration of this project is 60 days.

Answer c

Marks 1

Unit 4

Id 24

Question With respect to PERT and CPM, slack

A is a task or subproject that must be completed.

B is the latest time an activity can be started without delaying the entire project.

C is the amount of time a task may be delayed without changing the overall project completion time.

D marks the start or completion of a task

Answer c

Marks 1
Unit 4

Id 25

Question A dummy activity is required when

A two or more activities have the same ending events.

B the network contains two or more activities that have identical starting and ending events.

C two or more activities have different ending events.

D two or more activities have the same starting events.

Answer b

Marks 1

Unit 4

Id 26

Question PERT analysis computes the variance of the total project completion time as

A the sum of the variances of all activities in the project.

B the sum of the variances of all activities on the critical path.

C the sum of the variances of all activities not on the critical path.

D the variance of the final activity of the project.

Answer b

Marks 1

Unit 4

Id 27

Question The time of activity in a project can be estimated to have a most likely completion time of 7 days, an
optimistic time of 6 days, and a pessimistic time of 9 days. Which of the following is true of the Expected
time and the variance for this activity

A 0.25 days, 7.17 days

B 7.33 days, 0.25 days

C 7.17 days, 0.25 days

D 3.67 days, 0.25 days

Answer c

Marks 1
Unit 4

Id 28

Question A project's critical path is composed of activities A, B, and C. Activity A has a standard deviation of 2,
activity B has a standard deviation of 1, and activity C has a standard deviation of 2. What is the standard
deviation of the critical path?

A 25

B 9

C 3

D 5

Answer c

Marks 1

Unit 4

Id 29

Question Activities A and B are both 6 days long and the only immediate predecessors to activity C. Activity A has
ES=8 and LS=8 and activity B has ES=7 and LS=10. What is the ES of activity C?

A 14

B 15

C 16

D 13

Answer a

Marks 1

Unit 4

Id 30

Question Dummy activities

A Are found in both AOA and AON networks

B Have a duration equal to the shortest non-dummy activity in the network.

C Cannot be on the critical path.

D Are used when two activities have identical starting and ending events.

Answer d

Marks 1
Unit 4

Id 31

Question Full form of PERT is

A Performance evaluation review technique

B Programme Evaluation Review technique

C Programme Evaluation Research Technique

D None of these.

Answer b

Marks 1

Unit 4

Id 32

Question ----- is the duration by which an activity can be delayed without delaying the project.

A Total float

B latest time

C Earliest event time

D None of these

Answer a

Marks 1

Unit 4

Id 33

Question ---- is the earliest starting time plus activity time.

A EST

B EFT

C LST

D LFT

Answer b

Marks 1

Unit 4
Id 34

Question Generally PERT technique deals with the project of

A repetitive nature

B non- repetitive nature

C deterministic nature

D none of the above

Answer d

Marks 1

Unit 4

Id 35

Question The activity which can be delayed without affecting the execution of the immediate succeding activity
determined by

A total float

B free float

C independent float

D none of the above

Answer b

Marks 1

Unit 4

Id 36

Question A dummy activity is used in the network diagram when

A two parallel activities have the same tail and head events

B the chain of activities may have common event yet be independent by themselves

C both a and b

D none of the above

Answer c

Marks 1

Unit 4

Id 37
Question In sequencing objective is

A Maximize total elapsed time

B Minimize total elapsed time

C Maximize cost

D Minimize sales

Answer b

Marks 1

Unit 4

Id 1

Question If P(A) = 0.6, P(B) = 0.4, P(A and B) = 0.0 , what can be said about
events A and B?

A Independent

B Mutually exclusive

C Posterior probability

D All of the above

Answer b

Marks 1

Unit 5

Id 2

Question The probability of event A occurring is 0.3, while the probability that
event B occurs is 0.8. The probability that event A and event B occur
simultaneously is 0.2. If it is known that event A occurred, what is the
probability that event B occurred also?

A 0.67

B 0.25

C 0.16
D 0.90

Answer a

Marks 1

Unit 5

Id 3

Question A production process is known to produce a particular item in such a

way that 3% of these are defective. If three items are randomly
selected as they come off the production line, what is the probability
that all three are defective (assuming that they are all independent)?

A 0.027

B 0.09

C 0.00027

D 0.000027

Answer b

Marks 1

Unit 5

Id 4

Question A company is considering producing some new products. Based on

past records, management believes that there is a 60% chance that
the first product will be successful, and a 40% chance that the second
product will be successful. As these products are completely different,
it may be assumed that the success of one is totally independent of
the success of the other. If two products are introduced to the market,
what is the probability that both are successful?

A 0.12

B 0.60

C 0.24

D 0.36

Answer c

Marks 1

Unit 5

Id 5

Question In a throw of coin what is the probability of getting head.

A 1

B 2

C ½

D 0

Answer c

Marks 1

Unit 5

Id 6

Question In a throw of dice what is the probability of getting number greater

than 5

A ½

B 1/3

C 1/5

D 1/6

Answer d

Marks 1

Unit 5

Id 7

Question If two events are independent, then

A they must be mutually exclusive

B the sum of their probabilities must be equal to one

C their intersection must be zero

D None of these alternatives is correct.

Answer d

Marks 1

Unit 5

Id 8

Question Probability lies between :

A -1 and +1
B 0 and 1

C 0 and n

D 0 and co

Answer b

Marks 1

Unit 5

Id 9

Question A set of all possible outcomes of an experiment is called :

A Combination

B Sample point

C Sample space

D Compound event

Answer c

Marks 1

Unit 5

Id 10

Question The events having no experimental outcomes in common is called :

A Equally likely events

B Exhaustive events

C Mutually exclusive events

D Independent events .

Answer c

Marks 1

Unit 5

Id 11

Question The probability associated with the reduced sample space is called:

A Conditional probability

B Statistical probability
C Mathematical probability

D Subjective probability

Answer a

Marks 1

Unit 5

Id 12

Question If A is any event in S and A its complement, then P(A) is equal to:

A 1

B 0

C 1-A

D 1-P(A)

Answer d

Marks 1

Unit 5

Id 13

Question When certainty is involved in a situation, its probability is equal to:

A Zero

B Between-I and + 1

C Between 0 and 1

D One

Answer d

Marks 1

Unit 5

Id 14

Question Which of the following cannot be taken as probability of an event?

A 0

B 0.5

C 1
D -1

Answer d

Marks 1

Unit 5

Id 15

Question The term 'sample space' is used for:

A All possible outcomes

B All possible coins

C Probability

D Sample

Answer a

Marks 1

Unit 5

Id 16

Question The term 'event' is used for:

A Time

B A sub-set of the sample space

C Probability

D Total number of outcomes.

Answer b

Marks 1

Unit 5

Id 17

Question When the occurrence of one event has no effect on the probability of
the occurrence of another event, the events are called :

A Independent

B Dependent

C Mutually exclusive

D Equally likely
Answer a

Marks 1

Unit 5

Id 18

Question The six faces of the die are called equally likely if the die is :

A Small

B Fair

C Six-faced

D Round

Answer b

Marks 1

Unit 5

Id 19

Question If we toss a coin and P(T)=2P(H), then probability of head is equal to:

A 0

B ½

C 1/3

D 2/3

Answer c

Marks 1

Unit 5

Id 20

Question Given P(A) = 0.3, P(B) = 0.5 and P(AUB)=0.8,then:

A A and B are not mutually exclusive events

B A and B are equally likely events

C A and Bare independent events

D A and B are mutually exclusive events

Answer d
Marks 1

Unit 5

Id 21

Question Two dice are rolled. Probability of getting similar faces is:

A 5/36

B 1/6

C 1/3

D ½

Answer b

Marks 1

Unit 5

Id 22

Question Probability of getting a red ace if a card is drawn at random from pack
of 52 cards is

A 1/52

B 1/26

C 1/13

D 1

Answer b

Marks 1

Unit 5

Id 23

Question A standard normal distribution has:

A the mean equal to the variance

B mean equal 1 and variance equal 1

C mean equal 0 and variance equal 1

D mean equal 0 and standard deviation equal 0

Answer c

Marks 1

Unit 5

Id 24

Question Total Area under the normal curve is

A 0

B Greater than 1

C 1

D Less than 1

Answer d

Marks 1

Unit 5

Id 25

Question A Bernoulli trial has:

A At least two outcomes

B At most two outcomes

C Two outcomes

D Fewer than two outcomes

Answer c

Marks 1

Unit 5

Id 26

Question In a binomial probability distribution, the sum of probability of failure

and probability of success is always:

A Zero

B Less than 0.5

C Greater than 0.5

D One

Answer d
Marks 1

Unit 5

Id 27

Question If n = 6 and p= 0.9 then the value of P(x = 7) is:

A Zero

B Less than zero

C More than zero

D One

Answer a

Marks 1

Unit 5

Id 28

Question In a multiple choice test there are five possible answers to each of 20
questions. If a candidate guesses the correct answer each time, the
mean number of correct answers is:

A 4

B 5

C 1/5

D 20

Answer a

Marks 1

Unit 5

Id 29

Question If the probability of a success is 0.80, and there are n=10 trials, then
the mean of the binomial distribution is would be

A 1.6

B 1.26

C 8

D 0.08

Answer c
Marks 1

Unit 5

Id 30

Question If n = 10 and p = 0.8, then the variance of the binomial distribution is

A 1.6

B 1.26

C 8

D 0.08

Answer a

Marks 1

Unit 5