ECON S365 (CRN: 30945)
Dates: H5B
Course Mode: LMIP, SUCR, YCQR
Meeting Times: MWF 10.00-12.15
Distributional Requirements: LMIP, SUCR, YCQR
In-person Course. Paradigms for algorithmic problem solving: greedy algorithms, divide and conquer, dynamic programming, and network flow. NP completeness and approximation algorithms for NP-complete problems. Algorithms for problems from economics, scheduling, network design and navigation, geometry, biology, and optimization. This course provides algorithmic background essential to further study of computer science. Prerequisite: CPSC S202 or equivalent and CPSC S223. For college students and beyond. 1 Credit. Session B: July 1 – August 2. Tuition: $5070. (View syllabus)