COMP 317 Algorithms Analysis
We study algorithms from the point of view of efficiency and complexity. Having studied data structures, we now see how to apply algorithms to these structures to optimize their effectiveness. We examine algorithms in terms of time and memory allocation considerations. We will apply this background to a subset of the most important algorithms used in the sciences, various media, and business. We will study effective algorithm design, and give a brief introduction to computational complexity and computability, as well as parallel processing. Selected topics and applications from graph theory, linear algebra, numerical analysis, data compression, encryption, and large-scale problems from Mathematics and the sciences.
Sub-field: THEORY