Professional Documents
Culture Documents
Course Description:
This course provides elementary introduction to algorithm design and analysis.it include the topics:
mathematics foundation, divided-and-conquer, dynamic programming, greedy methods, NP-completeness
complexity, approximation algorithms, randomized algorithm etc. At the end of this course student should
be able to understand the concepts and skills of algorithm design, implemental some well-known
algorithms and analyze the performance of algorithms.
Scope & Objective:
Theobjective of this course is.
Existing algorithm and Develop efficient algorithms for simple computational tasks.
Reasoning about the correctness of the algorithm.
Behaviors of Algorithms and the notion of tractable and intractable problems.
Text Books:
T1 Thomas H. Coreman, Charles E. Leiserson and Ronald L. Rivest, Introduction
to Algorithms, Printice Hall of India.
Reference Books:
R1 RCT Lee, SS Tseng, RC Chang and YT Tsai, Introduction to the Design and analysis
of Algorithms, Mc Graw Hill, 2005.
R2 E. Horowitz & S Sahni, "Fundamentals of Computer Algorithms",
R3 Berman, Paul, Algorithms, Cengage Learning.
R4 Aho, Hopcraft, Ullman, The Design and Analysis of Computer Algorithms Pearson
Education, 2008
Course Plan:
Evaluation Scheme:
Mode of Evaluation: Quiz/Assignment/ Seminar/Written Examination
Theory Laboratory
Components Internal* SEE Internal SEE Theory and
Marks 50 50 50 50 laboratory
Total Marks 100 100
Scaled Marks 75 25 100
Make-up Policy: Make-up is granted only for genuine cases with valid justification and
prior permission from the Dean/Program Chair.
(S. P. S. Chauhan)
Instructor-in-charge