|
CS2150 Mathematical Foundations for Computing
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
|