CS 5350 - Advanced Algorithms
A review of mathematical techniques for analysis of computer algorithms, techniques for design of efficient algorithms, description and analysis of both well-established and recently developed algorithms.
Asymptotic notation, recurrences, lower bonds for
worst case and average case, dynamic programming, greedy algorithms,
searching algorithms, sorting algorithms, graph algorithms,
and 2 or 3 more topics selected from the rest of the textbook.
"Introduction to Algorithms'', by Cormen, Leiserson, Rivest and Stein, Third Edition, The MIT Press, 2009.
Chapters 1-9, 12, 15, 16 ,22, 23 will be covered. In addition, we will cover 1, 2 or 3 other chapters, depending on remaining time.
Exams and Grades:
There will be two tests, written assignments, a project and a presentation. The project will involve programming 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 Longpré
Office: 3.0420 CCS
e-mail: longpre @ utep . edu
Office Hours: MW 2:00-3:00, or by appointment (instructions at faculty.utep.edu/longpre)