Lesson notes for this video are for subscribers only. Sorry! To gain access, please consider supporting me by taking out a (very reasonable and cheap!) one year plan by [clicking here]
Chapters
Want to skip to the best bits?
Gain access to chapters by taking out a (very reasonable and cheap!) one year plan
This is a video for the Year 12 VCE (Units 3 and 4) General Maths course relating to Networks. It looks at the section relating to Scheduling problems. This is a really important part of the course and is the fodder for SACs and the hardest of VCAA questions. So, why not spend a little time looking at it properly! Whilst the video is quite long, it lets me look at how to properly forward and backwards scan to find the Earliest Starting Time (EST) and Latest Starting Time (LST). Knowing these two allows is to find the Float Time for any activity and the minimum completion time of the project. Oh ... and we might as well throw in finding the Critical Path too. Phew! So much done. There are a number of worked examples and some VCAA questions to properly explain the theory. And some humour thrown in too!