FirstRanker Logo

FirstRanker.com - FirstRanker's Choice is a hub of Question Papers & Study Materials for B-Tech, B.E, M-Tech, MCA, M.Sc, MBBS, BDS, MBA, B.Sc, Degree, B.Sc Nursing, B-Pharmacy, D-Pharmacy, MD, Medical, Dental, Engineering students. All services of FirstRanker.com are FREE

📱

Get the MBBS Question Bank Android App

Access previous years' papers, solved question papers, notes, and more on the go!

Install From Play Store

Download Calicut University M.Com Latest 2020 Management Science Question Bank

Download UOC (University of Calicut) M.Com (Master of Commerce) Management Science Question Bank (Important Questions)

This post was last modified on 26 December 2019

This download link is referred from the post: Calicut University M.Com 2020 Important Questions (Question Bank) || (University of Calicut)


MANGEMENT SCIENCE

  1. In a balanced transportation model where supply equals demand,
    1. all constraints are equalities
    2. none of the constraints are equalities
    3. --- Content provided by FirstRanker.com ---

    4. all constraints are inequalities
    5. none of the constraints are inequalities
  2. In a transportation problem, items are allocated from sources to destinations
    1. at a maximum cost
    2. at a minimum cost
    3. --- Content provided by FirstRanker.com ---

    4. at a minimum profit
    5. at a minimum revenue
  3. The assignment model is a special case of the ________ model.
    1. maximum-flow
    2. transportation
    3. --- Content provided by FirstRanker.com ---

    4. shortest-route
    5. none of the above
  4. The linear programming model for a transportation problem has constraints for supply at each ________ and ________ at each destination.
    1. destination / source
    2. source / destination
    3. --- Content provided by FirstRanker.com ---

    4. demand / source
    5. source / demand
  5. An assignment problem is a special form of transportation problem where all supply and demand values equal
    1. 0
    2. 1
    3. --- Content provided by FirstRanker.com ---

    4. 2
    5. 3
  6. The transshipment model is an extension of the transportation model in which intermediate transshipment points are ________ between the sources and destinations.
    1. decreased
    2. deleted
    3. --- Content provided by FirstRanker.com ---

    4. subtracted
    5. added
  7. Inventory costs include
    1. carrying
    2. ordering
    3. --- Content provided by FirstRanker.com ---

    4. shortage costs
    5. all of the above
  8. In a(an) ________ inventory system a constant amount is ordered when inventory declines to a predetermined level.
    1. optional
    2. economic
    3. --- Content provided by FirstRanker.com ---

    4. periodic
    5. continuous
  9. EOQ is a(an) ________ inventory system.
    1. periodic
    2. continuous
    3. --- Content provided by FirstRanker.com ---

    4. optimal
    5. economic
  10. In the linear programming formulation of the shortest route problem, there is one constraint for each node indicating
    1. capacity on each path
    2. whatever comes into a node must also go out
    3. --- Content provided by FirstRanker.com ---

    4. capacity on each arc
    5. a maximum capacity on a path
  11. The minimal spanning tree problem determines the ________ total branch lengths connecting all nodes in the network
    1. selected
    2. maximum
    3. --- Content provided by FirstRanker.com ---

    4. minimum
    5. divided
  12. The objective of the maximal flow solution approach is to ________ the total amount of flow from an origin to a destination
    1. minimize
    2. maximize
    3. --- Content provided by FirstRanker.com ---

    4. discriminate
    5. divide
  13. If an activity cannot be delayed without affecting the entire project, it is a ________ activity
    1. completed
    2. critical
    3. --- Content provided by FirstRanker.com ---

    4. conjugated
    5. none of the above
  14. A ________ represents the beginning and end of activities, referred to as events.
    1. path
    2. arc
    3. --- Content provided by FirstRanker.com ---

    4. branch
    5. node
  15. When an activity is completed at a node, it has been
    1. finished
    2. ended
    3. --- Content provided by FirstRanker.com ---

    4. realized
    5. completed
  16. Project management differs from management for more traditional activities mainly because of
    1. its limited time frame
    2. its unique set of activities
    3. --- Content provided by FirstRanker.com ---

    4. a and b
    5. none of the above
  17. The critical path is the ________ time the network can be completed.
    1. maximum
    2. minimum
    3. --- Content provided by FirstRanker.com ---

    4. longest
    5. shortest
  18. Attributes of decision-making techniques include all of the following except:
    1. payoffs
    2. constraints
    3. --- Content provided by FirstRanker.com ---

    4. alternatives
    5. states of nature
  19. With the criterion ________, the decision maker attempts to avoid regret.
    1. minimax regret
    2. equal likelihood
    3. --- Content provided by FirstRanker.com ---

    4. Hurwicz
    5. maximin
  20. To lose the opportunity to make a defined profit by making the best decision is referred to as:
    1. equal likelihood criterion
    2. state
    3. --- Content provided by FirstRanker.com ---

    4. payoff
    5. regret
  21. The length of a queue
    1. could be finite
    2. could be infinite
    3. --- Content provided by FirstRanker.com ---

    4. can constantly change
    5. all of the above
  22. Items may be taken from a queue
    1. on a first-come-first-serve basis
    2. on a last-come-first-serve basis
    3. --- Content provided by FirstRanker.com ---

    4. according to the due date of the item
    5. all of the above
  23. Which of the following items is not a part of the queuing system?
    1. arrival rate
    2. service facility
    3. --- Content provided by FirstRanker.com ---

    4. waiting line
    5. activity flow
  24. In a single-server queuing model, the average number customers in the queuing system is calculated by dividing the arrival rate by:
    1. service rate
    2. service time
    3. --- Content provided by FirstRanker.com ---

    4. service rate minus arrival rate
    5. service rate plus arrival rate
  25. The most important factors to consider in analyzing a queuing system are
    1. the service and arrival rate
    2. the nature of the calling population
    3. --- Content provided by FirstRanker.com ---

    4. the queue discipline
    5. all of the above
  26. Queuing analysis is a deterministic technique.
    1. True
    2. False
    3. --- Content provided by FirstRanker.com ---

  27. The operating characteristics of a queuing system provide information rather than an optimization of a queuing system.
    1. True
    2. False
  28. The applicability of forecasting methods depends on
    1. the time frame of the forecast
    2. --- Content provided by FirstRanker.com ---

    3. the existence of patterns in the forecast
    4. the number of variables to which the forecast is related
    5. all of the above
  29. Management Science process includes
    1. defining problem
    2. --- Content provided by FirstRanker.com ---

    3. developing model
    4. both a and b
    5. a only
  30. ________ is an idealised representation of real life
    1. model
    2. --- Content provided by FirstRanker.com ---

    3. module
    4. analogue
    5. iconic model
  31. If the value of the game is zero it is called
    1. zero sum game
    2. --- Content provided by FirstRanker.com ---

    3. two person zero game
    4. fair game
    5. none
  32. Principles of modelling ?
    1. simplicity
    2. --- Content provided by FirstRanker.com ---

    3. validity
    4. clarity
    5. all of the above
  33. The outcome of a game in the form of gain or losses is called.......
    1. pay off
    2. --- Content provided by FirstRanker.com ---

    3. saddle point
    4. pay off matrix
    5. none
  34. The loss incurred because of failure to take the best possible decision
    1. opportunity loss
    2. --- Content provided by FirstRanker.com ---

    3. contemporary loss
    4. opportunity cost
    5. expected loss
  35. For a linear programming equations, convex set of equations is included in region of
    1. feasible solutions
    2. --- Content provided by FirstRanker.com ---

    3. disposed solutions
    4. profit solutions
    5. loss solutions
  36. In graphical solutions of linear inequalities, solution can be divided into
    1. one subset
    2. --- Content provided by FirstRanker.com ---

    3. two subsets
    4. three subsets
    5. four subsets
  37. Linear programming used to optimize mathematical procedure and is
    1. subset of mathematical programming
    2. --- Content provided by FirstRanker.com ---

    3. dimension of mathematical programming
    4. linear mathematical programming
    5. all of above
  38. In linear programming, objective function and objective constraints are
    1. solved
    2. --- Content provided by FirstRanker.com ---

    3. linear
    4. quadratic
    5. adjacent
  39. What refers to Linear Programming that includes an evaluation of relative risks and uncertainties in various alternatives of choice for management decisions?
    1. Probabilistic Programming
    2. --- Content provided by FirstRanker.com ---

    3. Stochastic Programming
    4. Both A and B
    5. Linear Programming
  40. What enables us to determine the earliest and the latest times for each of the events and activities and thereby helps in the identification of the critical path?
    1. Programme Evaluation
    2. --- Content provided by FirstRanker.com ---

    3. Review Technique(PERT)
    4. Both A and B
    5. Deployment of resources
  41. ________ models involves the allocation of resources to activities in such a manner that some measure of effectiveness is optimized.
    1. Sequencing
    2. --- Content provided by FirstRanker.com ---

    3. Allocation Models
    4. Queuing Theory
    5. Decision Theory
  42. Allocation problems can be solved by
    1. Linear Programming Technique
    2. --- Content provided by FirstRanker.com ---

    3. Non – Linear Programming Technique
    4. Both A and B
    5. None of the above
  43. Allocation Models are ________
    1. Iconic models
    2. --- Content provided by FirstRanker.com ---

    3. Analogue Models
    4. Symbolic Models
    5. None of the above
  44. Every LPP is associated with another LPP is called ________
    1. Primal
    2. --- Content provided by FirstRanker.com ---

    3. Dual
    4. Non - linear programming
    5. None of the above
  45. As for maximization in assignment problem, the objective is to maximize the ________
    1. Profit
    2. --- Content provided by FirstRanker.com ---

    3. optimization
    4. cost
    5. None of the above
  46. ________ is one of the fundamental combinatorial optimization problems.
    1. Assignment problem
    2. --- Content provided by FirstRanker.com ---

    3. Transportation problem
    4. Optimization Problem
    5. None of the above
  47. PERT and CPM
    1. are most valuable when a small number of activities must be scheduled.
    2. --- Content provided by FirstRanker.com ---

    3. have different features and are not applied to the same situation.
    4. do not require a chronological relationship among activities.
    5. have been combined to develop a procedure that uses the best of each
  48. Arcs in a project network indicate
    1. completion times.
    2. --- Content provided by FirstRanker.com ---

    3. precedence relationships.
    4. activities.
    5. the critical path.
  49. 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
    1. is 10.
    2. --- Content provided by FirstRanker.com ---

    3. is 12.
    4. is 15.
    5. cannot be determined.
  50. The critical path
    1. is any path that goes from the starting node to the completion node.
    2. --- Content provided by FirstRanker.com ---

    3. is a combination of all paths.
    4. is the shortest path.
    5. is the longest path
  51. Times between two successive requests arriving, called the
    1. Interarrival time
    2. --- Content provided by FirstRanker.com ---

    3. Arrival time
    4. Poisson distribution
    5. Average residual service time
  52. With the transportation technique, the initial solution can be generated in any fashion one chooses. The only restriction is that
    1. the solution must be optimal.
    2. --- Content provided by FirstRanker.com ---

    3. the solution is not degenerate.
    4. one must use the northwest-corner method.
    5. the edge constraints for supply and demand are satisfied.
  53. Transportation models can be used for which of the following decisions?
    1. facility location
    2. --- Content provided by FirstRanker.com ---

    3. production mix
    4. media selection
    5. portfolio selection
    6. employee shift scheduling
  54. --- Content provided by FirstRanker.com ---

  55. The two most common objectives for the assignment problem are the minimization of
    1. uncertainty or inexperience
    2. total costs or inexperience
    3. total costs or total time
    4. total time or inexperience
    5. total costs or uncertainty
    6. --- Content provided by FirstRanker.com ---

  56. In an assignment problem
    1. the number of rows and columns must be equal.
    2. the number of rows must exceed the number of columns.
    3. the number of rows must equal or exceed the number of columns
    4. the number of columns must equal or exceed the number of rows.
    5. --- Content provided by FirstRanker.com ---

    6. none of the above
  57. The decisions which are affect the business in the short run ?
    1. tactical solutions
    2. strategic decisions
    3. management decisions
    4. --- Content provided by FirstRanker.com ---

    5. none
  58. Which of the following methods is used only with the assignment problem?
    1. the Hungarian method
    2. stepping-stone method
    3. MODI method
    4. --- Content provided by FirstRanker.com ---

    5. Vogel's approximation method
    6. the simplex method
  59. Monte Carlo simulation gets its name from which of the following?
    1. Model formulation
    2. Analysis
    3. --- Content provided by FirstRanker.com ---

    4. Data collection
    5. Random-number assignment
  60. Which of the following statistical methods are commonly used to analyze simulation results?
    1. t-tests
    2. Regression analysis
    3. --- Content provided by FirstRanker.com ---

    4. Analysis of variance
    5. All of the above
  61. VAM stands for ________
    1. Vogeal's Approximation Method
    2. Vogel's Approximate Method
    3. --- Content provided by FirstRanker.com ---

    4. Vangel's Approximation Method
    5. Vogel's Approximation Method

FirstRanker.com


--- Content provided by FirstRanker.com ---


This download link is referred from the post: Calicut University M.Com 2020 Important Questions (Question Bank) || (University of Calicut)