Ã山ǿ¼é

CCS2 500 Design of Efficient Algorithms (3 credits)

Note: This is the 2011–2012 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)

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: This course is not scheduled for the 2011-2012 academic year.

Instructors: There are no professors associated with this course for the 2011-2012 academic year.

Back to top