215. Algorithms
An introduction to the mathematical foundations, design, implementation and computational analysis of fundamental algorithms. Problems include heuristic searching, sorting, several graph theory problems, DNA string matching and the theoretical expression of their orders of growth. Out-of-class assignments and in-class labs emphasize the balance between theoretical hypotheses and experimental verification. C/C++, Java, Perl or Maple are applied to various solutions. Three hours of lecture and a two-hour laboratory per week.
(Mark D. LeBlanc, Lisa N. Michaud)
Connections:
Conx 20015 Genes in Context