CS 5350 - Advanced Algorithms
The purpose of this course is to present the student with the mathematical techniques used for analyzing the time and space performance of computer algorithms. The focus will be on the practical application of these techniques to designing efficient algorithms. The following topics will be covered: asymptotic notation, recurrences, lower bounds for worst case and average case, dynamic programming, searching algorithms, sorting algorithms, graph algorithms, and if time allows, parallel algorithms, string matching algorithms.
"Introduction to Algorithms'', by Cormen, Leiserson, Rivest and Stein, Second Edition, McGraw Hilll, 2001.
Chapters 1-9, 12, 15, 16 ,22, 23 will be covered. As time allows, we will cover 2 or 3 other chapters.
Exams and Grades:
There will be two tests, written assignments, a project and a presentation. The project will involve programmin some algorithms and doing some analysis on their performance. For the presentation, individual will present an algorithm research paper from a journal or conference, preferably recent.
Test 1 20%
Test 2 20%
Programming project 20%
Professor: Luc Longpre
Office: 227 CS Building
e-mail: longpre @ utep . edu
Office Hours: Tu-Th 1:15-2:45, or by appointment