Difference between revisions of "ISC-4221"

Line 1: Line 1:
 
== Discrete Algorithms in  Scientific Computing==
 
== Discrete Algorithms in  Scientific Computing==
[[File:feynman_quote.png|left|top]]
+
[[File:feynman_quote.png|right|top]]
 
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.
 
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.
  

Revision as of 10:07, 23 August 2013

Discrete Algorithms in Scientific Computing

Feynman quote.png

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.