Local review · Access to each material is reviewed separately. This is not a personal registration or degree audit.

City University of Hong Kong · Course

MA2509Discrete Mathematics

2026/27 · Undergraduate

Course code
MA2509
Credit units
3
Academic unit
Department of Mathematics
Readable study materials
1 items

Course overview and requirements

Choose the outline year, then review the content, entry requirements and assessment.

2026/27 · Official catalogue edition

The effective term printed in this PDF is Semester A 2025/26。

This outline is still being checked. Before registering, confirm entry and assessment requirements against the official document linked below.

Offering details for 2026/27 have not been checked. Confirm available sections in AIMS before registering.

The PDF Effective Term is separate from the 2026/27 catalogue year and current offering observation.

What you will study

Course overview
This course introduces the basic concepts and techniques of discrete mathematics. It will help students understand the basic theory and recognize the applications of discrete mathematics. It trains students in the ability to think quantitatively and analyze problems critically.

Official PDF, page 2 · Abstract

Course content
Propositional Logic. Predicate Logic. Sets. Functions. Relations. Equivalence \& Order Relations. Combinatorics. Inclusion- Exclusion Principle. Recurrence Relations. Graphs. Directed Graphs. Connectivity. Euler \& Hamilton Graphs. Weighted Graphs. Shortest Paths (Dijkstra's Algorithm), Trees. Rooted Trees. Binary Trees. Spanning Trees.

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 and implement                       x            x
               basic operations in discrete mathematics.
2              perform combinatorial analysis to solve                                          x
               counting problems.
3              design and formulate mathematical models                            x            x
               through relations, combinatorics, graphs, and
               trees.
4              apply mathematical reasoning to comprehend                                       x
               and construct mathematical arguments.
5              apply graph theory and other mathematical                                        x                x
               methods to both data structures and analysis
               of algorithms, and some other problems in
               computer sciences.

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
MA2185 Discrete Mathematics MA2504 Discrete Mathematics

Official PDF, page 1 · Exclusive Courses

Assessment and passing the course

Assessment
Continuous Assessment (%): 40; Examination (%): 60; Examination Duration (Hours): 3
View the original assessment table and instructions
ATs              CILO No.           Weighting (%)          Remarks ("-" for      Allow Use of
                                                                                nil entry)            GenAI?
1                    Quizzes          1, 2               10                     Questions are         No
                                                                                designed for the
                                                                                first part of the
                                                                                course to see how
                                                                                well the students
                                                                                have learned the
                                                                                basic concepts.

2                       Test/Midterm       2, 3               20                  Questions are        No
                                                                                  designed for the
                                                                                  second part of the
                                                                                  course to see how
                                                                                  well the students
                                                                                  have learned the
                                                                                  basic techniques
                                                                                  and recognize
                                                                                  the applications
                                                                                  of discrete
                                                                                  mathematics.
3                       Hand-in            1, 2, 3, 4, 5      5                   These are skills-  Yes
                        assignments                                               based assessment
                                                                                  to enable students
                                                                                  to demonstrate the
                                                                                  basic concepts,
                                                                                  techniques
                                                                                  of discrete
                                                                                  mathematics
                                                                                  and identify the
                                                                                  applications.
4                       Formative take-  1, 2, 3, 4, 5        5                   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: 40% Coursework 60% Examination (Duration: 3 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

Credits, duration and edition details
Title in this edition
Discrete Mathematics

Official PDF, page 1 · Course Title

Credits in this edition
3

Official PDF, page 1 · Credit Units

Course duration
One Semester

Official PDF, page 1 · Course Duration

Syllabus effective term
Semester A 2025/26
Levels printed in the syllabus
B1, B2, B3, B4 - Bachelor's Degree

Official PDF, page 1 · Level

Check the official document

Read or download this edition through the university link below. MA2509 · Open the original university PDF ↗

Source · University course information ↗ · Checked 2026-10-20T14:18:40.320Z

Study materials

1 readable items

Browse by the material’s own year and type. Historical materials are study references.

1 / 1 items
  • 22_23 Mid[Ques+Sol]

    Solutions · 20.10.2022 · Autumn 2022 Autumn · Local review material · 645 KB

    The file identifies MA2509; its original folder was labelled MA2185. It is filed here by its document course code.

Ready to register for this course?

  1. Check the year and entry requirements

    Use the relevant outline year and check the prerequisites, corequisites and exclusions. Verify missing conditions through the official source linked on this page.

  2. Check your programme curriculum

    Confirm which requirement the course fulfils and any alternatives or credit requirements within its course group.

  3. Choose sections in AIMS and confirm the result

    Check the available sections, places and times for the term. After submitting through the registration process, confirm that the course and its sections have been added successfully.