CSCE 340 - Design and Analysis of Algorithms

4.00 credit hours

Design and analysis of algorithms. Classification of algorithms by time and space complexity. Algorithm design techniques such as divide and conquer, the greedy method and dynamic programming. NP-complete problems and approximation algorithms. Introduction to parallel algorithms.

Prerequisite(s): CSCE 210 and CSCE 230.

Click here for the schedule of classes.