• We need your support!

    We are currently struggling to cover the operational costs of Xtremepapers, as a result we might have to shut this website down. Please donate if we have helped you and help make a difference in other students' lives!
    Click here to Donate Now (View Announcement)

Economics, Accounting & Business: Post your doubts here!

Messages
318
Reaction score
1,937
Points
253
Anything else? This is getting boring ask something hard. Revise the Strategic part, it's very very important.
 
Messages
318
Reaction score
1,937
Points
253
May I ask you if you don't mind redapple, what is your real name? Which school are you from?
 
Messages
240
Reaction score
124
Points
53
Please do that dumb thing is really annoying me! I still get stuck calculating the LFT and EST.

est of first node is always 0.

est = first node est + next activity duration = next node est. if you have more than 2 nodes coming to one next node, the one with the higher value will be brought forward.

at the last node, lft = est and it is calculated:
lft = last node lft - previous activity duration = previous node lft. if you have more than 2 nodes coming to one previous node, the one with the lower value will be brought forward

and to counter check, that you have calculated the right values, you should get zero lft at the starting node as you come back from last node for calculating lft
 
Messages
764
Reaction score
752
Points
103
est = first node est + next activity duration = next node est. if you have more than 2 nodes coming to one next node, the one with the higher value will be brought forward.

at the last node, lft = est and it is calculated:
lft = last node lft - previous activity duration = previous node lft. if you have more than 2 nodes coming to one previous node, the one with the lower alue will be brought forward
Is THIS BIZZNESS!!!!!Z????????:eek:
 
Messages
318
Reaction score
1,937
Points
253
est = first node est + next activity duration = next node est. if you have more than 2 nodes coming to one next node, the one with the higher value will be brought forward.

at the last node, lft = est and it is calculated:
lft = last node lft - previous activity duration = previous node lft. if you have more than 2 nodes coming to one previous node, the one with the lower alue will be brought forward

By higher or lower value do you mean by duration?
 
Messages
318
Reaction score
1,937
Points
253
No you didn't. Now suddenly where does the red coloured apple come from? Let me guess - It failed because it was coloured red.
 
Top