Career and Professional Developement

School of Continuing Studies

CCS2 500 : Design of Efficient Algorithms

Course Description

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 will be chosen from standard computer problems such as searching, sorting, and memory allocation.

Prerequisites

NONE

This Course Is Not Offered During Winter 2014 Term
This Course Is Not Offered During Spring/Summer 2014 Term
The tentative timetable is not yet available for the Fall 2014 Term