Economics, Accounting & Business: Post your doubts here!

[redapple20]

Thankyou

 

[Saiyan]

Anything else? This is getting boring ask something hard. Revise the Strategic part, it's very very important.

 

[redapple20]

Pata hai Saad Ghori bhi har thori dyr bad jhank k jata hai k yahan kia horha hai!
magar not replying ... lagta hai is mai to A* la kar rhega! ( insha Allah)

 

[redapple20]

Anything else? This is getting boring ask something hard. Revise the Strategic part, it's very very important.

Your preparation is complete?

 

[Saiyan]

Yeah sort of but still I sometimes get confused with the critical path analysis.

 

[wajiman]

Yeah sort of but still I sometimes get confused with the critical path analysis.

i may b able to help you

 

[Saiyan]

May I ask you if you don't mind redapple, what is your real name? Which school are you from?

 

[Saiyan]

i may b able to help you

Please do that dumb thing is really annoying me! I still get stuck calculating the LFT and EST.

 

[redapple20]

I are private and moi name too difficult! You canncawl me jiya if u like thats my nick! Former beaconite!

 

[Saiyan]

How can you have a former name? Did you change your name?

 

[redapple20]

How can you have a former name? Did you change your name?

Abay dimag ki dahi! (sorry) my FoRMER SKOOOOOOOOOOOOOOOOOOOOOOOOOOOOL!

 

[Saiyan]

Anyways let's go back to business studies.

 

[wajiman]

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

 

[redapple20]

Anyways let's go back to business studies.

Sorry

 

[redapple20]

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????????

 

[Saiyan]

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?

 

[Saiyan]

Is THIS BIZZNESS!!!!!Z????????

Yes of course, suddenly you seem surprised! See chapter 25 of the Peter Stimpson book.

 

[redapple20]

Yes of course, suddenly you seem surprised! See chapter 25 of the Peter Stimpson book.

Did i tell u the story about red coloured apple who failed?

 

[Saiyan]

No you didn't. Now suddenly where does the red coloured apple come from? Let me guess - It failed because it was coloured red.

 

[redapple20]

Saiyan and wajiman okay explain to me too! From the staaaaaaart and bear in mind im a bighead and dont undastand that easily... please :/