ISC-4221

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.