This is an introductory course about algorithms. Our goal is to introduce the basic concepts used to design and analyze algorithm. It is assumed that you are comfortable with mathematical proofs before you take this class. We will often use ideas like proofs by contradiction, and proofs by induction. Visit the schedule tab for a list of topics and course resources. See student feedback about the previous offering.
There will be weekly homework (40%), a midterm (25%), and a final (35%). The exams will be held in class. You may discuss solutions to the homework problems with your classmates, but you should write all solutions by yourself.
We meet in SIG 134 for lectures. Open zoom to use the chat window during lecture. Lectures are MWF from 1:30-2:20. Lectures will be recorded and posted on the schedule page.