CMSC641 Design and Analysis of Algorithms

Description:

Fundamental Algorithms, mathematical tools for analyzing algorithms, and strategies for designing algorithms. Topics include graph algorithms, parallel algorithms and algorithms for sorting, searching, and for selected combinatorial tasks. Tools include asymptotic notations, recurrences, and amortized analysis. Strategies include divide-and-conquer, greedy, dynamic programming, and randomization. Introduction to NP-completeness.

Course location (fall '94): Rm SS209

Meeting times (fall '94): MW 5:30-6:45pm

Instructor (fall '94): Dr. Samuel Lomonaco

office hours: MW 3:00-4:00pm and 6:45-.. pm
office: ECS 225K
phone: (410) 455-2338
Email: lomonaco@cs.umbc.edu

Teaching Assistant (fall '94): Vasileios Megalooikonomou

office hours: MW 3:00-4:00pm
office: ECS 233C
phone: (410) 455-2667
Email: megaloik@cs.umbc.edu

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

Exam I (25%): Mon, Oct. 31
Exam II (25%): Mon, Dec. 5
Final (25%):
Homeworks (15%)
Project (10%)

Homeworks (fall '94):

   HW1 (ps, txt) 
   HW2 (ps, txt)
   HW3 (ps, txt) 
   HW4 (ps, txt)
   HW5 (ps, txt)
    IMPORTANT NOTICE ABOUT HW5!!