Business Mathematics Online MCQ Set 2

QN01. If the number of rows of a matrix is greater than the number of columns then the matrix is called as ______________.

  1. a row matrix.
  2. a column matrix.
  3. a rectangular matrix.
  4. a square matrix.
Answer

(C)a rectangular matrix.

QN02. The ______________ is the order of the largest square submatrix.

  1. Rank of a matrix
  2. Size of a matrix
  3. Both a & b
  4. None of the above.
Answer

(A)Rank of a matrix

QN03. The formula for the face value A is given by ______________.

  1. (B.DxT.D)/(B.D-T.D).
  2. 100T.D/nr.
  3. 100r/100-nr.
  4. Pnr/100.
Answer

(B)100T.D/nr.

QN04. Under compound interest the formula for A is given by ______________.

  1. A=P(1+ni).
  2. A=P(1+i).
  3. A=Pnr/100.
  4. A=P(1+i)n.
Answer

(D)

A=P(1+i)n.

QN05. The region on the graph sheet with satisfies the constraints including the non-negativity restrictions is called the ______________ space

  1. solution.
  2. interval.
  3. concave.
  4. convex.
Answer

(A)solution.

QN06. An LPP deals with problems involving only ______________.

  1. single objective.
  2. multiple objective.
  3. two objective.
  4. none of these.
Answer

(A)single objective.

QN07. In Graphical solution the feasible solution is any solution to a LPP which satisfies ______________.

  1. only objective function.
  2. non-negativity restriction.
  3. only constraint.
  4. all the three.
Answer

(B)non-negativity restriction.

QN08. In an LPP the solution for the problems involving more than 2 variables can be solved using ______________ _.

  1. graphical method.
  2. simplex method.
  3. hungarian method.
  4. all the above
Answer

(B)simplex method.

QN09. The Key column in simplex method is selected when the column of Zj-Cj is ______________.

  1. most negative.
  2. largest negative.
  3. positive.
  4. zero.
Answer

(A)most negative.

QN10. Which of the following is associated with any L.P.P?

  1. feasible solution.
  2. optimum solution.
  3. basic solution.
  4. all the above.
Answer

(D)all the above.

QN11. The slack for an activity is equal to ______________

  1. LF-LS.
  2. EF-ES.
  3. LS-ES.
  4. None of the above.
Answer

(C)LS-ES.

QN12. 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.
Answer

(C)Both a & b

QN13. 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.
Answer

(B)AOA diagrams give a better sense of the flow of time throughout a project.

QN14. 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
Answer

(B)Violation.

QN15. A small circle or rectangle that is known as ______________ serves as a junction point in the project network.

  1. Event.
  2. Node.
  3. Slack.
  4. Variables.
Answer

(B)Node.

QN16. Project ______________ phase allocates resources to work packages.

  1. Planning.
  2. Scheduling.
  3. Controlling.
  4. Both b & c.
Answer

(A)Planning.

QN17. 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.
Answer

(C)minimize the total cost.

QN18. 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.
Answer

(D)cell with the lowest cost.

QN19. Purpose of MODI method is to get ______________.

  1. degenerate solution.
  2. non-degenerate solution.
  3. optimal.
  4. basic feasible solution.
Answer

(C)optimal.

QN20. 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.
Answer

(B)dummy column with cost 0.

QN21. 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.
Answer

(D)assign the jobs.

QN22. The assignment problem is said to be balanced if it is ______________.

  1. square matrix.
  2. rectangular matrix.
  3. unit matrix.
  4. triangular matrix.
Answer

(A)square matrix.

QN23. 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.
Answer

(A)number of origins to equal number of destinations at minimum cost

QN24. If Aand B are matrices of same order then ______________.

  1. A+B=B+A.
  2. A+B≠B+A.
  3. A+B<B+A.
  4. A+B>B+A.
Answer

(A)A+B=B+A.

QN25. When all the elements of a matrix are zeros, the matrix is called ______________.

  1. unit matrix.
  2. square matrix.
  3. null matrix.
  4. Row matrix.
Answer

(C)null matrix.

QN26. ( 3 8 9 - 2 ) is a row matrix of order______________.

  1. 4×4.
  2. 1×4.
  3. 1×1.
  4. 4×1.
Answer

(B)1×4.

QN27. If a matrix has 4 rows and 3 columns, then the size will be denoted by

  1. 3×4
  2. 3×3
  3. 4×3
  4. 4×4
Answer

(C)4×3

QN28. The borrowers are also known as ______________.

  1. Debtor's
  2. Creditor's
  3. Both a & b
  4. None of the above.
Answer

(A)Debtor's

QN29. The compound interest for Rs 20000 for 3 years at 10 & is ______________.

  1. 2500.
  2. 2200.
  3. 6000.
  4. 2500.
Answer

(C)6000.

QN30. 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.
Answer

(A)immediate annuity.

QN31. 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.
Answer

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

QN32. 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.
Answer

(D)lesser than or equal to type.

QN33. 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.
Answer

(D)slack variable.

QN34. 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.
Answer

(A)no upper boundary.

QN35. The ______________ is the method available for solving an L.P.P.

  1. graphical method.
  2. least cost method.
  3. MODI method.
  4. hungarian method.
Answer

(A)graphical method.

QN36. The another term commonly used for activity slack time is ______________

  1. Total float.
  2. Independent float.
  3. Free float.
  4. All the above.
Answer

(D)All the above.

QN37. While drawing the network diagram for each activity project we should look ______________

  1. What acitivities preceede this acitivity.
  2. What acitivities follow this acitivity.
  3. What activity can concurrently take place with this activity.
  4. All the above.
Answer

(D)All the above.

QN38. Resource leveling is the process of ______________ the utilization of resources in a project.

  1. Emerging
  2. Smoothing out.
  3. Minimize
  4. Maximize
Answer

(B)Smoothing out.

QN39. 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
Answer

(A)Delaying.

QN40. ______________ phase identify manpower that will be responsible for each task.

  1. Planning.
  2. Scheduling.
  3. Controlling.
  4. All the above.
Answer

(B)Scheduling.

ed010d383e1f191bdb025d5985cc03fc?s=120&d=mm&r=g

DistPub Team

Distance Publisher (DistPub.com) provide project writing help from year 2007 and provide writing and editing help to hundreds student every year.