Difference between revisions of "ISC-4221"

 
(5 intermediate revisions by the same user not shown)
Line 1: Line 1:
 
== Discrete Algorithms in  Scientific Computing==
 
== Discrete Algorithms in  Scientific Computing==
 
[[File:feynman_quote.png|left|top]]
 
[[File:feynman_quote.png|left|top]]
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.
+
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.
  
 +
 +
<br>
 +
<!-- '''Project presentations are on<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. -->
 +
<br>
 +
<br>
 +
<br>
 
<br>
 
<br>
'''Project presentations are on<br>
 
Wednesday December 11 2013 at 12:30-2:30'''
 
[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.
 
 
 
* [[Syllabus for ISC-4221]]
 
* [[Syllabus for ISC-4221]]
 
* [[Schedule]]
 
* [[Schedule]]

Latest revision as of 06:18, 26 August 2014

Discrete Algorithms in Scientific Computing

Feynman quote.png

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.