D1 is by far the easiest module in A-Level Maths and Further Maths, but also the easiest module to make mistakes in. Good luck to all those who are taking it !
I was wondering since our upcoming chemistry exams are coming up if people wanted to be part of a maths whatsapp revision group. I guessing most of us use whatsapp so I guess it will be more suitable for everyone then. If you are interested either pm me or responded to this message
are the definittions of "Cut" and "Minimum Cut" required knowledge?
Cut = A division of the vertices of a flow network into 2 sets, once containing the source(s) andthe other containning the sink(s).Minimum Cut = A cut whose capacity is least
are the definittions of "Cut" and "Minimum Cut" required knowledge?
Cut = A division of the vertices of a flow network into 2 sets, once containing the source(s) andthe other containning the sink(s).Minimum Cut = A cut whose capacity is least
This (Network Flows) is no longer in D1; it's in D2. If you're doing D2 you'll definitely need to know it.
This (Network Flows) is no longer in D1; it's in D2. If you're doing D2 you'll definitely need to know it.
thnx alow d1 Lol.
I have only really augmented chapterr 1.
Covered the rest sure. But done perhaps superflous work on d1. I will upload notes on it. Done the algorithm definitions, although the last 2 papers havee been tough from what d1 can be
There will always be a matchings and alternating paths question, just as there will always be a Dijkstra question, a Chinese Piostman question, a Linear Programming question.... Critical path is a bit more variable - you may or may not have to draw a network from a precedence table and/or do scheduling.
Which of the early algorithms are on the paper is the only unknown quantity really.
There will always be a matchings and alternating paths question, just as there will always be a Dijkstra question, a Chinese Piostman question, a Linear Programming question.... Critical path is a bit more variable - you may or may not have to draw a network from a precedence table and/or do scheduling.
Which of the early algorithms are on the paper is the only unknown quantity really.