The main topic areas in Decision 1 are:
(A) Searching / Sorting / Bin Packing
(B) Minimum connection problems (Prims/Kruskals)
(C) Dijisktra's algorithm for shortest path
(D) Route Inspection problems
(E) Matchings
(F) Linear programming (graphs & simplex)
(G) Critical path analysis
(H) Flows in networks
Which 3 of these topics areas would you like to start revising first? You could go for the ones you have least understanding of, or perhaps, consolidate with topics you consider yourself to be relatively confident with. Let us - both your teachers and fellow students - know by writing a 'comment' to this 'post'.
I've also set up individual 'posts' for each of these topic areas. Without too much reference to your notes, try to write a brief comment about what you understand the main learning points to be within each topic area.
Don't be afraid to make a comment, no matter how brief! This will not only help you by making you focus on what you do and don't know, but could be a useful resource for others taking this unit. It will also help your teachers better assess what individuals and the whole group need help with.
skip to main |
skip to sidebar
1 comment:
Just wanted to point out that the mathsnet.net website has some useful reminders about how some of the algorithms work.
Post a Comment