Consider the following precedence graph $(\text{Fig}.6)$ of processes where a node denotes a process and a directed edge from node $P_{i}$ to node $P_{j}$ implies; that $P_{i}$ must complete before $P_{j}$ commences. Implement the graph using FORK and JOIN constructs. The actual computation done by a process may be indicated by a comment line.
@pankaj ,Thank you for the explanation.. here, I am not getting how it is ensuring the direction from P2 to P5. could you please explain ?
pankaj borah Can u please explain the method u used. I am a newbie to this.
@Arjun Sir, @Akash Kanase sir
is this in syllabus now? How to approach these type of question?
@ankitgupta.1729 I think after the first “fork L2” if we add the line “goto L3”, then P2 to P5 edge will be added correctly (otherwise from P2 we are doing P3 which is wrong). Please correct it.
@Venky8 Sorry. I forgot all these things related to fork and join constructs. So, I can’t say whether it is correct or not.
@ankitgupta.1729 Ok I was referring to answer before edit. Answer is correct now 👍 (Reference 28:00).
@pankaj borah
after P2
fork L3 should be present.
because L3 will deal with P5.
@Pranavpurkar
the above link is of hotstar dude.☺
@Pranavpurkar kya baat h bhai...wah
Lol, @22gate @GateOverflow04 Sorry brother, i think by mistake it happened😂
64.3k questions
77.9k answers
244k comments
80.0k users