Algorithms detailed syllabus for Computer Science & Engineering (CSE) for 2021 regulation curriculum has been taken from the Anna University official website and presented for the CSE students. For course code, course name, number of credits for a course and other scheme related information, do visit full semester subjects post given below.
For Computer Science & Engineering 4th Sem scheme and its subjects, do visit CSE 4th Sem 2021 regulation scheme. The detailed syllabus of algorithms is as follows.
Course Objectives:
Download the iStudy App for all syllabus and other updates.
Unit I
INTRODUCTION 9 Algorithm analysis: Time and space complexity – Asymptotic Notations and its properties Best case, Worst case and average case analysis – Recurrence relation: substitution method – Lower bounds -searching: linear search, binary search and Interpolation Search, Pattern search: The naive stringmatching algorithm – Rabin-Karp algorithm – Knuth-Morris-Pratt algorithm. Sorting: Insertion sort -heap sort
Unit II
Download the iStudy App for all syllabus and other updates.
Unit III
ALGORITHM DESIGN TECHNIQUES 9 Divide and Conquer methodology: Finding maximum and minimum – Merge sort – Quick sort Dynamic programming: Elements of dynamic programming Matrix-chain multiplication – Multi stage graph Optimal Binary Search Trees. Greedy Technique: Elements of the greedy strategy – Activity-selection problem Optimal Merge pattern Huffman Trees.
Unit IV
Download the iStudy App for all syllabus and other updates.
Unit V
NP-COMPLETE AND APPROXIMATION ALGORITHM 9 Tractable and intractable problems: Polynomial time algorithms – Venn diagram representation – NP-algorithms – NP-hardness and NP-completeness – Bin Packing problem – Problem reduction: TSP – 3- CNF problem. Approximation Algorithms: TSP – Randomized Algorithms: concept and application – primality testing – randomized quick sort – Finding kth smallest number
Practical Exercises:
Download the iStudy App for all syllabus and other updates.
Course Outcomes:
At the end of this course, the students will be able to:
- Analyze the efficiency of algorithms using various frameworks
- Apply graph algorithms to solve problems and analyze their efficiency.
- Make use of algorithm design techniques like divide and conquer, dynamic programming and greedy techniques to solve problems
- Use the state space tree method for solving problems.
- Solve problems using approximation algorithms and randomized algorithms
Text Books:
- Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to Algorithms”, 3rd Edition, Prentice Hall of India, 2009.
- Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran Computer Algorithms/C++ Orient Blackswan, 2nd Edition, 2019.
Reference Books:
Download the iStudy App for all syllabus and other updates.
For detailed syllabus of all other subjects of Computer Science & Engineering, 2021 regulation curriculum do visit CSE 4th Sem subject syllabuses for 2021 regulation.
For all Computer Science & Engineering results, visit Anna University CSE all semester results direct link.