Econ 365b. Algorithms

Time: 
12:43pm
Day / time: 
T/Th 2:30 - 3:45 pm
Course Type: 
Undergraduate
Course term: 
Spring
Visiting Instructor(s): 
James Glenn

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. Provides algorithmic background essential to further study of computer science. Either CPSC 365 or CPSC 366 may be taken for credit.

: CPSC 202 and 223.

[also CPSC365]

Semester offered: 
Spring
Undergrad Course Category: 
Macroeconomics
Methodology
Course Description: 
Course Description