ExamSIDE
Questions (Powered by ExamGOAL)
Industrial Engineering
Queuing
Marks 1Marks 2Marks 5
Production Planning and Control
Marks 1Marks 2Marks 5
Line Balancing
Marks 2
Forecasting
Marks 1Marks 2
Linear Programming
Marks 1Marks 2Marks 5
Assignment
Marks 1Marks 2
Pert and Cpm
Marks 1Marks 2Marks 5
Inventory Control
Marks 1Marks 2Marks 5
Transportation
Marks 1Marks 2Marks 5
Scheduling
Marks 1Marks 2Marks 5
Previous Next
1
GATE ME 2014
MCQ (Single Correct Answer)
+1
-0.3
A minimal spanning tree in network flow models involves
A
all the nodes with cycle/loop allowed
B
all the nodes with cycle/loop not allowed
C
shortest path between start and end nodes
D
all the nodes with directed arcs
2
GATE ME 2009
MCQ (Single Correct Answer)
+1
-0.3
The expected time $$\left( {{t_e}} \right)$$ of a $$PERT$$ activity in terms of optimistic time $$\left( {{t_0}} \right)$$, pessimistic $$\left( {{t_p}} \right)$$ and most likely time $$\left( {{t_L}} \right)$$ is given by
A
$${t_e} = {{{t_0} + 4{t_L} + {t_P}} \over 6}$$
B
$${t_e} = {{{t_0} + 4{t_P} + {t_L}} \over 6}$$
C
$${t_e} = {{{t_0} + 4{t_L} + {t_P}} \over 3}$$
D
$${t_e} = {{{t_0} + 4{t_P} + {t_L}} \over 3}$$
3
GATE ME 2004
MCQ (Single Correct Answer)
+1
-0.3
In $$PERT$$ analysis a critical activity has
A
maximum Float
B
zero Float
C
maximum Cost
D
minimum Cost
4
GATE ME 1997
MCQ (Single Correct Answer)
+1
-0.3
A dummy activity is used in $$PERT$$ network to describe
A
Precedence relationship
B
Necessary time delay
C
Resource restriction
D
Resource idleness
Previous Next
Questions Asked from Marks 1
GATE ME 2017 Set 2 (1) GATE ME 2016 Set 3 (1) GATE ME 2014 (1) GATE ME 2009 (1) GATE ME 2004 (1) GATE ME 1997 (1) GATE ME 1995 (1)
GATE ME Subjects
Engineering Mechanics
Machine Design
Strength of Materials
Heat Transfer
Production Engineering
Industrial Engineering
Turbo Machinery
Theory of Machines
Engineering Mathematics
Fluid Mechanics
Thermodynamics
General Aptitude