Difference between revisions of "ISC-4221"

Line 3: Line 3:
 
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 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.
  
'''Project presentations are on Wednesday December 11 2013 at 12:30-2:30'''
+
'''Project presentations are on<br>
 +
Wednesday December 11 2013 at 12:30-2:30'''
  
  

Revision as of 12:59, 5 December 2013

Discrete Algorithms in Scientific Computing

Feynman quote.png

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.

Project presentations are on
Wednesday December 11 2013 at 12:30-2:30