MA2185Discrete Mathematics

What you will study

Course overview

This course aims to introduce basic ideas of discrete mathematics such as formal mathematical reasoning techniques, basic counting techniques and their applications, number theory and graph theory for computer science students. The objective is intended for students to understand the basic theory and some applications of discrete mathematics. The course gives students training in the ability to think quantitatively and analyse problems critically.

Official PDF, page 2 · Abstract

Course content

• Basic Concepts: Logic. Proof and mathematical reasoning. Recurrence relation. Sets and relations and functions. Cartesian product. • Counting and Probability: Counting techniques. Permutations and combinations. Probability, random variables, expectation, and variance. • Number Theory: Introduction to crypto, modulus operation, and finite group. Inverse and GCD. • Graph Theory: Graph definition and properties. Euler and Hamiltonian circuits. Graph coloring. Planarity.

Official PDF, page 6 · Keyword Syllabus

Intended learning outcomes

View official learning outcomes and conditions

CILOs                                               Weighting (if DEC-A1         DEC-A2          DEC-A3
                                                                   app.)
1              explain at high levels concepts from discrete                       x
               mathematics.
2              implement basic operations in discrete                                           x
               mathematics.
3              use formal mathematical reasoning techniques                                     x
               and basic counting techniques.
4              develop mathematical models through relations,                      x            x
               combinatorics, graph theory, and apply
               mathematical methods to a range of problems
               in computer sciences.
5              the combination of CILOs 1-4                                        x            x

Official PDF, page 2 · Course Intended Learning Outcomes (CILOs)

Before you take this course

Check prerequisites, precursors and corequisites separately, together with equivalence and exclusion conditions. “and” means conditions must be met together; “or” marks alternatives. Read combined conditions in the groupings shown in the original text below.

Prerequisites

Nil

Official PDF, page 1 · Prerequisites

Precursors

Nil

Official PDF, page 1 · Precursors

Corequisites

This edition of the official syllabus does not state this item.

Additional course requirements

This edition of the official syllabus does not state this item.

Equivalent courses and conditions

Nil

Official PDF, page 1 · Equivalent Courses

Exclusive courses and conditions

MA2144 Discrete Mathematics MA2504 Discrete Mathematics MA2509 Discrete Mathematics

Official PDF, page 1 · Exclusive Courses

Assessment and passing the course

Assessment

Continuous Assessment (%): 30; Examination (%): 70; Examination Duration (Hours): 2

View the original assessment table and instructions

ATs              CILO No.           Weighting (%)           Remarks ("-" for      Allow Use of
                                                                                 nil entry)            GenAI?
1                    Quizzes/Test/    2, 3               15                      Questions are         No
                     Midterm                                                     designed for the
                                                                                 first part of the
                                                                                 course to see how
                                                                                 well the students
                                                                                 have learned the
                                                                                 basic concepts,
                                                                                 techniques and
                                                                                 some applications
                                                                                 of discrete
                                                                                 mathematics.

2                       Hand-in          1, 2, 3, 4           15                  These are skills     Yes
                        assignments                                               based assessment
                                                                                  to see whether
                                                                                  the students are
                                                                                  familiar with the
                                                                                  basic concepts,
                                                                                  techniques
                                                                                  of discrete
                                                                                  mathematics and
                                                                                  some applications
                                                                                  in computer
                                                                                  sciences.
3                       Formative take-  5                    0                   The assignments      Yes
                        home assignments                                          provide students
                                                                                  chances to
                                                                                  demonstrate their
                                                                                  achievements
                                                                                  on discrete
                                                                                  mathematics
                                                                                  learned in this
                                                                                  course.

Official PDF, page 4 · Continuous Assessment (%),Examination (%),Examination Duration (Hours)

Passing requirements

Minimum Examination Passing Requirement (%): 30 Additional Information for ATs: 30% Coursework 70% Examination (Duration: 2 hours, at the end of the semester) For a student to pass the course, at least 30% of the maximum mark for the examination must be obtained.

Official PDF, page 4 · Minimum Examination Passing Requirement (%),Additional Information for ATs