1
GATE ME 2008
+2
-0.6
For the network below, the objective is to find the length of the shortest path from node $$P$$ to node $$G.$$ Let $${d_{ij}}$$ be the length of directed are from node $$i$$ to node $$j$$. Let $${s_j}$$ be the length of the shortest path from $$P$$ to node $$j.$$ Which of the following equations can be used to find $${s_G}$$?
A
$${s_G} = Min\,\,\left\{ {{s_Q},\,\,{s_R}} \right\}$$
B
$${s_G} = Min\,\,\left\{ {{s_Q} - {d_{QG}},\,\,{s_R} - {d_{RG}}} \right\}$$
C
$${s_G} = Min\,\,\left\{ {{s_Q} + {d_{QG}},\,\,{s_R} + {d_{RG}}} \right\}$$
D
$${s_G} = Min\,\,\left\{ {{d_{QG}},\,\,{d_{RG}}} \right\}$$
2
GATE ME 2006
+2
-0.6
Consider a $$PERT$$ network for a project involving six tasks ($$a$$ to $$f$$)

The expected completion time of the project is

A
$$238$$ days
B
$$224$$ days
C
$$171$$ days
D
$$155$$ days
3
GATE ME 2006
+2
-0.6
Consider a $$PERT$$ network for a project involving six tasks ($$a$$ to $$f$$)

The standard deviation of the critical path of the project is

A
$$\sqrt {151}$$ days
B
$$\sqrt {155}$$ days
C
$$\sqrt {200}$$ days
D
$$\sqrt {238}$$ days
4
GATE ME 2005
+2
-0.6
A project has six activities $$(A$$ to $$F)$$ with respective activity durations $$7,5,6,6,8,4$$ days. The network has three paths $$A-B,C-D$$ and $$E-F.$$ All the activities can be crashed with the same crash cost per day. The number of activities that need to be crashed to reduce the project duration by $$1$$ day is
A
$$1$$
B
$$2$$
C
$$3$$
D
$$6$$
GATE ME Subjects
EXAM MAP
Medical
NEET