Nov 23, 2024  
2016-2017 Catalog 
    
2016-2017 Catalog [ARCHIVED PUBLICATION] Use the dropdown above to select the current catalog.

CSCI140 HM - Algorithms


Credit(s): 3

Boerkoel, Libeskind-Hadas, Stone, Pippenger (Mathematics). Algorithm design, analysis, and correctness. Design techniques including divide-and-conquer and dynamic programming. Analysis techniques including solutions to recurrence relations and amortization. Correctness techniques including invariants and inductive proofs. Applications including sorting and searching, graph theoretic problems such as shortest path and network flow, and topics selected from arithmetic circuits, parallel algorithms, computational geometry, and oth­ers. An introduction to computational complexity, NP-completeness, and approximation algorithms. Proficiency with programming is expected as some assignments require algorithm implementation. (Fall and Spring) (Crosslisted as MATH168 HM )

Prerequisite(s): MATH055 HM  and ((CSCI070 HM ; CSCI081 HM  recommended) or ((CSCI060 HM  or CSCI042 HM ) and MATH131 HM ))