CSC 415 Analysis of Algorithms

3 Credit(s)

This course presents a variety of general algorithms in the computing field, examines the design and implementation techniques of useful and efficient algorithms, and analyzes algorithmic complexity. Topics include mathematical tools for algorithm analysis, numeric algorithms, tree structures, hashing techniques and recursion, analysis of searching and sorting algorithms, dynamic programming, graph representation and traversal algorithms, pattern matching, computation complexity, and computational geometry. Three lecture hours per week plus programming work outside the class.
Prerequisites: CSC260 and MAT214A.