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

Download Document

Calicut University M.Com 2020 Important Questions (Question Bank) || (University of Calicut)

MANGEMENT SCIENCE

In a balanced transportation model where supply equals demand,
1. all constraints are equalities
2. none of the constraints are equalities
3. all constraints are inequalities
4. none of the constraints are inequalities
In a transportation problem, items are allocated from sources to destinations
1. at a maximum cost
2. at a minimum cost
3. at a minimum profit
4. at a minimum revenue
The assignment model is a special case of the ________ model.
1. maximum-flow
2. transportation
3. shortest-route
4. none of the above
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. demand / source
4. source / demand
An assignment problem is a special form of transportation problem where all supply and demand values equal
1. 0
2. 1
3. 2
4. 3
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. subtracted
4. added
Inventory costs include
1. carrying
2. ordering
3. shortage costs
4. all of the above
In a(an) ________ inventory system a constant amount is ordered when inventory declines to a predetermined level.
1. optional
2. economic
3. periodic
4. continuous
EOQ is a(an) ________ inventory system.
1. periodic
2. continuous
3. optimal
4. economic
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. capacity on each arc
4. a maximum capacity on a path
The minimal spanning tree problem determines the ________ total branch lengths connecting all nodes in the network
1. selected
2. maximum
3. minimum
4. divided
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. discriminate
4. divide
If an activity cannot be delayed without affecting the entire project, it is a ________ activity
1. completed
2. critical
3. conjugated
4. none of the above
A ________ represents the beginning and end of activities, referred to as events.
1. path
2. arc
3. branch
4. node
When an activity is completed at a node, it has been
1. finished
2. ended
3. realized
4. completed
Project management differs from management for more traditional activities mainly because of
1. its limited time frame
2. its unique set of activities
3. a and b
4. none of the above
The critical path is the ________ time the network can be completed.
1. maximum
2. minimum
3. longest
4. shortest
Attributes of decision-making techniques include all of the following except:
1. payoffs
2. constraints
3. alternatives
4. states of nature
With the criterion ________, the decision maker attempts to avoid regret.
1. minimax regret
2. equal likelihood
3. Hurwicz
4. maximin
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. payoff
4. regret
The length of a queue
1. could be finite
2. could be infinite
3. can constantly change
4. all of the above
Items may be taken from a queue
1. on a first-come-first-serve basis
2. on a last-come-first-serve basis
3. according to the due date of the item
4. all of the above
Which of the following items is not a part of the queuing system?
1. arrival rate
2. service facility
3. waiting line
4. activity flow
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. service rate minus arrival rate
4. service rate plus arrival rate
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. the queue discipline
4. all of the above
Queuing analysis is a deterministic technique.
1. True
2. False
The operating characteristics of a queuing system provide information rather than an optimization of a queuing system.
1. True
2. False
The applicability of forecasting methods depends on
1. the time frame of the forecast
2. the existence of patterns in the forecast
3. the number of variables to which the forecast is related
4. all of the above
Management Science process includes
1. defining problem
2. developing model
3. both a and b
4. a only
________ is an idealised representation of real life
1. model
2. module
3. analogue
4. iconic model
If the value of the game is zero it is called
1. zero sum game
2. two person zero game
3. fair game
4. none
Principles of modelling ?
1. simplicity
2. validity
3. clarity
4. all of the above
The outcome of a game in the form of gain or losses is called.......
1. pay off
2. saddle point
3. pay off matrix
4. none
The loss incurred because of failure to take the best possible decision
1. opportunity loss
2. contemporary loss
3. opportunity cost
4. expected loss
For a linear programming equations, convex set of equations is included in region of
1. feasible solutions
2. disposed solutions
3. profit solutions
4. loss solutions
In graphical solutions of linear inequalities, solution can be divided into
1. one subset
2. two subsets
3. three subsets
4. four subsets
Linear programming used to optimize mathematical procedure and is
1. subset of mathematical programming
2. dimension of mathematical programming
3. linear mathematical programming
4. all of above
In linear programming, objective function and objective constraints are
1. solved
2. linear
3. quadratic
4. adjacent
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. Stochastic Programming
3. Both A and B
4. Linear Programming
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. Review Technique(PERT)
3. Both A and B
4. Deployment of resources
________ models involves the allocation of resources to activities in such a manner that some measure of effectiveness is optimized.
1. Sequencing
2. Allocation Models
3. Queuing Theory
4. Decision Theory
Allocation problems can be solved by
1. Linear Programming Technique
2. Non – Linear Programming Technique
3. Both A and B
4. None of the above
Allocation Models are ________
1. Iconic models
2. Analogue Models
3. Symbolic Models
4. None of the above
Every LPP is associated with another LPP is called ________
1. Primal
2. Dual
3. Non - linear programming
4. None of the above
As for maximization in assignment problem, the objective is to maximize the ________
1. Profit
2. optimization
3. cost
4. None of the above
________ is one of the fundamental combinatorial optimization problems.
1. Assignment problem
2. Transportation problem
3. Optimization Problem
4. None of the above
PERT and CPM
1. are most valuable when a small number of activities must be scheduled.
2. have different features and are not applied to the same situation.
3. do not require a chronological relationship among activities.
4. have been combined to develop a procedure that uses the best of each
Arcs in a project network indicate
1. completion times.
2. precedence relationships.
3. activities.
4. the critical path.
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. is 12.
3. is 15.
4. cannot be determined.
The critical path
1. is any path that goes from the starting node to the completion node.
2. is a combination of all paths.
3. is the shortest path.
4. is the longest path
Times between two successive requests arriving, called the
1. Interarrival time
2. Arrival time
3. Poisson distribution
4. Average residual service time
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. the solution is not degenerate.
3. one must use the northwest-corner method.
4. the edge constraints for supply and demand are satisfied.
Transportation models can be used for which of the following decisions?
1. facility location
2. production mix
3. media selection
4. portfolio selection
5. employee shift scheduling

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

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
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. none of the above
The decisions which are affect the business in the short run ?
1. tactical solutions
2. strategic decisions
3. management decisions
4. none
Which of the following methods is used only with the assignment problem?
1. the Hungarian method
2. stepping-stone method
3. MODI method
4. Vogel's approximation method
5. the simplex method
Monte Carlo simulation gets its name from which of the following?
1. Model formulation
2. Analysis
3. Data collection
4. Random-number assignment
Which of the following statistical methods are commonly used to analyze simulation results?
1. t-tests
2. Regression analysis
3. Analysis of variance
4. All of the above
VAM stands for ________
1. Vogeal's Approximation Method
2. Vogel's Approximate Method
3. Vangel's Approximation Method
4. 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)

This post was last modified on 26 December 2019

Get the MBBS Question Bank Android App

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

Share This Post:

Share This Post: