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
GATE ME Subjects
Turbo Machinery
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12