Tutorials are to submitted weekly (for the first 10). No tutorial attendance, and a 2hr lecture per week. 1 midterm in the middle.

Tutorials are to submitted weekly (for the first 10). No tutorial attendance, and a 2hr lecture per week. 1 midterm in the middle.

Maybe it's because I like this course, but I find most of the content of the lecture notes very simple and easy to understand. The course is divided into counting and graphs. Counting includes P&C, recurrence, and they are quite standard. Graphs, what is needed is just the theorems and definitions, and they are really easy to memorise. So, if one understands the theorems, doing the tutorials is really a breeze. :D Before submitting the tutorial homework, the questions will be discussed and thus corrections can be make. Thus, the 10% is more like an encouragement for students to do work.

However, I have 1 friend who really hates discrete to the core. What she says is that, knowing the theorems and definitions are insufficient in doing questions, since the problems require a knowledge of "when to apply / how to apply". That quite true, but I believe with extra practice, it should be ok. Augmenting paths and non-linear homogenous recurrence can give a slight headache, but they are fine after sufficient understanding and practice. :)

Compared to the past few years, the final paper for my cohort is much more difficult! (Not really a bad thing) That's life, but the finals has shown that as long as you study the content with some understanding, and can show a few good proofs, it's highly likely to get a lot of marks. I gave up doing 2v of the question, no time. =/

Those who have taken MH8300 should seriously take this course! It's super similar for the graphs section! The last 2 lectures were dedicated to learning some applications of graph theory. Very interesting. :) Since this is a rather fun course, it's definitely recommended as a UE for humanities / MAEC students.

Programme: MATH(SPS)

- COUNTING, PERMUTATIONS AND COMBINATIONS, BINOMIAL THEOREM - RECURRENCE RELATIONS - GRAPHS, PATHS AND CIRCUITS, ISOMORPHISMS - TREES, SPANNING TREES - GRAPH ALGORITHMS (E.G., SHORTEST PATH, MAXIMUM FLOW) AND THEIR COMPUTATIONAL COMPLEXITY, BIG-O NOTATION