Our first prelim takes place on Thursday, Feb 22, from 7:00-9:30PM in Upson B17
The exam includes material from lecture and from assigned reading up through Monday, Feb 19. See the Schedule for the sections of the text assigned for reading (this includes most of Chapters 1 through 6). Topics include Stable Matching, Basics of Algorithms Analysis, Graphs, Greedy Algorithms, Divide & Conquer, and Dynamic Programming.
The questions below are meant to help you study for the prelim. They will not be collected and they will not be graded. The lecture on Wednesday, Feb 21, is meant to be a review session; this would be a good time to ask about any of these review questions. You are also welcome to ask about these questions during any of the course office hours. The text has many more questions (some easier, some harder) that you are also welcome to ask about.