Design and Analysis Of Algorithms Syllabus for B.Tech 4th sem is covered here. This gives the details about credits, number of hours and other details along with reference books for the course.
The detailed syllabus for Design and Analysis Of Algorithms B.Tech (R13) fourthsem is as follows
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 hours)
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 hours)
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 hours)
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.
Download iStudy Android App for complete Anna University syllabus, results, timetables and all other updates. There are no ads and no pdfs and will make your life way easier.
[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:
- Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, Third Edition, Pearson Education, 2012.
REFERENCES:
- Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to Algorithms”, Third Edition, PHI Learning Private Limited, 2012.
- Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, “Data Structures and Algorithms”, Pearson Education, Reprint 2006.
- Donald E. Knuth, “The Art of Computer Programming”, Volumes 1& 3 Pearson Education, 2009.
Steven S. Skiena, “The Algorithm Design Manual”, Second Edition, Springer, 2008. - http://nptel.ac.in/
For all other B.Tech IT 4th sem syllabus go to Anna University B.Tech Information Technology (IT) 4th Sem Course Structure for (R13) Batch.All details and yearly new syllabus will be updated here time to time.
Do share with friends and in case of questions please feel free drop a comment.