Posted on

NUS Math Module Review: MA1100 Basic Discrete Mathematics

Prof Chin goes through everything very seriously and in depth – he stops at nothing and makes no assumption in everything he does. Half the time the LT would be quiet and holding its breath; nonetheless it did make us appreciate the rigour brought about.

Textbook: Lakins (Tools of Mathematical Reasoning)

Topics: Proof, Logic, Sets, Maps, Number Theory, Finite/Infinite sets with ZFC axioms (Equivalence relations and partitions are removed due to lack of time).

As mentioned above, when going through the ideas mentioned, he never leaves a stone unturned (e.g. why must a number be either even or odd – and not both?)

Homework: 5 sets, 10 questions each, 10 marks per question of which 5 are marked. Best 4 sets taken (40%). Generally very lenient marking (by a phd student) save for 1st homework with a +/-10 negative marking. Negative marking is present in T/F questions in the rest of the homework (+/-1). As mentioned by chocolate below, some proofs/results borrowed from upper level modules like analysis./algebra, so may be intimidating at first look.

Finals: 20 marks (4 questions of 5 marks each) proving, 40 T/F (grouped in 10s). T/F questions are +/0/- now, leaving blanks give no penalty. The first part was moderately hard, and it tested much on Number Theory (which ended up saving me). T/F questions are similar to homework and test from other sections, such as sets and maps. Overall a pretty hard paper. Use of pencil is allowed, take full use of this allowance.

Overall 7/10, challenging (probably still the hardest L1) but worth it. Take it if you are in Math, or in CS/ Comp Bio and want to gain more exposure to Pure Math over CS1231.

Head over to our Shop for more module content!