Year of Study:	1-4
Credit Units:	3
Duration:	45hours
Prerequisites:	COM1102 Programming and Data Structures

This module provides students with basic knowledge in discrete mathematics and algorithm studies pertinent to computer science. Topics include logic, set theory, big-O notation, recurrence relations and induction, sorting and searching algorithms, algorithm design techniques and algorithms to problems related to graphs and trees.

Upon completion of this module, students should be able to:

• understand basic mathematical concepts which are fundamental to computer science, such as logic, sets, big-O notation, recurrence relations and induction;


• algorithm design techniques: divide-and-conquer and greedy method


• understand and analyze basic sorting and search algorithms;


• analyze and design algorithms to solve applications to be handled by trees and graphs