Download Calicut University M.Com Latest 2020 Management Science

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

This post was last modified on 26 December 2019

Download Document

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

MULTIPLE CHOICE QUESTIONS ON MANAGEMENT SCIENCE

The term “Operation Research” was coined by :
1. Mc Closky and Trefthen
2. Arthur Clark
3. Churchman, Ackoff and Arnoff
4. George B Dantzig
Management Science came into existence in a ................. context.
1. Business
2. Academic
3. Military
4. Religious
By the beginning of ................., the industries in USA realised the importance of Management Science in solving business and management problems.
1. 1930s
2. 1940s
3. 1950s
4. 1960s
In India, Operations Research came into existence in the year ............
1. 1940
2. 1947
3. 1949
4. 1950
In India, first Operations Research unit was set up at .................
1. Regional Research Laboratory, Hyderabad
2. Indian Statistical Institute, Kolkotha
3. Indian Institute of Science and Technology, Bengaluru
4. Indian Institute of Science and Technology, Mohali
In India, first Operations Research application was made by .................
1. Pranab K Sen
2. Prof. Mahalonobis
3. Samarendra Nath Roy
4. Raghu Raj Bahadur
Operations Research Society of India was formed in the year ............
1. 1950
2. 1955
3. 1957
4. 1960
Who defined Operations Research as "the art of giving bad answers to problems which otherwise have worse answers"?
1. H M Wagner
2. H A Taha
3. T L Saaty
................. defined Operations Research as "the art of winning wars without actually fighting."
1. H M Wagner
2. H A Taha
3. T L Saaty
4. Arthur Clark
Operations Research is a very powerful tool for .................
1. Operations
2. Research
3. Decision making
4. None of these
Who defined Operations Research as scientific approach to problem solving for executive management.
1. E L Arnoff
2. H M Wagner
3. Churchman
4. None of these
The term "Operations Research” was coined in the year .................
1. 1930
2. 1940
3. 1950
4. 1960
The innovative science of Operations Research was discovered during .................
1. Civil war
2. World war I
3. World war II
4. Industrial Revolution
Operations Research has the characteristic that it is done by a team of .................
1. Scientists
2. Mathematicians
3. Academicians
4. Politicians
Operations Research emphasises on the overall approach to the system. This characteristic of Operations Research is often referred to as .................
1. System orientation
2. System approach
3. Inter-disciplinary
4. Team approach
Operations Research cannot give perfect ................. to the problem.
1. Answers
2. Solutions
3. Both a and b
4. Decisions
................ models involve the allocation of resources to activities in such a way that some measure of effectiveness is optimised.
1. Sequencing
2. Allocation
3. Queuing theory
4. Decision theory
In ................. models, everything is defined and the results are certain.
1. Probabilistic
2. Deterministic
3. Both a and b
4. None of these
................ models involve more risks and uncertainties.
1. Probabilistic
2. Deterministic
3. Both a and b
4. None of these
................ models are obtained by enlarging or reducing the size of the items.
1. Iconic models
2. Analogue models
3. Symbolic models
4. None of these
The word ................. may be defined as some actions that we apply to some problems or hypothesis.
1. Research
2. Operations
3. Both a and b
4. None of these
................ are representations of reality.
1. Phases
2. Models
3. Both a and b
4. None of these
................ are called mathematical models.
1. Iconic models
2. Symbolic models
3. Analogue models
4. None of these
Probabilistic models are also called .................
1. Deterministic models
2. Dynamic models
3. Stochastic models
4. None of these
................ models assume that the values of the variables do not change with time during a particular period.
1. Dynamic
2. Static
3. Both a and b
4. None of these
................ models consider time as one of the important variable.
1. Dynamic
2. Static
3. Both a and b
4. None of these
................ may be defined as a method of determining an optimal program of interdependent activities in view of available resources.
1. Goal programming
2. Linear programming
3. Decision making
4. None of these
................ are expressed in the form of equations
1. Objectives
2. Constraints
3. Both a and b
4. None of these
If there are more than one optimal solutions for the decision variables, the solution is .................
1. Infeasible
2. Unbounded
3. Alternative
4. None of these
Dual of the dual is a .................
1. Dual
2. Primal
3. Alternative
4. None of these
The quantitative approach to decision analysis is a .................
1. Logical approach
2. Rational approach
3. Scientific approach
4. All of the above
A model is a .................
1. An essence of reality
2. An approximation
3. An idealisation
4. All of the above
The dummy source/destination in a transportation problem is added to .................
1. Satisfy rim constraints
2. Prevent solution from becoming degenerate
3. Ensure total cost does not exceed a limit
4. None of the above
The solution to a transportation problem with 'm' rows and 'n' columns is feasible if the number of positive allocations are:
1. m + n
2. m x n
3. m + n - 1
4. m + n + 1
The method used for solving an assignment problem is:
1. Reduced matrix method
2. MODI method
3. Hungarian method
4. None of these
An assignment problem can be solved by .................
1. Simplex method
2. Transportation method
3. Both a and b
4. None of these
For salesman who has to visit 'n' cities, which of the following are the ways of his tour plans:
1. n!
2. (n+1)!
3. (n-1)!
4. n
The assignment problem is:
1. Requires that only one activity be assigned to each resource
2. Is a special case of transportation problem
3. Can be used to maximise resource
4. All the above
The Hungarian method for solving an assignment problem can also be used to solve:
1. A transportation problem
2. A travelling salesman problem
3. A linear programming problem
4. Both a and b
All the parameters in the linear programming model are assumed to be .................
1. Variables
2. Constraints
3. Functions
4. None of these
Graphic method can be applied to solve a liner programming problem when there are only ................. variables
1. A one
2. Two
3. Three
4. More than three
If the feasible region of a linear programming problem is empty, the solution is .................
1. Unbounded
2. Infeasible
3. Infeasible
4. Alternative
The variables whose coefficient vectors are unit vectors, are called .................
1. Unit variables
2. Basic variables
3. Non-basic variables
4. None of these
Any column or row of a simplex table is known as .................
1. Key column
2. Key row
3. Vector
4. None of these
................ is considered as the pioneer of Linear Programming Technique.
1. churchman
2. D W Miller
3. James Lundy
4. George B Dantzig
A minimisation problem can be connected into maximisation problem by changing the signs of coefficients in the .................
1. Constraints
2. Objectives
3. Both a and b
4. None of these
In an LPP, if the solution of a variable can be made infinitely large without violating the constraints, then the solution is .................
1. Infeasible
2. Alternative
3. Unbounded
4. Unique
In maximisation cases, ................. are assigned to the artificial variables as their coefficients in the ................. function.
1. + m
2. - m
3. 0
4. None of these
In simplex method, we add ................. in the case of constraints with sign "="
1. Surplus variable
2. Artificial variable
3. Slack variable
4. None of these
In simplex method, ................. should be selected when there is tie between slack/surplus variable and decision variable.
1. Slack variable
2. Decision variable
3. Surplus variable
4. None of these
When at least one of the basic variables is zero, then the basic feasible solution to a Linear Programming Problem is said to be .................
1. Infeasible
2. Unbounded
3. Degenerate
4. Non-degenerate
In Linear Programming Problem, degeneracy occurs in ................. stages.
1. One
2. Two
3. Three
4. Four
Every Linear Programming Problem is related to another Linear Programming Problem, called .................
1. Primal
2. Dual
3. Non-linear Programming
4. None of these
In a maximisation assignment problem, the objective is to maximise .................
1. Profit
2. Cost
3. Optimisation
4. None of these
Operations Research does not give perfect solution to a problem, but it helps to improve the ................. of the solution.
1. Quality
2. Clarity
3. Look
4. None of these
Operations Research makes a ................. attack on complex problems to arrive at optimal solution.
1. Scientific
2. Systematic
3. Both a and b
4. None of these
Operations Research uses models to help the management in determining its ................. scientifically.
1. Policies
2. Actions
3. Both a and b
4. None of these
Operations Research is a .................
1. Science
2. Art
3. Both a and b
4. None of these
................ deals with making sound decisions under conditions of certainty, risk and uncertainty.
1. Game theory
2. Network analysis
3. Decision theory
4. None of these
................ deals with the concepts such as critical path, float, events, etc.
1. Game theory
2. Decision theory
3. Queuing theory
4. Network analysis
................ is used to imitate an operation prior to actual performance.
1. Inventory control
2. Simulation
3. Game theory
4. Integrated Production Model
................ is concerned with determination of the most economic replacement policy.
1. Probabilistic programming
2. Linear programming
3. Search theory
4. Replacement theory
The O R technique which helps in minimising total waiting and service cost is:
1. Game theory
2. Queuing theory
3. Both a and b
4. Decision theory
Linear Programming technique is a:
1. Constrained optimisation technique
2. Technique for economic allocation of resources
3. Mathematical technique
4. All of the above
A constraint in a Linear Programming Model restricts:
1. Value of objective function
2. Value of decision variable
3. Use of available resources
4. All of the above
Before formulating a formal LP model, it is better to:
1. Verbally identify decision variables
2. Express the objective function in words
3. Express each constraint in words
4. All of the above
Linear Programming Technique helps to find an optimal use of:
1. Machine
2. Money
3. Manpower
4. All of the above
Which of the followings is an assumption of Linear Programming Technique?
1. Divisibility
2. Additivity
3. Proportionality
4. All of the above
Which of the following is true with regard to a Linear Programming Model?
1. No guarantee to get integer valued solution
2. The relationship among decision variables is liner
3. Both a and b
4. None of the these
The graphical method if LPP uses:
1. Linear equations
2. Constraint equations
3. Objective function
4. All of the above
Constraints in an LPP are treated as active, if they:
1. Do not consume all the available resources at optimality
2. Represent optimal solution
3. Both a and b
4. None of these
While solving a LPP graphically, the area bounded by constraints is called .................
1. Feasible region
2. Infeasible region
3. Unbounded region
4. None of these
While solving an LPP, infeasibility may be removed by:
1. Removing a variable
2. Removing a constraint
3. Adding a variable
4. Adding a constraint
................ variables are fictitious and cannot have any physical meaning.
1. Slack variables
2. Surplus variables
3. Artificial variables
4. Decision variables
An optimal solution is considered as the ................. among the feasible solutions.
1. Worst
2. Best
3. Ineffective
4. None of these
................ method is used to solve an assignment problem.
1. American method
2. Hungarian method
3. German method
4. British method
The allocated cells in the transportation table are called .................
1. Occupied cells
2. Empty cells
3. Unoccupied cells
4. None of these
In transportation Problems, VAM stands for .................
1. Value Addition Method
2. Vogel's Approximation Method
3. Virgenean Approximation Method
4. None of these
Initial feasible solution to a transportation Problem can be found out by .................
1. VAM
2. MODI Method
3. Both a and b
4. None of these
................ is applied to determine optimal solution.
1. NWCR
2. VAM
3. MODI Method
4. None of these
A Transportation Problem is said to be unbalanced when total supply is not equal to .................
1. Total cost
2. Total demand
3. Both a and b
4. None of these
For a minimisation Transportation Problem, the objective is to minimise:
1. Profit
2. Cost
3. Solution
4. None of these
................ is an important Operations Research Technique to analyse the queuing behaviour.
1. Game theory
2. Waiting line theory
3. Decision theory
4. Simulation
An organisation chart is an example of .................
1. Iconic model
2. Mathematical model
3. Analogue model
4. None of these
................ model is a map which indicates roads, highways, towns and inter-relationships
1. Iconic model
2. Analogue model
3. Mathematical model
4. None of these
Operations Research techniques help to find ................. solution.
1. Feasible solution
2. Infeasible solution
3. Optimal solution
4. None of these
Operations Research Techniques involves ................. approach.
1. Team approach
2. Critical approach
3. Individual approach
4. None of these
A LPP model doesnot contain:
1. Decision
2. Constraints
3. Feasible solution
4. Spread Sheet
Straight lines shown in a linear programming graph indicates .................
1. Objective function
2. Constraints
3. Points
4. All of the above
Non-negativity constraints are written as .................
1. Equality
2. Non-equality
3. Greater than or equal to
4. Less than or equal to
PERT stand for:
1. Performance Evaluation Review Technique
2. Programme Evaluation Review Technique
3. Programme Evaluation Research Technique
4. None of these
An activity which must be completed before commencement of one or more other activities is called .................
1. Successor activity
2. Predecessor activity
3. Dummy activity
4. None of these
In network diagram, events are commonly represented by .................
1. Arrows
2. Nodes
3. Triangles
4. None of these
................ is activity oriented network diagram.
1. CPM
2. PERT
3. Histogram
4. Ogive
................ is an event oriented network diagram.
1. CPM
2. PERT
3. Histogram
4. Ogive
An activity which does not consume either resource or time is called .................
1. Predecessor activity
2. Successor activity
3. Dummy activity
4. Terminal activity
................ is a series of activities related to a project.
1. Network
2. Transportation Model
3. Assignment model
4. None of these
An event which represents the beginning of more than one activity is a :
1. Merge event
2. Net event
3. Burst event
4. None of these
Activities lying on critical path are called .................
1. Critical activities
2. Non-critical activities
3. Dummy activities
4. None of these
Activities that cannot be started until one or more of the other activities are completed, are called .................
1. Dummy activities
2. Initial activities
3. Successor activities
4. Predecessor activities
................ is the sequence of activities which determines the total project duration.
1. Critical path
2. Network
3. Non-critical activities
4. None of these
PERT emphasises on .................
1. Activity
2. Time
3. Cost
4. None of these
................ is the duration by which an activity can be delayed without delaying the completion of the project.
1. Earliest Start Time
2. Earliest Finish Time
3. Latest Start Time
4. Latest Finish Time
The EST + activity duration = .................
1. Earliest Finish Time
2. Latest Start Time
3. Latest Finish Time
4. None of these
................ is the latest time by which an activity can be finished without delaying the completion of the project.
1. LST
2. LFT
3. EFT
4. EST
................ is a scheme or design of something intended to do.
1. Network
2. Float
3. Project
4. Program
In a network diagram, activity is denoted by .................
1. Node
2. Arrow
3. Triangle
4. None of these
................ is the duration by which an activity can be delayed without delaying the project.
1. Slack
2. Total float
3. Both a and b
4. None of these
The maximise criteria is .................
1. Optimistic
2. Pessimistic
3. Neutral
4. None of these
Decision making under certainty refers to ................. situation.
1. Deterministic
2. Probabilistic
3. Competitive
................ is known as father of game theory.
1. Von Neumann
2. A K Erlang
3. George b Dantzig
4. Arnoff
Which of the following is an assumption of game theory?
1. The players act rationally and intelligently
2. Each payer has a finite set of possible courses of action
3. The players attempt to maximise gains or minimises losses
4. All of the above
Each participant of the game is called .................
1. Strategist
2. Winner
3. Player
4. Loser
The outcome of a game is known as .................
1. Profit
2. Loss
3. Pay off
4. None of these
A matrix which shows the gains and losses resulting from moves and counter moves is called .................
1. Cost matrix
2. Pay off matrix
3. Both a and b
4. None of these
When all the players of the game follow their optimal strategies, then the expected pay off of the game is called .................
1. Gain of the game
2. Loss of the game
3. Value of the game
4. None of these
The position in the pay off matrix where the maximin coincides with the minimax.
1. Saddle point
2. Break even point
3. Pivot point
4. None of the above
A game is said to be fair if the value of the game is .................
1. One
2. Two
3. Three
4. Zero
In a ................. game the amounts won by all winners together is equal to the sum of the amounts lost by all losers together.
1. Non-zero sum game
2. Zero sum game
3. Rectangular game
4. None of these
Which of the following method is used to solve mixed strategy problems:
1. Probability method
2. Graphic method
3. Linear Programming method
4. All of the above
A queue is formed when the demand for a service:
1. Exceeds the capacity to provide that service
2. Is less than the capacity to provide that service
3. a or b
4. None of these
Queuing theory is also termed as .................
1. Game theory
2. Replacement theory
3. Waiting line theory
4. None of these
In queuing theory, ................. refers to those waiting in a queue or receiving service.
1. Service provider
2. Customer
3. Both a and b
4. None of these
In queuing theory, ................. is a person by whom service is rendered.
1. Customer
2. Server
3. a or b
4. none of these
In waiting line theory, number of customers waiting in the queue is referred to as .................
1. Traffic intensity
2. Queuing system
3. Service pattern
4. Queue length
Number of customers in the queue per unit of time is called .................
1. Queuing system
2. Length of queue
3. Average length of queue
4. None of these
The ration between mean arrival rate and mean service rate is called .................
1. Idle period
2. Average length of queue
3. Traffic intensity
4. None of these
Commonly assumed probability distribution of arrival pattern is .................
1. Poisson distribution
2. Binomial distribution
3. Normal distribution
4. None of these
Commonly assumed probability distribution of service pattern are .................
1. Poisson distribution
2. Exponential distribution
3. Erlang distribution
4. b and c
a customer's behaviour of leaving the queue when he does not like to wait in the queue due to lack of time or space is called .................
1. Jockying
2. Reneging
3. Collusion
4. Balking
A customer's behaviour of leaving the queue due to impatience is called .................
1. Jockying
2. Reneging
3. Collusion
4. Balking
A customer's behaviour of jumping from one queue to another is called .................
1. Jockying
2. Reneging
3. Collusion
4. Balking
In queuing theory, ................. stands for mean arrival rate of customers.
1. μ
2. λ
3. t
4. none of these
In queuing theory, ................. stands for mean service rate.
1. μ
2. λ
3. t
4. none of these
................ is a method of analysing the current movement of the some variable in an effort to predict the future movement of the same variable.
1. Goal programming
2. Queuing theory
3. Markov Analysis
4. Replacement theory
In queuing theory, FCFS stand for .................
1. First Cum First Served
2. First Customer Fist Served
3. Fast Channel First Served

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

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

Share This Post:

MULTIPLE CHOICE QUESTIONS ON MANAGEMENT SCIENCE

Share This Post: