Topics
This is another video in the series on Networks for Further Maths. I take a look at flow problems (and I don't mean when going to the toilet!) for networks. We look at capacities, cuts, maximum flow and minimum capacity and see how they apply to digraphs and networks. There are a number of worked examples all related back to the theory.
This next video in the Networks series for the Further Maths course sees me looking at the interesting topic of Matching and Allocation problems. It really doesn't get more exciting than this. I look at what bipartite graphs and how they can be used to solve matching problems using The Hungarian Algorithm. I also discuss the different types of bipartite graphs; namely, connected and directed. There are some worked examples and all the theory is explained in an easy to understand way.
The videos keep coming ... thick and fast ... and here is another one for the Further Maths Units 3 and 4 course on Networks. Building on our previous lessons I now look at the idea of precedence tables and activity networks and how they can help us to plan and execute projects. There are a number of worked examples from the Cambridge VCE textbooks series all explained with easy to understand theory.
This is the second from last video looking at Networks for the Further Maths course. Scheduling problems is about as real world as it gets! This is practical Mathematics. I take a look at how we can add weights to activity networks to let us schedule tasks e.g. building a house, making a cup of tea etc. I look at forward and backwards scanning. I explain Earliest Start Times (EST) and Latest Start Times (LST) and how they relate to Float Times. We look at how we use the information to find the Minimum completion time and where the Critical Path is. All with lots of examples explained in my own unique way.
This is the final video in the Networks series for Further Maths. This is looking at the concept of Crashing. What is Crashing? Well, we look to try and complete a set of activities in a reduced amount of time by considering the activities on the critical path. When we reduce the length of time of the activities this can cost us money! So, we call it crashing with cost. I take a look at how we can crash the project and how we need to make sure, when we do crash, that we don't make new critical paths through the network.
Select a topic
These are the videos which are available in each chapter. You will notice that some are free and some are for subscribers only. Making and hosting these videos costs a little bit of money. To help pay for the hosting fees I have no choice but to hide some of the videos and make them for subscribers only.