Sep 20, 2020  
2019-2020 Undergraduate Catalog 
    
2019-2020 Undergraduate Catalog [ARCHIVED CATALOG]

CS 3720 Design and Analysis Algorithms


An introduction to the concepts, methodologies, and constructive models for formulating algorithms. Use of analytic techniques to determine the relative efficiency of algorithms with respect to several measures such as time and space complexity. Later topics introduce alternate models of computation such as probabilistic algorithms, parallel processing, and complexity classes (such as NP). Course offered Fall and Spring Semesters. Prerequisite(s): CS 3420  AND MATH 3240 
Credits: 3.0