Analysis of Algorithms CSE 4081, Fall 2011 Instructor : Debasis Mitra, Ph.D. Office : Harris 325 E-mail : dmitra ‘at’ cs.fit. edu Class Home Page : http://www.cs.fit . edu/~dmitra/Algorithms/ Office Hours : T/Th 2-4 pm Text : Thomas H. Cormen, Charles E. Leiserson, Ronnald L. Rivest, and Clifford Stein. Introduction to Algorithms , McGraw Hill, 2001, ISBN 0-262-03293-7 Reference: (1) Weiss, M. A., , Addison-Wesley, 1999, ISBN 0-201-35754-2. (2) Other online materials pointed to in the class FIT Catalog Course Description : Time and space complexity of computer algorithms. Algorithm classes, such as divide-and-conquer, greedy, dynamic programming and backtracking; techniques for solving recurrence equations; graph algorithms; searching and sorting; and deterministic and non-deterministic polynomial time problem classes. Course Objective : Designing algorithms in a resource sensitive way. Expectation is to learn some well-known techniques for developing algorithms by tracing specific input and by coding; classification of
This is the end of the preview. Sign up
access the rest of the document.
This note was uploaded on 02/10/2012 for the course CSE 5211 taught by Professor Dmitra during the Spring '12 term at FIT.