Difference between revisions of "ISC-4221"
Peter Beerli (talk | contribs) |
Peter Beerli (talk | contribs) |
||
| Line 7: | Line 7: | ||
* [[Syllabus for ISC-4221]] | * [[Syllabus for ISC-4221]] | ||
| + | * [[Schedule]] | ||
* [[Class notes and slides]] | * [[Class notes and slides]] | ||
* [[Homework for ISC-4221]] | * [[Homework for ISC-4221]] | ||
* [[Lab assignments for ISC-4221]] | * [[Lab assignments for ISC-4221]] | ||
* [[Resources]] | * [[Resources]] | ||
Revision as of 10:05, 26 August 2013
Discrete Algorithms in Scientific Computing
In this coure we are mainly interested in problems of a discrete nature such as searching for a text string, sorting a list of objects, finding the optimal path between cities, finding the point from a list which is closest to a given point, simulating a random process, etc.
