|Undergraduate Course Details|
|Title||Analysis of Algorithms|
|Prerequisites||CSC260 and MAT214A|
Advanced concepts from data structures and general algorithms are discussed from both theoretical and applied viewpoints. Topics covered include multi lists, graph theory, searching and sorting algorithms, and general n-way tree structures. Techniques for analysis of algorithms for average and best/worst cases are presented. Laboratory work may involve programming in a high level language. Three lecture hours per week.