|
Design & Analysis of Efficient Algorithms |
|
Instructor: Eustrat Zhupa Lecture time: TR 9:40 - 10:55 Classroom: Gavett 206 |
Course Description
This course covers greedy algorithms, dynamic programming, divide-and-conquer
techniques, string processing, graph algorithms, mathematical algorithms.
Introduction to NP-completeness and linear programming is also included.
+ Syllabus
- Syllabus here
Schedule
See schedule on BB.
+ General Rules
Disability Services
- The University of Rochester respects and welcomes students of all backgrounds and abil- ities. In the event you encounter any barrier(s) to full participation in this course due to the impact of disability, please contact the Office of Disability Resources. The access coor- dinators in the Office of Disability Resources can meet with you to discuss the barriers you are experiencing and explain the eligibility process for establishing academic accommoda- tions. You can reach the Office of Disability Resources at: disability@rochester.edu; (585) 276-5075; Taylor Hall.
- After you receive accommodation approval, it is imperative that you reach out to the in- structor for the appropriate arrangements.