**CSE 5500: Advanced Sequential and Parallel Algorithms**

Spring 2015

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

**Time and place:** Tu and Th 12:30PM-1:45PM. E2-322.

**Office Hours:** Mo and Th 2:30PM-3:30PM (ITEB 359) or by appointment.

### 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 amortized analysis, network flows, NP-Completeness, approximation algorithms, and, if time permits, some basics of parallel algorithms. Please note that the focus of this course will be on regular sequential algorithms, not on parallel algorithms as the course title might suggest.

**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 (30%), one mid-term exam (25%) and a final exam (45%). All exams will be closed book.

**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, 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.

*Last updated on January 17, 2015*