CSE 3500: Algorithms and Complexity
Time and place: Tu and Th 11:00AM-12:15PM. Room AUST-163
Instructor office hours: Tu 9:00AM-10:00AM (ITEB 359) or by appointment.
Prerequisites: CSE 2100 and CSE 2500
Textbook: The textbook for the course is "Introduction to Algorithms" (3rd edition) by T. Cormen, C. Leiserson, R. Rivest, and C. Stein, 2009. This may be supplemented by other material from various sources.
Grading: Grading will be based on 5 or 6 bi-weekly homework assignments (10%), two mid-term exams (25% + 25%) and a final exam (40%). All exams will be closed book. Final grading will be relative, but without any predetermined fraction of students per grade (so, for example, F's will only be assigned where warranted, not to some fixed fraction of students).
HuskyCT: We have a HuskyCT site for the class; you can access it by logging in with your NetID and password at https://lms.uconn.edu. Please check this site regularly for class materials, homework assignments, solutions, grades, assignment clarifications, changes in class schedule, and other class announcements.
Homework policy: Homework solutions can be either hand written clearly or printed/typed and must be turned in at the beginning of class on the due date (or earlier). Homework may be turned in up to two days late but at a penalty of 25% of the grade. Students are permitted to discuss general concepts, ideas and questions concerning the homework assignments, but sharing written solutions with others or using solutions provided by others (including those found on the internet), in part or in whole, is prohibited. You are encouraged to seek help from the instructor whenever needed. If you consult any sources other than the course notes or the textbook, you are required to cite the source in your homework and ensure that the submitted work is your own, i.e., written by you in your own words.
A detailed description of course policies is available on the HuskyCT site for this class.