0% found this document useful (0 votes)
60 views10 pages

IMOR

Uploaded by

Deep Samanta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
60 views10 pages

IMOR

Uploaded by

Deep Samanta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

1/27/2018 GATE-2018 | Mechanical Engineering Online Test Series

Home SCORE CARD TIME MANAGEMENT QUESTIONS REPORT SOLUTION

My Test

Bookmarks Solution Report For INDUSTRIAL ENGINEERING


Represent whole test solution with correct and incorrect answers.
My Profile
View Your Test Analysis
Reports

Buy Package
Q. No Question Status

Q.1 Question 1 to 10 Carry One Mark Each


In a single server queuing model with constant arrival rate, which one of the
following probability distributions is followed by the inter – arrival times of the
customers at the service facility?

a. Binomial
b.
Poisson
c. Weibull
d. Exponential

Attempt Correct Correct Ans. b bookmark

Solution:-
b

Q.2 The queue of trucks at a crusher plant hopper is known to be M/M /1 queue. The
probability that there is no truck to unload is 0.3. Due to rains the mean service
time at the hopper is increased by 30%. As a consequence, the expected number
of trucks in the queuing system ( including the one possibly unloading) becomes

a.
10
b. 12
c. 14
d. 16

Not Attempt Correct Ans. a bookmark

Solution:-
a

http://kulkarniacademy.thinkexam.com/index.php?pageName=timeManagementReport&testid=33&t=cont-4&testType=2 1/10
1/27/2018 GATE-2018 | Mechanical Engineering Online Test Series

Q.3 For an LP problem, identify the INCORRECT statement

a. Optimal point lies in one of the corner points


b. Objective function is linear
c. All the constraints are linear
d.
Optimal point lies in any of the interior points of the feasible region

Not Attempt Correct Ans. d bookmark

Solution:-
d

Q.4 A balanced transportation problem is characterized by

a.
Total supply exceeds total demand
b. Total demand exceeds total supply
c.
Total demand is equal to total supply
d. Total supply is either equal or more than total demand

Attempt Incorrect Your Ans. a Correct Ans. c bookmark

Solution:-
c

Q.5 In the context of project management techniques, The TRUE statement is

a. CPM is stochastic and PERT is deterministic


b.
CPM is deterministic and PERT are stochastic
c. Both CPM and PERT are deterministic
d. Both CPM and PERT are stochastic

Attempt Correct Correct Ans. b bookmark

Solution:-
b

Q.6 In a PERT network, the activities on the critical path are a, b and c. The standard
deviations of the durations of these activities are 2, 2 and 1 respectively. The
variance of the project duration is

a. 3
b. 5
c.
9
d. 12

Not Attempt Correct Ans. c bookmark

http://kulkarniacademy.thinkexam.com/index.php?pageName=timeManagementReport&testid=33&t=cont-4&testType=2 2/10
1/27/2018 GATE-2018 | Mechanical Engineering Online Test Series

Solution:-
c

Q.7 The moving average method is to be used for forecasting demand based on m
periods of data. Two values of m are tried, m1 and m2 with m1 > m2, to get two

different forecasts, denoted by and . P – F (t) has less variability


than G (t). Q – Forecast error of F (t) is less than that of G (t). Which of the above
statements are true?

a. Only P
b. Only Q
c.
Both P and Q
d. Neither P nor Q

Not Attempt Correct Ans. c bookmark

Solution:-
c

Q.8 For a transportation problem that has a feasible solution, the North West corner
rule gives a possible solution which is

a.
A basic feasible solution to the problem
b. A near optional solution to the problem
c. The optional solution to the problem
d. One of the many optimal solutions to the problem

Attempt Correct Correct Ans. a bookmark

Solution:-
a

Q.9 The assignment problem in linear programming is also an example of a discrete


optimization problem. How many feasible solutions are there to this problem
defined on ‘n’ jobs and ‘n’ persons?

a.
b.

c.
d.
n!

Attempt Incorrect Your Ans. b Correct Ans. d bookmark

Solution:-
d

http://kulkarniacademy.thinkexam.com/index.php?pageName=timeManagementReport&testid=33&t=cont-4&testType=2 3/10
1/27/2018 GATE-2018 | Mechanical Engineering Online Test Series

Q.10 IN inventory cost structure, set up cost is a part of replenishment cost when it

a.
Has taken place externally
b. is dependent on supply conditions
c. is independent of supply conditions
d.
Has taken place internally

Attempt Incorrect Your Ans. a Correct Ans. d bookmark

Solution:-
d

Q.11 Question 11 to 25 Carry Two Marks Each


Three jobs A, B and C are to be assigned to three machines x, y and z. The

processing costs are given below: The

minimum total cost of assigning the jobs to machines is

a. 60
b. 54
c. 51
d.
49

Not Attempt Correct Ans. d bookmark

Solution:-
d

Q.12 Consider the following linear programming problem: Maximize


Subject to ;
The multiple optimal solutions lie on the
line joining the corner points

a.

b.

c.

d.

Not Attempt Correct Ans. c bookmark

http://kulkarniacademy.thinkexam.com/index.php?pageName=timeManagementReport&testid=33&t=cont-4&testType=2 4/10
1/27/2018 GATE-2018 | Mechanical Engineering Online Test Series

Solution:-
c

Q.13 Match the following

