CMSC441 Analysis of Algorithms
Description:
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
- office hours: TuTh 2:15 - 2:45pm & 5:15-.. pm
- office: ECS 225K
- phone: (410) 455-2338
- Email: lomonaco@cs.umbc.edu
Teaching Assistant (fall '95):
Vasileios Megalooikonomou
- office hours: TuTh 3:00-4:00pm
- office: ECS 233C
- phone: (410) 455-2667
- Email: megaloik@cs.umbc.edu
Syllabus:
- Cormen et al: Chaps 1-14, 16, 22-26
Course activities with their relative weights and dates (fall '95):
- Exam I (1/3): Th, Oct. 19
- Exam II (1/3): Th, Nov. 30
- Final (1/3): Th, Dec. 14, 1:00 - 3:00pm
- Project + HWs (1/3)
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