Mar 11, 2025  
2023-2024 Undergraduate Catalog 
    
2023-2024 Undergraduate Catalog [ARCHIVED BULLETIN]

CS 342 - Algorithms and Complexity


3 credit(s)
This course is an introduction to the design and analysis of computer algorithms. Topics will include concepts of algorithm complexity; various algorithmic design patterns like divide and conquer, dynamic programming and greedy algorithms; worst-case and average-case analysis; and NP-complete problems.
Prerequisite(s): CS 220P  (minimum grade of C) and M 221W  (minimum grade of C).
Laboratory fee.


Click here for Fall 2024 course scheduling information.

Click here for Spring 2025 course scheduling information.