a.
P-3 Q-4 R-2 S-1
b. P-2 Q-3 R-4 S-1
c. P-3 Q-4 R-1 S-2
d. P-2 Q-4 R-3 S-1

Not Attempt Correct Ans. a bookmark

Solution:-
a

Q.14 The feasible region of an LP problem is shown in fig,the maximum value of the
objective function is

a.
20400
b. 20000
c. 19200
d. 16800

Not Attempt Correct Ans. a bookmark

Solution:-
a

Q.15

http://kulkarniacademy.thinkexam.com/index.php?pageName=timeManagementReport&testid=33&t=cont-4&testType=2 5/10
1/27/2018 GATE-2018 | Mechanical Engineering Online Test Series

Unit cost matrix of a transportation problem is given below in certain monetary

units The optimal solution for

the transportation problem has the allocation as shown below

When compared to initial basic

feasible solution by Vogel’s approximation method, how much improvement is


there in the optimal solution

a. 10
b. 20
c. 30
d.
0

Not Attempt Correct Ans. d bookmark

Solution:-
d

Q.16 Consider the following linear programming problem Maximize :


Subject to ; ; The above linear
programming problem has

a. Unique optimal solution


b.
Multiple optimal solutions
c. Unbounded solution
d.
Infeasible solution

Attempt Incorrect Your Ans. b Correct Ans. d bookmark

Solution:-
d

Q.17 A workshop has 4 lathe machines and 4 tasks for completion. Each of the
machines can perform each of the 4 tasks. Each task can be assigned to one and
only one machine. Estimated cost in rupees to complete each task is given in the

http://kulkarniacademy.thinkexam.com/index.php?pageName=timeManagementReport&testid=33&t=cont-4&testType=2 6/10
1/27/2018 GATE-2018 | Mechanical Engineering Online Test Series

matrix below. The total optimum cost in rupees for assigning the tasks to the

machines is

a. 210
b. 215
c.
220
d. 286

Not Attempt Correct Ans. c bookmark

Solution:-
c

Q.18 Students arrive at KAME office to receive GATE material. The inter – arrival time
of students at the service counter is Poisson distributed with an average time of
10 mm. The service time at the counter is distributed exponentially with a mean
time of 6 min. Average time spent by a student waiting for his turn to be served
in minutes is

a.
9
b. 12
c. 15
d. 18

Not Attempt Correct Ans. a bookmark

Solution:-
a

Q.19 The unit cost matrix of a balanced transportation problem is shown below

The transportation cost of

http://kulkarniacademy.thinkexam.com/index.php?pageName=timeManagementReport&testid=33&t=cont-4&testType=2 7/10
1/27/2018 GATE-2018 | Mechanical Engineering Online Test Series

the initial basic feasible solution by the North – West corner rule is

a. 1025
b. 1075
c.
1130
d. 1226

Not Attempt Correct Ans. c bookmark

Solution:-
c

Q.20 The feasibility region of an LP problem in variables x and y is given by the


following constraints, in addition to the non – negativity constraints
The number of corner point feasible solutions
for this problem are

a. 3
b.
4
c. 5
d. 6

Not Attempt Correct Ans. b bookmark

Solution:-
b

Q.21 A project network comprises five activities as shown

The activity durations, in

days, are indicated. Crashing of any activity costs Rs.1000 per day. If the project
is crashed to the shortest possible duration of 3 days, the total crashing cost in
rupees is ( in the figure, the arrow of 4 to 2 is wrong, it is from 2 to 4 but not from
4 to 2)

a. 25000
b. 34000
c. 13000
d.
19000

Not Attempt Correct Ans. d bookmark

Solution:-

http://kulkarniacademy.thinkexam.com/index.php?pageName=timeManagementReport&testid=33&t=cont-4&testType=2 8/10
1/27/2018 GATE-2018 | Mechanical Engineering Online Test Series

Q.22 A project is composed of five activities whose three time estimates in months
are given below

The standard deviation of the project length in months is

a. 2
b.
3
c. 6
d. 9

Not Attempt Correct Ans. b bookmark

Solution:-
b

Q.23 Given the following linear programming problem Maximum


Subject to ; 2x1 + 3x2 ≤ 9 ( Both X1 and X2 are greater than or

equal to zero ), The corner point feasible solution in terms of is

a. (1.5, 0)
b. (1.25, 1.5)
c. (0.5, 1.0)
d.
(2.25, 1.5)

Not Attempt Correct Ans. d bookmark

Solution:-
d

Q.24 The assignment problem given requires four different jobs to be done on four

different machines The minimum cost

of assignment is ____________

http://kulkarniacademy.thinkexam.com/index.php?pageName=timeManagementReport&testid=33&t=cont-4&testType=2 9/10
1/27/2018 GATE-2018 | Mechanical Engineering Online Test Series

Not Attempt Correct Ans. 116 Range. (116.00 - 116.00 ) bookmark

Solution:-
116

Q.25 For the critical path network shown, the slack for the activity ‘b’ in months is

a. 4
b.
6
c. 9
d. 13

Not Attempt Correct Ans. b bookmark

Solution:-
b

Copyright © 2016 thinkexam, All Rights Reserved.


Online Test Platform Powered by Think Exam

http://kulkarniacademy.thinkexam.com/index.php?pageName=timeManagementReport&testid=33&t=cont-4&testType=2 10/10

You might also like