SCS 341 - Algorithms Analysis (Computer Science)

3 Credit(s)

Introduction to the design and analysis of computer algorithms. Topics include fundamental algorithms, mathematical tools for analyzing algorithms, and strategies for designing algorithms. Fundamental algorithms include graph algorithms and algorithms for sorting, searching, hashing, integer arithmetic, and selected combinatorial tasks. Mathematical tools include asymptotic notations and methods for solving recurrences. Algorithm design strategies include scanning, greedy method, divide and conquer, dynamic programming, and randomization. Prerequisites: SCS 220, SCS 290 and SMA 130. Fall semester, odd-numbered years.