May 12, 2024  
2020-2021 Undergraduate Catalog 
    
Catalog Navigation
  Catalog Home
  Message from the President
  University Calendar
  About the University
  Admissions
  General Education: The Human Community
  Degrees Offered
  Colleges
  Academic Departments
  Programs of Study
  Course Descriptions
  Academic Policies and Procedures
  Student Services and Learning Resources
  University and Post-Graduate Resources
  Tuition and Fees
  Financial Aid, Scholarships and Student Employment
  University Faculty
  Publishing Statement
  Your Right To Know
  Non-Discrimination Statement
  Archived Catalogs
HELP
2020-2021 Undergraduate Catalog [ARCHIVED CATALOG]

CS 452. Design and Analysis of Algorithms

3.00
Crosslisted with MATH 452  

An introduction to algorithm design techniques and the mathematical analysis of algorithms. Techniques covered include divide-and-conquer, greedy, backtracking, network flow and dynamic programming. The classes P and NP are introduced and intractable problems discussed. This is a proof intensive course. Students may not receive credit for both CS 412 and CS 452. Prerequisite: CS 327. Discrete Structures II A grade of “C-” or better in CS 327.