MA2184 Discrete Mathematics for Computing


Part I

Course Duration: One semester
Credit Units: 3
Level: B2
Medium of Instruction: English
Prerequisites: Nil
Precursors: A-Level Pure Mathematics; or
A-Level Applied Mathematics; or
MA1200/MA1300 and MA1201/MA1301; or equivalent

Equivalent Courses: Nil
Exclusive Courses:  MA2144 and MA2504

Part II      

Course Aims
This course introduces the basic concepts and techniques of discrete mathematics. It helps students understand the basic theory and some applications of discrete mathematics in computing science. It also develops students’ ability to analyze problems critically and quantitatively.

Course Intended Learning Outcomes (CILOs)
Upon successful completion of this course, students should be able to:

No.

CILOs

Weighting (if applicable)

1.

explain at high levels concepts and implement basic operations in discrete mathematics.

3

2.

perform combinatorial analysis to solve counting problems.

2

3.

develop mathematical models from computation theory to programming languages through relations, combinatorics, graphs and trees.

2

4

use mathematical reasoning to comprehend and construct mathematical arguments.

2

5.

apply graph theory and other mathematical methods to both data structures and the analysis of algorithms, and some other problems in computer sciences.

3

6.

the combination of CILOs 1-5

3

Teaching and Learning Activities (TLAs)
(Indicative of likely activities and tasks designed to facilitate students’ achievement of the CILOs. Final details will be provided to students in their first week of attendance in this course)

TLAs

CILO No.

Hours/week

Learning through teaching is primarily based on lectures.

1--6

39 hours in total

Learning through tutorials is primarily based on interactive problem solving allowing instant feedback.

 

 

1

2 hours

2

1 hour

3

1 hour

4

1 hour

5

2 hours

Learning through take-home assignments helps students understand basic concepts and techniques of discrete mathematics, and apply mathematical methods and analysis from discrete mathematics to some applications in computer sciences.

1--5

after-class

Learning through online examples for applications helps students set up simple mathematical models and apply to problems in computer sciences.

3, 5

after-class

Learning activities in Math Help Centre provides students extra help.

1--4

after-class

 

Assessment Tasks/Activities
(Indicative of likely activities and tasks designed to assess how well the students achieve the CILOs. Final details will be provided to students in their first week of attendance in this course)

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.

Assessment Tasks/Activities

CILO No.

Weighting (if applicable)

Remarks

Test

2, 3

15-30%

Questions are 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.

Hand-in assignments

1--5

0-15%

These are skills based assessment to enable students to demonstrate the basic concepts, techniques of discrete mathematics and some applications.

Examination

6

70%

Examination questions are designed to see how far students have achieved their intended learning outcomes. Questions will primarily be skills and understanding based to assess the student’s versatility in discrete mathematics.

Formative take-home assignments

1--5

0%

The assignments provide students chances to demonstrate their achievements on discrete mathematics learned in this course.

Grading of Student Achievement: Refer to Grading of Courses in the Academic Regulations

Part III

Keyword Syllabus
Propositional Logic. Predicate Calculus. Methods of Mathematical Proof. Sets. Functions. Relations. Castesian product. Combinatorics. Inclusion-Exclusion Principle. Recurrence Relations. Graphs. Directed Graphs. Connectivity. Weighted Graphs. Shortest Paths (Dijkstra’s Algorithm). Trees. Rooted Trees. Binary Trees. Spanning Trees.

Related Links
Department of Mathematics