scheduling diagram when x workers available isgiving me trouble.any hints or advice ?
Best thing to do is write out the critical path as the first worker's schedule then fill in the other tasks using extra workers. Finally go back over and check that you haven't scheduled any tasks to start before their dependent tasks have finished. With a bit of practice it is not necessary to draw a Gantt Chart.
The grade boundaries are pathetically high. Probably because not many people choose to do it. Agree though, critical path analysis will be the death of me. If I'm asked to draw a Gantt Chart, I will cry
You can make the most stupid mistakes on this exam i got a D and have to resit.. Although it is probably one of my most easiest subjects and everything i very simple.. I'm really worried i'm going to mess up in the same way as i did in jan..
I've dossed off in this subject all year and I actually can't do CPA or bloody linear programming ... I also don't really know what you're meant to put when they ask you what a flow chart achieves. Provided I don't make idiotic mistakes (highly likely for me) I should end up with a C/B :/
I reckon a flow chart type algorithm question will come up, I hope grade boundaries are not as high as usual, really need 90+ UMS but it is easy to drop marks by not checking calculations properly.
I think I'm more or less ready with the exception of linear programming but that is my revision plan for today. Other than that I can do most things although scheduling and drawing from precedence tables take me a couple of trys.
I got a C in January and i just hope i dont do any stupid mistakes this time round. D1 is actually very simple apart from when sometimes you have the route inspection and i think in January they asked some akward question that wasn't the usual ' u can start from any two vertices' but somehow different. I can't really remember now but that definately cost me some marks!