CS2150 Mathematical Foundations for Computing

Course Aims & Objectives:
This course provides the basic concepts of discrete mathematics essential to the understanding of mathematics for computer science. On the completion of the course, students should have an understanding the various mathematical concepts such as formal mathematical reasoning, applied to computer science.

Units: 3

Level: B2

Medium of Instruction: English

Keyword Syllabus:
Basic counting techniques and graph theory; mathematical logic and Boolean algebra; sets, relations and functions such as injections, surjections and bijections; mathematical logic, method of proof, permutations and combinations; inclusion principle; recurrence relations.

Teaching Pattern:
Duration of course: 1 semester
Current mix of lecture/tutorial/laboratory, other: 2 hrs. lecture; 1 hr. Tutorial.

Assessment Pattern:
Examination duration: 2 hours
Percentage distribution of marks for coursework, examination, other: 30% CW, 70% Exam
Grading pattern: Standard (A+AA-...F)
For a student to pass the course, at least 30% of the maximum mark for the examination must be obtained.

Pre-requisite(s): Nil

Pre-cursor(s): Nil

Equivalent Course(s): Nil

Related Links
Department of Compter Science