Run down
Marcus did a little run down on the maths modules he's taking. I think I'll do the same too...I'll be cheeky here and say that the intersection of my set of modules and his is nonempty. . .
I'm taking
MA3215 3D-Differential Geometry: I kind of enjoyed this module cos the ideas were simple to grasp and have lots of depth to them (of course, the deeper parts require more effort). But overall, the best strategy would be to mug tutorials and practise partial differentiation.
MA4203 Field Theory: This is definately not for the faint of heart. The crux of it is the galois correpondence between fields and groups. It is super technical, but the central idea is beautiful. Now I know why you can't do certain things with a ruler and compass, solve the general quintic (and higher powers) and find out which regular n-gon's are constructible.
MA4235 Graph Theory I: This is the module with the least amount of theorems, but don't let that fool you! It's simplicity belies it's enourmous difficulty. (esp for the 'Section B' questions), graph theory could be classified as a discrete mathematics type. Keen observation powers are needed here.
MA4254 Discrete Optimization: It's LP all over again with the added constraint of solutions being integers. Gah, lots of words and little symbols make me nervous. It's a pure mugger module, practise...something which I detest. Nothing deep here, this is a applied math module rather than a pure one.
There you have it, the four tigers I must tame next week.
I'm taking
MA3215 3D-Differential Geometry: I kind of enjoyed this module cos the ideas were simple to grasp and have lots of depth to them (of course, the deeper parts require more effort). But overall, the best strategy would be to mug tutorials and practise partial differentiation.
MA4203 Field Theory: This is definately not for the faint of heart. The crux of it is the galois correpondence between fields and groups. It is super technical, but the central idea is beautiful. Now I know why you can't do certain things with a ruler and compass, solve the general quintic (and higher powers) and find out which regular n-gon's are constructible.
MA4235 Graph Theory I: This is the module with the least amount of theorems, but don't let that fool you! It's simplicity belies it's enourmous difficulty. (esp for the 'Section B' questions), graph theory could be classified as a discrete mathematics type. Keen observation powers are needed here.
MA4254 Discrete Optimization: It's LP all over again with the added constraint of solutions being integers. Gah, lots of words and little symbols make me nervous. It's a pure mugger module, practise...something which I detest. Nothing deep here, this is a applied math module rather than a pure one.
There you have it, the four tigers I must tame next week.
This entry was posted
on Saturday, April 23, 2005 at 9:11 AM.
You can skip to the end and leave a response.
» Post a Comment