Oct 26, 2020  
2020-2021 Catalog 
    
2020-2021 Catalog

CSCI140 HM - Algorithms


Credit(s): 3

Instructor(s): Boerkoel, Libeskind-Hadas, Monta​ñez, Schofield, Stone, Pippenger (Mathematics)

Offered: Fall and Spring

Description: 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. (Crosslisted as MATH168 HM )

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