MCA-209 Analysis and Design of Algorithm- Syllabus and Lecture Notes

Are you doing MCA under Anna University ? Want to download Syllabus and Lecture notes of MCA-209 Analysis and Design of Algorithm ? You can get them here.

Syllabus of MCA-209 Analysis and Design of Algorithm

MCA-209 Analysis and Design of Algorithm L-T-P: 3-1-0
Prerequisite: Familiarity with Discrete Mathematical Structures, and Data Structures.

UNIT I: (10 Hours)
Algorithms and Complexity: Asymptotic notations, orders, worst-case and average-case, amortized complexity.
Basic Techniques: divide & conquer, dynamic programming, greedy method, backtracking.

UNIT II: (10 Hours)
Branch and bound, randomization.
Data Structures: heaps, search trees, union-find problems.
Applications: sorting & searching, combinatorial problems.

UNIT III: (10 Hours)
Optimization problems, computational geometric problems, string matching. Graph Algorithms: BFS and DFS, connected components.

UNIT IV: (10 Hours)
Spanning trees, shortest paths, MAX-flow.
NP- completeness, Approximation algorithms.

Text Book:
1. Introduction to Algorithms, 2/e ,T.H.Cormen,C.E.Leiserson, R.L.Rivest and C.Stein, PHI Pvt. Ltd. / Pearson Education

Reference Books:
1. Algorithm Design: Foundations, Analysis and Internet examples, M.T.Goodrich and R.Tomassia, John Wiley and sons.
2. Fundamentals of Computer Algorithms, Ellis Horowitz, Satraj Sahni and Rajasekharam, Galgotia Publications Pvt. Ltd.

Course outcomes:
1. To be able to analyze correctness and the running time of the basic algorithms for those classic problems in various domains and to be able to apply the algorithms and design techniques for advanced data structures.
2. To be able to analyze the complexities of various problems in different domains. And to be able to demonstrate how the algorithms are used in different problem domains.
3. To be able to design efficient algorithms using standard algorithm design techniques and demonstrate a number of standard algorithms for problems in fundamental areas in computer science and engineering such as sorting, searching and problems involving graphs.

The lecture notes are given in word format. You can download it here under, The following contents have been included in this lecture notes...

Module I
Algorithms and Complexity…………………………………………………………..3
Basic Techniques……………………………………………………………………..8
Module II
Branch and bound………………………………………………………..………….14
Data Structures………………………………………………………………………18
Sorting & Searching………………………………………………………….……...26
Module III
Optimization problems………………………………………………………………28
Computational geometric problems…………………………………………………28
String matching...........................................................................................................33
Graph Algorithms……………………………………………………………………37
Module IV
Spanning trees……………………………………………………………………….43
Max-flow……………………………………………………………….…………….46
NP – completeness……………...................................................................................48