Outlaine of Algorithm Design & Analysis Course

Prerequisite courses: 

• CSE 201 (Data Structure) 
• CSE 107 (Computer Programming)/ CSE 207 (Object Oriented Programming

Course Objectives: Computer algorithms are the building blocks in computer programming. This course will give students a comprehensive introduction of common data structures, algorithm design and analysis. Unlike programs, algorithms are not dependent on a particular programming language, machine, system, or compiler. They are mathematical entities, which can be thought of as running on some sort of idealized computer with an infinite random access memory and an unlimited word size. Algorithm design is all about the mathematical theory behind the design of good programs. It makes familiar with fundamental algorithms, algorithmic techniques and analyze the running time of a given algorithm.

Course Content:  Technique for analysis algorithms, methods for the design of efficient algorithms: divide and conquer greedy method, dynamic programming, backtracking, branch and bound. Basic search and traversal techniques, graph theory, algebraic simplification and transformation, Lower bound theory, NP-hard and NP-complete problems.
Outline of the Course:  Download (.doc) or download (.pdf)

Reference Books:

• Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran, “Fundamentals of Computer Algorithm”. 
• Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, "Introduction To Algorithms", Second Edition.