Bissoy.com
Doctors Medicines MCQs Q&A

Statement (I): A merging node will have a uniquely determinable Late Event Time. Statement (II): A merging node is defined as a node where more than one incoming activity arrow leads in 

Statement (I): A merging node will have a uniquely determinable Late Event Time. Statement (II): A merging node is defined as a node where more than one incoming activity arrow leads in  Correct Answer Both Statement (I) and Statement (II) are individually true but Statement (II) is not the correct explanation of Statement (I)

Concept:

Merging Node: When more than one activity comes and joins a node such a node is known as the merging node.

A merging node will have a uniquely determinable Late Event Time.

Bursting Node: When more than one activity leaves a node such a node is known as bursting node.

Merging and Burst event: An activity may be a merge and burst event at the same time as with respect to some activities it can be a merge event and with respect to some other activities it may be a burst event.

[ alt="F1 A.M Madhu 10.07.20 D11" src="//storage.googleapis.com/tb-img/production/20/07/F1_A.M_Madhu_10.07.20_D11.png" style="width: 360px; height: 112px;">

Earliest start (ES): this is the earliest possible time that an activity can begin. All immediate predecessors must be finished before an activity can start.

Latest start (LS): this is the latest time that an activity can begin and not delay the completion time of the overall project. If the earliest start and latest start times are the same then the activity is critical.

Earliest finish (EF): this is the earliest possible time that an activity can be finished (= earliest start time + activity completion time).

Latest finish (LF): this is the latest time that an activity can be finished and not delay the completion time of the overall project ( = latest start time + activity completion time). As with start times, the activity is critical if the earliest finish and latest finish times are the same.

Slack: this is the difference between the earliest start time and the latest start time (which in turn is equal to the difference between the latest start time and the latest finish time), i.e. Slack = LS - ES = LF - EF

Hence, both Statement (I) and Statement (II) are individually true but Statement (II) is not the correct explanation of Statement (I).

Related Questions

The question below consists of a question and two statements. You have to decide whether the data provided in the statements are sufficient to answer the question and based on this give answer. Six arrows of different colours – Red, Green, Pink, Blue, White and Black are placed around a circular table facing the centre. Question: Which colour’s arrow is placed to the immediate left of black coloured arrow? Statements: I. Green coloured arrow is placed opposite to the white coloured arrow which is to the immediate left of pink coloured arrow. II. Red coloured arrow is placed opposite to blue coloured arrow and is placed adjacent to white coloured arrow.
Which of the following statement(s) is/are incorrect? (i) Earliest start of an activity is the early event time of the node it leaves. (ii) Latest finish of an activity is the late event time of the node it enters. (iii) Latest start of an activity is its latest finish minus its duration
The following are the two statements relating to the theory of probability. Indicate the statements being correct or incorrect.
Statement I The probability of the joint occurrence of independent events A and B is equal to the probability of event A multiplied by the probability of event B or vice-versa.
Statement II The probability of the joint occurrence of independent event A and dependent event B is equal to the probability of event A multiplied by the conditionalprobability of event B when event A has occurredor vice-versa.
A circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing to the next node. We maintain exactly two external pointers FRONT and REAR pointing to the front node and the near node of the queue, respectively. Which of the following statements is/are CORRECT for such a circular queue, so that insertion and deletion operations can be performed in O(1) time? I. Next pointer of front node points to the rear node. II. Next pointer of rear node points to the front node.
The following statements' relate to project network. Choose the correct answer for the statements being correct or-incorrect.
Statement I An activity cannot be represented by more than one arrow, but. an arrow can represent one or more activities.
Statement II The activities in a critical path can be preponed or postponed.
The network rules are common to all activity on arrow networking systems. The use of computers for making computations may impose certain rules. Which of the following basic rules of network logic are correct? (1) Before an activity may begin, all the activities preceding it must be complete. (2) Any two events may be directly connected by no more than one activity. (3) Event numbers must not be duplicated in a network. Select the correct answer using the codes given below:
In an Activity-on-Arrow network, which of the following rules of network logic are mandatory? 1. Any two events can be directly connected by not more than one activity. 2. Event numbers should not be duplicated in a network. 3. Before an activity may begin, all the activities preceding it must be completed. Select the correct answer using the code given below.
Consider the following policies for preventing deadlock in a system with mutually exclusive resources. I. Processes should acquire all their resources at the beginning of execution. If any resource is not available, all resources acquired so far are released II. The resources are numbered uniquely, and processes are allowed to request for resources only in increasing resource numbers III. The resources are numbered uniquely, and processes are allowed to request for resources only in decreasing resource numbers IV. The resources are numbered uniquely. A process is allowed to request only for a resource with resource number larger than its currently held resources Which of the above policies can be used for preventing deadlock?
During merging, __________ now always checks the incoming segments for corruption before merging.
During merging, . . . . . . . . now always checks the incoming segments for corruption before merging.