# MBA/MBA Business Mathematics Mcq Set 2 Sample Test,Sample questions

1.4x4.

2.1x4.

3.1x1.

4.4x1.

1.-1

2.+1.

3.0.

4.2.

## Question: `A dummy activity is used in the network diagram when _______`

1.Two parallel activities have the same tail and head events.

2.The chain of acitivities may have a common event yet he independent by themselves.

3.Both a & b

4.None of the above.

1.Event.

2.Node.

3.Slack.

4.Variables.

## Question: `Activity â€“on-arrow (AOA) diagram is prefeered over Activity â€“ on-node (AON) diagram because ______`

1.AOA diagrams are simple to construct.

2.AOA diagrams give a better sense of the flow of time throughout a project.

3.AOA diagrams do not involve dummy activites

4.All the above.

## Question: `Compound Interest is always ______________ the Simple Interest.`

1.Lesser than

2.Equal to

3.Greater than

4.None of the above.

## Question: `Earliest finish time that an activity can be finished without ______________ of precedence requirements.`

1.Planning

2.Violation.

3.Both a&b

4.None of the above

1.3x4

2.3x3

3.4x3

4.4x4

## Question: `If A,B and C are matrices of the same order then ______`

1.(A+B)+C=A+(B+C).

2.(A+B)+C â‰  A+(B+C).

3.(A+B)+C> A+(B+C).

4.(A+B)+C < A+(B+C).

1.A+B=B+A.

2.A+Bâ‰ B+A.

3.A+B<B+A.

4.A+B>B+A.

## Question: `In a linear programming minimization model the objective function is to be ______`

1.minimized.

2.maximized.

3.minimized or maximized.

4.standardized.

## Question: `In graphical method the LPP has unbounded solution if the solution space has`

1.no upper boundary.

2.no lower boundary.

3.no boundary in the first quadrant.

4.None of the above.

## Question: `In Graphical solution the redundant constraint is ____`

1.which forms the boundary of feasible region.

2.which do not optimizes the objective function.

3.which does not form boundary of feasible region.

4.which optimizes the objective function.

## Question: `In Least cost method the allocation is done by selecting _______`

1.upper left corner.

2.upper right corner.

3.middle cell in the transportation table.

4.cell with the lowest cost.

## Question: `In North West corner rule if the demand in the column is satisfied one must move to the _______`

1.left cell in the next column.

2.right cell in the next row.

3.right cell in the next column.

4.left cell in the next row.

## Question: `In the canonical form of LPP if the objective function is of maximization, then all the constraints other than non-negativity conditions are ______`

1.greater than type.

2.lesser than type.

3.greater than or equal to type.

4.lesser than or equal to type.

## Question: `In the PERT network each activity time assumes a Beta distribution because ______`

1.It is a unimodal distribution that provides information regarding the uncertainity of time estimates of activities.

2.It has got finite non-negative error.

3.It need not be symmetrical about model value .

4.All the above.

## Question: `In the standard form of LPP if the objective functions is of minimization then all the constraints ______`

1.equations.

2.inequalities.

3.greater than or equal to type.

4.lesser than or equal to type.

## Question: `In time cost trade off function analysis ______`

1.Cost decreases linearily as time increases.

2.Cost at normal time is zero.

3.Cost increses linearily as time increases.

4.None of the above.

## Question: `In transportation problem if total supply > total demand we add _______`

1.dummy row with cost 0.

2.dummy column with cost 0.

3.dummy row with cost 1.

4.dummy column with cost 1.

## Question: `In Transportation problem the improved solution of the initial basic feasible solution is called ______`

1.basic solution.

2.optimal solution.

3.degenerate solution.

4.non-degenerate solution.

## Question: `In Transportation problem the preferred method of obtaining either optimal or very close to the optimal solution is ______`

1.north west corner rule.

2.least cost method.

3.vogel's approximation method.

4.simplex method.

## Question: `Latest finish time that an activity can be finished without ______________ the entire project.`

1.Delaying.

2.Planning

3.Both a & b

4.None of the above

## Question: `O.R. Stands for _______`

1.Operations research

