CPSC S365 (CRN: 30208)
Instructors: Dylan McKay
Dates: Session B, June 30 - August 1, 2025
Course Mode: In-Person
Meeting Times: M-F 10.00-11.15, TTh 1.00-2.00
Distributional Requirements: Quantitative Reasoning
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: June 30 – August 1. Tuition: $5270.