Difference between revisions of "ISC-4221"
Peter Beerli (talk | contribs) (Created page with "* Syllabus for ISC-4221 * Homework for ISC-4221 * Lab assignments for ISC-4221 * Resources") |
Peter Beerli (talk | contribs) |
||
| Line 1: | Line 1: | ||
| + | In Algorithms II 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. | ||
| + | |||
* [[Syllabus for ISC-4221]] | * [[Syllabus for ISC-4221]] | ||
* [[Homework for ISC-4221]] | * [[Homework for ISC-4221]] | ||
* [[Lab assignments for ISC-4221]] | * [[Lab assignments for ISC-4221]] | ||
* [[Resources]] | * [[Resources]] | ||
| + | [[File:feynman_quote.jpg|right|top]] | ||
Revision as of 09:55, 23 August 2013
In Algorithms II 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.
