Yes, you can do it.
--Your friends at LectureNotes

Note for Design And Analysis Of Algorithm - DAA By Sandip Sahu

  • Design And Analysis Of Algorithm - DAA
  • Note
  • Master of Computer Applications
  • 21 Topics
  • 205 Offline Downloads
  • Uploaded 1 year ago
0 User(s)
Download PDFOrder Printed Copy

Share it with your friends

Leave your Comments

Text from page-1

DESIGN AND ANALYSIS OF ALGORITHMS G. Appasami, M.Sc., M.C.A., M.Phil., M.Tech., (Ph.D.) Assistant Professor Department of Computer Science and Engineering Dr. Paul’s Engineering Collage Pauls Nagar, Villupuram Tamilnadu, India SARUMATHI PUBLICATIONS Villupuram, Tamilnadu, India

Text from page-2

First Edition: July 2015 Second Edition: April 2016 Published By SARUMATHI PUBLICATIONS © All rights reserved. No part of this publication can be reproduced or stored in any form or by means of photocopy, recording or otherwise without the prior written permission of the author. Price Rs. 101/- Copies can be had from SARUMATHI PUBLICATIONS Villupuram, Tamilnadu, India. Sarumathi.publications@gmail.com Printed at Meenam Offset Pondicherry – 605001, India

Text from page-3

CS6402 DESIGN AND ANALYSIS OF ALGORITHMS LTPC 3003 OBJECTIVES: The student should be made to: Learn the algorithm analysis techniques. Become familiar with the different algorithm design techniques. Understand the limitations of Algorithm power. UNIT I INTRODUCTION 9 Notion of an Algorithm – Fundamentals of Algorithmic Problem Solving – Important Problem Types – Fundamentals of the Analysis of Algorithm Efficiency – Analysis Framework – Asymptotic Notations and its properties – Mathematical analysis for Recursive and Non-recursive algorithms. UNIT II BRUTE FORCE AND DIVIDE-AND-CONQUER 9 Brute Force - Closest-Pair and Convex-Hull Problems-Exhaustive Search - Traveling Salesman Problem - Knapsack Problem - Assignment problem. Divide and conquer methodology – Merge sort – Quick sort – Binary search – Multiplication of Large Integers – Strassen’s Matrix Multiplication-Closest-Pair and Convex-Hull Problems. UNIT III DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE 9 Computing a Binomial Coefficient – Warshall’s and Floyd’ algorithm – Optimal Binary Search Trees – Knapsack Problem and Memory functions. Greedy Technique– Prim’s algorithm- Kruskal's Algorithm-Dijkstra's Algorithm-Huffman Trees. UNIT IV ITERATIVE IMPROVEMENT 9 The Simplex Method-The Maximum-Flow Problem – Maximmm Matching in Bipartite Graphs- The Stable marriage Problem. UNIT V COPING WITH THE LIMITATIONS OF ALGORITHM POWER 9 Limitations of Algorithm Power-Lower-Bound Arguments-Decision Trees-P, NP and NPComplete Problems--Coping with the Limitations - Backtracking – n-Queens problem – Hamiltonian Circuit Problem – Subset Sum Problem-Branch and Bound – Assignment problem – Knapsack Problem – Traveling Salesman Problem- Approximation Algorithms for NP – Hard Problems – Traveling Salesman problem – Knapsack problem. TOTAL: 45 PERIODS OUTCOMES: At the end of the course, the student should be able to: Design algorithms for various computing problems. Analyze the time and space complexity of algorithms. Critically analyze the different algorithm design techniques for a given problem. Modify existing algorithms to improve efficiency. TEXT BOOK: 1. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, Third Edition, Pearson Education, 2012. REFERENCES: 1. Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to Algorithms”, Third Edition, PHI Learning Private Limited, 2012. 2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, “Data Structures and Algorithms”, Pearson Education, Reprint 2006. 3. Donald E. Knuth, “The Art of Computer Programming”, Volumes 1& 3 Pearson Education, 2009. 4. Steven S. Skiena, “The Algorithm Design Manual”, Second Edition, Springer, 2008. 5. http://nptel.ac.in/

Text from page-4

Acknowledgement I am very much grateful to the management of paul’s educational trust, Respected principal Dr. Y. R. M. Rao, M.E., Ph.D., cherished Dean Dr. E. Mariappane, M.E., Ph.D., and helpful Head of the department Mr. M. G. Lavakumar M.E., (Ph.D.). I thank my colleagues and friends for their cooperation and their support in my career venture. I thank my parents and family members for their valuable support in completion of the book successfully. I express my special thanks to SARUMATHI PUBLICATIONS for their continued cooperation in shaping the work. Suggestions and comments to improve the text are very much solicitated. Mr. G. Appasami

Lecture Notes