construction projects and relevant information Activity - - - - - - Duration (in days) Draw the network for the project ,calculate the earliest start time, earliest finish time, latest start time and latest finish time of each activity and find the critical path. Compute the project duration. Exercise . Choose the correct answer .
The critical path of the following network is (a) – – – (b) – – (c) – – – (d) – – – – . Maximize: z subject to x x $ In the LPP, which one of the following is feasible corner point? (a) (b) (c) $ (d) $ . One of the conditions for the activity ( i, j ) to lie on the critical path is (a) E E L L t j j ij (b) E E L L t j j ij (c) E E L L t j j ij (d) E E L L t j j ij .
In constructing the network which one of the following statement is false? (a) Each activity is represented by one and only one arrow. (i.e.) only one activity can connect any two nodes. (b) Two activities can be identified by the same head and tail events.
(c) Nodes are numbered to identify an activity uniquely. Tail node (starting point) should be lower than the head node (end point) of an activity. (d) Arrows should not cross each other. .
In a network while numbering the events which one of the following statement is false? (a) Event numbers should be unique. (b) Event numbering should be carried out on a sequential basis from left to right. (c) The initial event is numbered or .
(d) The head of an arrow should always bear a number lesser than the one assigned at the tail of the arrow. . A solution which maximizes or minimizes the given LPP is called