Course Objective:

The aim of this module is to learn how to develop efficient algorithms for simple computational tasks and reasoning about the correctness of them. Through the complexity measures, different range of behaviors of algorithms and the notion of tractable and intractable problems will be understood.

Course Outcome:

CO1:   Prove the correctness and analyzes the running time of   the basic algorithms

            of those  classic problems in various domains;

CO2: Applies the algorithms and design techniques to solve problems;

CO3: Analyzes the complexities of various problems in different domains.

CO4: Discusses various advanced topics on algorithms

Prerequisites:

Knowledge of programming languages like C,C++ and data structure.

References:

Books:

• H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, “Introduction to Algorithms”
• Aho, J.Hopcroft and J.Ullman “The Design and Analysis of Algorithms” D.E.Knuth “The Art of Computer Programming”, Vol. 3

   9.Hardware and Software requirements

Hardware

• Computer Systems                   : 60/30
• RAM                                         : 1 GB
• PROCESSOR                            : INTEL DUAL CORE 2.0
• HARD DISK                              : 160 GB

Software

• gcc compiler