0% found this document useful (0 votes)
588 views

Em-I (MCQ) PDF

1) The document presents a past examination paper for the subject of Engineering Management - I. 2) The paper contains multiple choice/objective type questions to be answered in the first 30 minutes. 3) There are 14 total multiple choice questions covering topics in engineering management such as transportation problems, queuing systems, linear programming, and project management techniques.

Uploaded by

Mangesh kevadkar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
588 views

Em-I (MCQ) PDF

1) The document presents a past examination paper for the subject of Engineering Management - I. 2) The paper contains multiple choice/objective type questions to be answered in the first 30 minutes. 3) There are 14 total multiple choice questions covering topics in engineering management such as transportation problems, queuing systems, linear programming, and project management techniques.

Uploaded by

Mangesh kevadkar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

SLR-FM-36

Seat
No.
Set P
T.E. (Part - II) (New) (CBCS) Examination Nov/Dec-2019
Civil Engineering
ENGINEERING MANAGEMENT – I
Day & Date: Tuesday, 26-11-2019 Max. Marks: 70
Time: 10:00 AM To 01:00 PM
Instructions: 1) Q. No. 1 is compulsory and should be solved in first 30 minutes in answer
book.
2) Assume suitable data whenever required.
3) Figure to the right indicates full marks.
4) Use of non-programmable calculator is allowed.
MCQ/Objective Type Questions
Duration: 30 Minutes Marks: 14
Q.1 Choose the correct alternatives from the options and rewrite the sentence. 14
1) Row wise and column wise difference between two minimum cost in VAM
method is _____.
a) Capital cost
b) Fixed cost
c) Variable cost
d) None
2) Major elements of queuing system are _____.
a) Customer b) Queue
c) Service Channel d) All the above
3) MBO is developed by _____.
a) Gilberth b) Peter Drucker
c) Fayol d) Taylor
4) ABC analysis considers _____.
a) Total consumption of items
b) Total amount of items
c) Both a) and b)
d) None of these
5) Pure strategy games are those in which both players _____.
a) Play more than one strategy
b) Stay with one strategy throughout
c) Employ fresh strategies every time the act is played
d) Play 3 strategies
6) Saddle point is the point of intersection of two _____.
a) Mixed strategies b) Pure strategies
c) Both a) and b) d) None of these
7) Dual is obtained for _____.
a) Simplex problem
b) Transportation problem
c) Both a) and b)
d) None of these

Page 1 of 16
SLR-FM-36
Set P
8) Military organization is: _____.
a) Fine and staff b) Matrix
c) Line d) Functional
9) EOQ means _____.
a) Economic Offering Quantity b) Empty Order Quantity
c) Economic Order Quantity d) Economic Order Quality
10) Lead time involves: _____.
a) Raising of purchase requisition b) Transportation
c) Placement of an order d) All of the above
11) In decision tree problem, the node mode is shown by _____.
a) Square b) Circle
c) Triangle d) Rectangle
12) Dynamic programming is discovered by _____.
a) Taylor b) Henny Fayol
c) Richard Bellmen d) Monte - Carlo
13) Graphical method to solve linear programming problem is commonly used
if _____.
a) No. of decision variable is two b) No.of decision variable is three
c) No. of decision variable is four d) No. of decision variable is one
14) When total supply total demand, the transportation problem is called?
a) Simple b) Balanced
c) Equated d) Zero

Page 2 of 16
*SLRTX59* SLR-TX – 59

Seat
No.
Set P
T.E. (Civil) (Part – I) (Old-CGPA) Examination, 2018
Engineering management – I
Day and Date : Friday, 7-12-2018 Max. Marks : 70
Time : 2.30 p.m. to 5.30 p.m.

Instructions : 1) Q. No. 1 is compulsory. It should be solved in first


30 minutes in Answer Book Page No. 3. Each question
carries one mark.
2) Answer MCQ/Objective type questions on Page No. 3
only. Don’t forget to mention, Q.P. Set (P/Q/R/S) on Top
of Page.
3) Assume suitable data wherever required.
4) Figures to the right indicate full marks.
5) Use of non programmable calculator is allowed.

MCQ/Objective Type Questions


Duration : 30 Minutes Marks : 14

1. Choose the correct answer : (14×1=14)


