CSE 5500: Algorithms

Fall 2017


Instructor: Mukul Bansal, ITEB 359, mukul.bansal@uconn.edu

Time and place: Mo, We, and Fr 1:25PM-2:15PM. AUST-163.

Office Hours: Fr 10AM-11AM, or by appointment

Grader: TBA


Course Description

This is a graduate level course designed to introduce students to some advanced topics in the design and analysis of algorithms. Topics covered in this course include network flows, NP-Completeness, fixed-parameter tractability, and approximation algorithms.

Prerequisites: Undergraduate level algorithms course (CSE 3500 or equivalent)

Textbook: We will use the book "Algorithm Design" by Kleinberg and Tardos (Addison-Wesley; 1st edition; 2005). This will be supplemented by other material from various sources.

Grading: Grading will be based on 5 or 6 bi-weekly homework assignments (20%), one mid-term exam (30%) and a final exam (50%). All exams will be closed book.

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.

Course policies: Homework solutions can be either hand written 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 and questions concerning the homework assignments, but sharing 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 written in your own words.


Last updated on Aug 25, 2017