CS 280 - Algorithm Development

3 credit hours - This course aims to accomplish three key objectives. The first is to introduce students to various algorithms used to solve computational problems. The second is to dive deep into sorting techniques, graph algorithms, dynamic programming algorithms, text processing algorithms, P and NP algorithms, etc., to comprehend their efficiency in solving computational problems. Finally, it will teach students to conduct comparative algorithmic analysis, enabling them to make informed decisions when selecting the most suitable algorithms for specific applications. Prerequisite(s): “C” or higher in CS 270 and CS 274.