1) Row wise and column wise difference between two minimum cost in VAM
method is called
a) Capital cost b) Fixed cost
c) Variable cost d) None
2) Major elements of queuing system are
a) Customer b) Queue
c) Service Channel d) All the above
3) MBO is developed by
a) Gilberth b) Peter Drucker
c) Fayol d) Taylor
4) ABC analysis considers
a) Total consumption of items b) Total amount of items
c) Both a) and b) d) None

P.T.O.
SLR-TX – 59 -2- *SLRTX59*

5) Pure strategy games are those in which both players


a) Play more than one strategy
b) Stay with one strategy throughout
c) Employ fresh strategies every time the act is played
d) Play 3 strategies
6) Saddle point is the point of intersection of two
a) Mixed strategies b) Pure strategies
c) Both a) and b) d) None
7) Dual is obtained for
a) Simplex problem b) Transportation problem
c) Both a) and b) d) None
8) Military organization is
a) Fine and staff b) Matrix c) Line d) Functional
9) EOQ means
a) Economic Offering Quantity b) Empty Order Quantity
c) Economic Oder Quantity d) Economic Order Quality
10) Lead time involves
a) Raising of purchase requisition b) Transportation
c) Placement of an order d) All of the above
11) In decision tree problem, the node mode is shown by
a) Square b) Circle c) Triangle d) Rectangle
12) Dynamic programming is discovered by
a) Taylor b) Henny Fayol
c) Richard Bellmen d) Monte-Carlo
13) Graphical method to solve linear programming problem is commonly used if
a) No. of decision variable is two b) No. of decision variable is three
c) No. of decision variable is four d) No. of decision variable is one
14) When total supply equals total demand, the transportation problem is called
a) Simple b) Balanced c) Equated d) Zero

_____________________

Set P
*SLRTC39* SLR-TC – 39

Set P
T.E. (Civil) (Part – I) (CGPA) Examination, 2018
ENGINEERING MANAGEMENT – I
Day and Date : Tuesday, 8-5-2018 Max. Marks : 70
Time : 10.00 a.m. to 1.00 p.m.

Instructions : 1) Q. No. 1 is compulsory. It should be solved in first


30 minutes in Answer Book Page No. 3. Each question
carries one mark.
2) Answer MCQ/Objective type questions on Page No. 3
only. Don’t forget to mention, Q.P. Set (P/Q/R/S) on
Top of Page.
3) Solve any three questions from Section I and any three
questions from Section – II.
4) Assume suitable data whenever required.
5) Figure to the right indicates full marks.
6) Use of non-programmable calculator is allowed.

MCQ/Objective Type Questions


Duration : 30 Minutes Marks : 14

1. Choose the correct answer : 14


1) Advantage of VAM of transportation is
a) Least cost b) Near to optimal solution
c) Faster solution d) Slower solution
2) Assignment problem is due to resources
a) Having same efficiency for different jobs
b) Having varying efficiency for different jobs
c) Having same efficiency for same jobs
d) Having varying efficiency for same jobs
3) Dual of the Duel is
a) Primal b) Duel
c) Zero d) Infinity
4) Decision making under risk is
a) Deterministic b) Probabilistic
c) Uncertain d) None of these

P.T.O.
SLR-TC – 39 -2- *SLRTC39*
5) Inventory resource may consist of
a) Physical resource b) Human resource
c) Financial resource d) All
6) Queuing theory is used to balance
a) Cost of offering service
b) Cost due to delay in offering service
c) Both a) and b)
d) None of these
7) Solution of Dynamic Programming is based on
a) Bellman’s principle of optimality b) Hurwicz criteria
c) Savage criteria d) Laplace criteria
8) Biological process of mutation has inspired
a) ANN b) Fuzzy logic
c) Genetic algorithm d) None of these
9) Planning is
a) Setting goal b) SWOT analysis
c) Selection of best alternative d) All of these
10) Functional organization is invented by
a) Taylor b) Gilbreth c) Mayo d) Feyol
11) In ABC analysis least monitoring and control is required for
a) A class items b) B class items
c) C class items d) All of these
12) In dynamic programming state is defined as
a) Point where decision is made
b) Information describing problem at each stage
c) Decision making rule
d) Optimal policy
13) Transportation problem can be solved if
a) No. of rows = no. of columns
b) No. of rows – no. of columns
c) No. of row < no. of columns
d) All of these
14) In decision tree problem the event node is shown by
a) Square b) Circle c) Triangle d) Rectangle
______________

Set P
*SLRTJ39* SLR-TJ – 39
S e a t

