Difference between revisions of "ISC-4221"
Peter Beerli (talk | contribs) |
Peter Beerli (talk | contribs) |
||
| Line 8: | Line 8: | ||
Wednesday December 11 2013 at 12:30-2:30'''<br> | Wednesday December 11 2013 at 12:30-2:30'''<br> | ||
The project consists of the presentation and a short PDF document that gives a short introduction to the project, the methods you used, results, a short discussion, and references to used materials/papers, package also the computer code as a zip file, email the presentation, PDF, and zip file to me. --> | The project consists of the presentation and a short PDF document that gives a short introduction to the project, the methods you used, results, a short discussion, and references to used materials/papers, package also the computer code as a zip file, email the presentation, PDF, and zip file to me. --> | ||
| + | <br> | ||
| + | <br> | ||
<br> | <br> | ||
<br> | <br> | ||
Latest revision as of 05:18, 26 August 2014
Discrete Algorithms in Scientific Computing
In this course 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.
