Algorithms

Algorithms

CPSC S3650 (CRN: 30051)

Instructors: Dylan McKay
Dates: Session B, June 29 - July 31, 2026
Course Mode: In-Person
Meeting Times: M-F 10.00-11.15, TTh 1.00-2.00
Distributional Requirements: Quantitative Reasoning
Eligibility: Open to college students only

Course cancelled. 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. For 2026, this course will count toward the economics major senior requirement, as the equivalent of an ECON course numbered 4400-4491. Prerequisite: CPSC 2230 and CPSC 2020 (or equivalent course- ex. MATH 2440). For college students and beyond. 1 Credit. Session B: June 29 – July 31. Tuition: $5480.

Apply Now Back to Course Search