CCS2 500 : Design of Efficient Algorithms
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.
|This Course Is Not Offered During Fall 2016 Term|
|This Course Is Not Offered During Winter 2017 Term|
|The tentative timetable is not yet available for the Spring/Summer 2017 Term|
|The tentative timetable is not yet available for the Fall 2017 Term|