In this introduction to Fortran 90 and its later updates we will be looking at what exactly it is that makes Fortran still such a good choice today, as well as how to get started with it.

It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) .

Dr. Rader currently focuses his research in the areas of nonlinear 0-1 optimization, computational integer programming, and exam time timetabling.

Instructors of a new self-paced version of Introduction to Computer Programming found that three weeks before the end of classes, about half of the students enrolled were halfway through the course ...