prerequisite for this course is CSE 101 or its equivalent. You should have undergraduate exposure to discrete mathematics and algorithms and their analysis. At the beginning of the class, I expect you to be very familiar with the material in Chapters 1-3 of the text book (which will not be covered in the class), and somewhat familiar with Chapters 4-5 (which will be covered very rapidly.) We will very briefly review topics from your undergraduate algorithms courses, and then look at some more advanced topics.