MAST30011: Graph Theory

2 assignments (first is worth 8%, second is worth 12%) and 1 x 3 hour exam (worth 80%)

This subject starts off relatively easy and it's easy to neglect doing any study after a while and then suddenly you're faced with difficult concepts.

Anyway, the subject's content is somewhat intuitive and doesn't go anywhere near as abstract as what the other third year pure maths subjects do, so if you keep on top of the work, the subject should be a breeze. Although David does put the odd unsolved graph theory problem in the problem sheets (which he'll warn you about)

Both assignments are given to you on the first day, so if you already understand the content, you can finish them ahead of the due date (this wasn't the case for me).

This year's exam was split into three components:

- The first part (15% of the exam) was definitions and examples, which you can rote learn out of the notes.

- The second part (45% of the exam) was applying algorithms, you can master this skill by doing algorithm problems ad nauseum.
- The third part (40% of the exam) was doing proofs. This part is what will divide the students into those who get H1's and those who don't. Some of the proofs I found in the exam were quite tricky.

No

Yes, from 1998 (maybe earlier)

3.5/5

G. Chartrand and O.R. Oellerman, Applied and Algorithmic Graph Theory, McGraw-Hill, 1993, Freeman, 1998.

3 x 1 hour lectures, 1 x 1 hour practice class

2012

H3 [65]