Study Abroad Summer Session MyYSS

Algorithms

You are here

Course Number: 
S365
Department (unused): 
ECON
Description: 
<p>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.&#160;<em>For college students and beyond.&#160;</em>1 Credit. Session B: July 1 – August 2. Tuition: $5070.</p>
Instructor Name: 
Dylan McKay
Subject Code (deprecated): 
ECON
Subject Number (unused): 
ECONS365
Meeting Pattern (deprecated): 
MWF 10.00-12.15
Term Code: 
202402
CRN: 
30945
Instructor UPI (unused): 
24902020
Session (deprecated): 
H5B
Distributional Designation (deprecated): 
LMIP
Subject Code (tax): 
Meeting Pattern (tax): 
Distributional Designation (tax): 
Session (tax): 
Course Format (tax): 
Prioritize: 

ECON S365 (CRN: 30945)

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.


Apply Now Back to course search