CMSC 351 - Sections 0301 and 0401 - Spring 2018
Introduction to Algorithms

Evan Golub (
Please put [351] in the subject.

Office Hours in AVW 1115, announced weekly


There are some questions that you should be able to answer "yes" to coming into this class.
   • Do you remember your basic logarithm properties and rules?
   • Do you remember how to manipulate summations?
   • Do you remember how to perform basic integration?
   • Do you remember how to formally prove something using induction?
If you cannot currently answer all of these questions with a confident "yes" then you should review your appropriate course notes (eg: CMSC 250, MATH 141) so that you can say "yes" by the first day or two of class. Take a look at this "YES" sheet for some examples.

If you are looking for some practice problems on logs and integration and induction, I've posted some overall practice problems as well as two specific to constructive induction (which we will recap in our first lecture section).

The optional book for this course is any edition of:
  Introduction to Algorithms
      by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest (and later with Clifford Stein).
Again, the edition doesn't matter (yes, they've made some changes and additions to the 3rd when compared to the 1st or 2nd but as a resource for our course, the 1st or 2nd edition would work fine). We will not be using the CD that comes with some bookstore versions so a used copy of just the text (off a site like Amazon where I've seen a number of copies under $25) is just fine.

[Back]Back to the Department of Computer Science Class Pages
construction sign with flashing lightThis page under development..... (but what on the Web isn't......)

Web Accessibility

TA Office Hours 
Topic Outlines