CMSC441 Analysis of Algorithms


Fundamental Algorithms, mathematical tools for analyzing algorithms, and strategies for designing algorithms. Topics include graph algorithms, algorithms for sorting, searching, and for selected combinatorial tasks. Tools include asymptotic notations, recurrences. Strategies include divide-and-conquer, greedy, dynamic programming.

Course location (fall '95): Rm ACIV 151

Meeting times (fall '95): TuTh 1:00 - 2:15pm

Instructor (fall '95): Dr. Samuel Lomonaco

Teaching Assistant (fall '95): Vasileios Megalooikonomou


Course activities with their relative weights and dates (fall '95):

Course grade = sum of highest 3 scores (from E1, E2, F, Prj/HW) divided by 3

Homeworks (fall '95):

   HW1 (due Sept. 14): p.18 Problem 1-3