5 A J

N o .

T.E. Civil (Part – I) (CGPA Pattern) Examination, 2017


ENGINEERING MANAGEMENT – I
Day and Date : Saturday, 9-12-2017 Total Marks : 70
Time : 10.00 a.m. to 1.00 p.m.
Instructions : 1) All questions are compulsory.
2) Assume suitable data wherever necessary.
3) Use graph paper if needed.
4) Use of nonprogrammable computers is permitted.
5) Q. No. 1 is compulsory. It should be solved in first 30
minutes in Answer book Page No. 3. Each question
carries one mark.
6) Answer MCQ/Objective type questions on Page No. 3
only. Don’t forget to mention, Q.P. Set (P/Q/R/S) on
Top of Page.

MCQ/Objective Type Questions


Duration : 30 Minutes Marks : 14

1. Choose the correct answer : 14


1) The cost of keeping items in inventory is called ________
a) Setup cost b) Holding cost
c) Finished goods d) None of these
2) If primal is maximize 35X1 + 40X 2, subjected to 2X1 + 3 and :  $ 

4 X


 3 X
the dual will have objective function as ______
 9 6 , X


, X  0

a) 3y1 + 3y2 (minimize) b) 60y1 + 96y2 (minimize)


c) 3y1 – 3y2 (maximize) d) 60y1 + 96y2 (minimize)
3) Hungerian Trial and error method is suitable for solving
a) Transportation problem b) Games theory
c) Assignment problem d) Simplex method
4) EOQ decreases when the cost of item
a) Increases b) Zero c) Decreases d) None of these

P.T.O.
SLR-TJ – 39 -2- *SLRTJ39*
5) If primal is minimize 30x1 + 40x2 subjected to 6x1 + 12×2 120 and


8x1 + 5x2 60, x1, x2 0 the dual will have objective function as
 

a) 6y1 + 8y2 (minimize) b) 6y1 – 8y2 (Maximize)


c) 120y1 + 60y2 (Maximize) d) 120y1 – 60y2 (Maximize)
6) Transportation problem can be solved if
a) no. of rows = no. of columns b) no. of rows no. of column


c) no. of rows no. of column



d) All of these
7) In decision tree problem the event mode is shown by
a) Square b) Circle c) Triangle d) Rectangle
8) Queuing theory is used to balance
a) Cost of offering service
b) Cost due to delay in offering service
c) Both a) and b)
d) None of these
9) Management by objectives includes
a) Line managers b) Line and staff managers
c) Line, staff and labour d) None
10) The Monte-Carlo simulation used
a) Sampling technique b) Decision technique
c) Mathematical technique d) Both a) and b)
11) The Vogel’s approximation method is also caled as
a) Row minima method b) Penalty method
c) Least cost method d) None
12) The biological process, of mutation has inspired
a) Artificial Neural Network b) Genetic Algorithm
c) Fuzzy logic d) Dynamics programming
13) The solution of decision tree is obtained by
a) Folding back method b) Games theory
c) Laplace criteria d) Dynamic programming
14) If possible outcomes of alternate course of action and probability of possible
outcome is not known, then the problem is of decision under
a) Certainty b) Risk c) Uncertainty d) None

______________

Set P
*SLRVB37* SLR-VB – 37
Seat
No. Set P
T.E. (Civil) (Part – I) (CGPA Pattern) Examination, 2017
ENGINEERING MANAGEMENT – I

Day and Date : Tuesday, 9-5-2017 Max. Marks : 70


Time : 10.00 a.m. to 1.00 p.m.

Instructions : 1) All questions are compulsory.


2) Assume suitable data wherever necessary.
3) Use graph paper if needed.
4) Use of nonprogrammable calculator is permitted.
5) Q. No. 1 is compulsory. It should be solved in first 30 minutes
in Answer Book Page No. 3. Each question carries one mark.
6) Answer MCQ/Objective type questions on Page No. 3 only.
Don’t forget to mention, Q.P. Set (P/Q/R/S) on Top of Page.

MCQ/Objective Type Questions


Duration : 30 Minutes Marks : 14

1. Choose the correct alternative : (1 mark each)