2.Open Report

3.Own Record

1.Planning.

2.Scheduling.

3.Controlling.

4.Both b & c.

## Question: `Purpose of MODI method is to get _________`

1.degenerate solution.

2.non-degenerate solution.

3.optimal.

4.basic feasible solution.

1.Emerging

2.Smoothing out.

3.Minimize

4.Maximize

## Question: `The another term commonly used for activity slack time is _____`

1.Total float.

2.Independent float.

3.Free float.

4.All the above.

## Question: `The application of assignment problems is to obtain _______`

1.only minimum cost.

2.only maximum profit.

3.minimum cost or maximum profit.

4.assign the jobs.

## Question: `The assignment problem is said to be balanced if it is _______`

1.square matrix.

2.rectangular matrix.

3.unit matrix.

4.triangular matrix.

## Question: `The assignment problem is said to be balanced if __________`

1.number of rows is greater than number of columns.

2.number of rows is lesser than number of columns.

3.number of rows is equal to number of columns.

4.if the entry of row is zero.

## Question: `The borrowers are also known as _____`

1.Debtor's

2.Creditor's

3.Both a & b

4.None of the above.

1.2500.

2.2200.

3.6000.

4.2500.

## Question: `The CPM is used for completing the project that involves ______________ of repetitive nature.`

1.Activities

2.Node

3.Event.

4.Dummy activity.

## Question: `The graphical method is applicable to solve an L.P.P when there is _____`

1.Only one variable.

2.Two variables.

3.More than two variables

4.None of the above.

## Question: `The non-negative variable which is added to LHS of the constraint to convert the inequality â‰¤ into equation is called ________`

1.random variable.

2.decision variable.

3.surplus variable.

4.slack variable.

## Question: `The Objective function of Transportation problem is to _________`

1.maximize the total cost.

2.minimize or maximize the total cost.

3.minimize the total cost.

4.total cost should be zero.

## Question: `The objective of Transportation problem is to allocate ________`

1.number of origins to equal number of destinations at minimum cost.

2.number of origins to equal number of destination at maximum cost.

3.only to maximize cost.

4.only to maximize the profit.

## Question: `The slack for an activity is equal to _____`

1.LF-LS.

2.EF-ES.

3.LS-ES.

4.None of the above.

## Question: `The ______________ is the method available for solving an L.P.P.`

1.graphical method.

2.least cost method.

3.MODI method.

4.hungarian method.

## Question: `Transportation problem is said to be balanced if ______`

1.total supply is not equal to total demand.

2.total supply is greater than total demand.

3.total supply is lesser than total demand.

4.total supply is equal to total demand.

## Question: `Transportation problem is said to be unbalanced if _______`

1.total supply is not equal to total demand.

2.Total supply is greater than total demand.

3.total supply is lesser than total demand.

4.All the above.

## Question: `Vogel's approximation method is also known as ______`

1.Penalty method

2.North west method.

3.Least cost method

4.None of the above.

1.unit matrix.

2.square matrix.

3.null matrix.

4.Row matrix.

## Question: `When the number of rows is not equal to the number of columns then the matrix is said to be _______`

1.unit matrix.

2.Rectangular matrix.

3.null matrix.

4.Row matrix.

## Question: `When the payments are to be made at the end of each interval the annuity is called ______`

1.immediate annuity.

2.annuity due.

3.both( a) and( b).

4.present annuity.

## Question: `Which of the following is not true about feasibility?`

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

2.It is independent of the objective function.

3.It implies that there must be a convex region satisfying all the constraints.

4.Extreme points of the convex region give the optimum solution.

## Question: `While drawing the network diagram for each activity project we should look _____`

1.What acitivities preceede this acitivity.

3.What activity can concurrently take place with this activity.

4.All the above.

## Question: `______ is the point in time that marks the beginning or ending of an activity.`

1.Event.

2.Node.

3.Activity.

4.Dummy activity.

1.Planning.

2.Scheduling.

3.Controlling.

4.All the above.

## More MCQS

##### Olete Team
Online Exam TestTop Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on Online Exam Testwebsite is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!