MH1812 DISCRETE MATHEMATICS (3.0 AU)

This course serves as an introduction to various topics in discrete mathematics. Familiarity with formal analysis through simple problems in some basic discrete structures is a key objective rather than knowing these structures in depth. Specifically, the main aim is to learn topics from the following broad areas of discrete mathematics: number theory, logic, combinatorics, and graph theory.
This course aims to provide students with a solid mathematical foundation and is intended for first year computer science and computer engineering students.

Easiness of Content

60%

Manageability of Workload

80%

Quality of Teaching

70%

By 02 reviewer(s)

Sort by

  • Avatar

    ali

    only a few tas are good at teaching and explaining the content. up to finals, content is quite easy during midterms, but finals are much harder. workload not too bad. concepts are mostly logical math, so if your ta is not good, it will be a bit difficult to understand some topics.

    June 11, 2024
  • Avatar

    Xinni

    Concepts are relatively straightforward to understand, but need to be consistent with doing tutorials and clarifying doubts. LAMS videos are quite bad, but the lectures are slightly better. Depends on the semester you take this mod, but the sem I took it the finals were not doable at all.

    May 26, 2021

Help us leave a review about this

Your email address will not be published.

Easiness of Content
Manageability of Workload
Quality of Teaching