1) In decision tree problems the event mode is shown by
a) Circle b) Triangle c) Rectangle d) Square
2) Queuing theory is
a) Maximization process b) Minimization process
c) Optimization process d) Descriptive process
3) Acceptance quality level for inspection is stored normally range between
a) 0.5 – 3% b) 50 – 100% c) 0 – 0.5% d) 20 – 50%
4) The biological process of mutation has inspired
a) Artificial neural network b) Fuzzy number
c) Genetic algorithm d) Dynamic programming
5) Maximization problem is LPP will involve
a) Slack variable b) Surplus variable
c) Both a) and b) d) None of these
6) The most popular type of organization used for Civil Engineering
a) Line b) Line and staff c) Functional d) Effective
P.T.O.
SLR-VB – 37 -2- *SLRVB37*
7) Time and motion study are elements of __________ management.
a) Classical b) Scientific c) System d) General
8) Work study as natural as play of rest is assumption of
a) Theory W b) Theory Y c) Theory X d) Theory Z
9) In ABC analysis least monitoring and control is required for
a) A class items b) B class items c) C class items d) All of these
10) In dynamic programming state is defined as
a) Point where decision is made
b) Information describing problem at each stage
c) Decision making rule
d) Optimal policy
11) Transportation problem can be solved if
a) No. of rows = no. of columns b) No. of rows 
no. of columns
c) No. of rows no. of columns

d) All of these
12) Folding back method is used for problems of
a) Transportation b) Games c) Assignment d) Decision tree
13) Functioning of human brain has inspired
a) Artificial neural network b) Fuzzy logic
c) Genetic algorithm d) Dynamic programming
14) Linear programming deals with the optimization of a function of variable is
known as
a) Subjective function b) Objective function
c) Constraints d) All of these

______________

Set P
*SLR-EP-32* SLR-EP – 32
Seat
No.
Set P
T.E. (Civil) (Part – I) (CGPA Pattern) (New) Examination, 2016
ENGINEERING MANAGEMENT – I
Day and Date : Wednesday, 7-12-2016 Max. Marks : 70
Time :10.00 a.m. to 1.00 p.m.
Instructions : 1) All questions are compulsory.
2) Assume suitable data wherever necessary.
3) Use graph paper if needed.
4) Use of nonprogrammable computers is permitted.
5) Q. No. 1 is compulsory. It should be solved in first 30 minutes
in Answer Book Page No. 3. Each question carries one mark.
6) Answer MCQ/Objective type questions on Page No. 3 only.
Don’t forget to mention, Q.P. Set (P/Q/R/S) on Top of Page.

MCQ/Objective Type Questions


Duration : 30 Minutes Marks : 14

1. Choose the correct answer (1 mark each) :


1) An LPP is said to be _____________ if has no solution that satisfies all the
constraints.
a) Feasible b) Infeasible c) Bounded d) None of these
2) Transportation problem can be solved if ___________
a) No. of rows = no. of columns b) No. of rows ≤ no. of columns
c) No. of rows ≥ no. of columns d) All of these
3) EOQ model helps to find
a) Optimum size of order b) Time interval between order
c) Both a) and b) d) None of these
4) Moderate inventory control is sufficient for ___________
a) A class items b) B class items c) C class items d) All of these
5) Motile Carlo simulation method is suitable for
a) Transportation problem b) Queuing problem
c) Assignment problem d) None of these
6) Biological process of mutation has inspired
a) ANN b) Fuzzy Logic
c) Genetic Algorithm d) None of these

P.T.O.
SLR-EP – 32 -2- *SLR-EP-32*
7) Planning is ___________
a) Setting goal b) SWOT Analysis
c) Selection of best alternative d) All of these
8) If ‘ λ ’ is arrival rate, ω is waiting time then expected no. of customer ‘L’ will
be
a) L = λω b) L = λ / ω c) L = ω / λ d) L = ω + λ
9) Allocation of units is not dependent on transport cost in
a) VAM method b) NW Corner method
c) Both of these d) None of these
10) In dynamic programming state is defined as
a) Point where decision is made
b) Information describing problem at each stage
c) Decision making rule
d) Optimal policy
11) Linear programming deals with the optimization of a function of variable is
known as
a) Subjective function b) Objective function
c) Constraints d) All of these
12) Queuing theory means
a) Optimization process b) Descriptive process
c) Maximization process d) Minimization process
13) Games without a saddle point require player to play
a) Mixed strategies b) Pure strategies
c) Dominated strategies d) None of these
14) Motion study is recommended for
a) Developing motion picture b) Preventing indiscipline
c) Eliminating wasteful motions d) None of these

______________

Set P

You might also like