This course presents the fundamental techniques for designing efficient computer algorithms, proving their correctness, and analyzing their running times. Text T. Cormen, C. Leiserson, R. Rivest, Introduction to Algorithms . Prerequisites CMSC 214 and CMSC 251. Homeworks Homeworks will be due in the middle of the class on the due date. Late homewroks will NOT be accepted .
All homeworks are in postscript format.
See the section below on postscript for information on printing and viewing. All class work is to be done independently. You may discuss homework problems but you must hand in your own work. As a courtesy to the grader, homeworks should be written neatly . You will lose points for sloppiness .