º«¹úÂãÎè

CCS2 500 Design of Efficient Algorithms (3 credits)

Note: This is the 2010–2011 edition of the eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or click here to jump to the newest eCalendar.

Offered by: Career & Professional Develop (School of Continuing Studies)

Administered by: School of Continuing Studies

Overview

Computer Science (CCE) : Basic elements of algorithms, time and space performance, optimization criteria and methods, as well as basic data structures (vectors, arrays, structures, lists, trees, stacks, queues), their characteristics, behaviour and applicability to different problem types. Illustrative examples chosen from standard computer problems such as searching, sorting and memory allocation.

Terms: Fall 2010

Instructors: Lau, Hang (Fall)

Back to top