Design and Analysis of Algorithms detail syllabus for Computer & Communication Engineering (C&C), 2017 regulation is taken from Anna University official website and presented for students of Anna University. The details of the course are: course code (CS8451), Category (ES), Contact Periods/week (3), Teaching hours/week (3), Practical Hours/week (0). The total course credits are given in combined syllabus.
For all other c&c 4th sem syllabus for be 2017 regulation anna univ you can visit C&C 4th Sem syllabus for BE 2017 regulation Anna Univ Subjects. The detail syllabus for design and analysis of algorithms is as follows.”
Course Objective:
- To understand and apply the algorithm analysis techniques.
- To critically analyze the efficiency of alternative algorithmic solutions for the same problem
- To understand different algorithm design techniques.
- To understand the limitations of Algorithmic power.
Unit I
For complete syllabus and results, class timetable and more pls download iStudy. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.
Unit II
Brute Force and Divide-And-Conquer
Brute Force – Computing an – String Matching – Closest-Pair and Convex-Hull Problems – Exhaustive Search – Travelling Salesman Problem – Knapsack Problem – Assignment problem.
Divide and Conquer Methodology – Binary Search – Merge sort – Quick sort – Heap Sort -Multiplication of Large Integers – Closest-Pair and Convex – Hull Problems.
Unit III
Dynamic Programming and Greedy Technique
Dynamic programming – Principle of optimality – Coin changing problem, Computing a Binomial Coefficient – Floyds algorithm – Multi stage graph – Optimal Binary Search Trees – Knapsack Problem and Memory functions.
Greedy Technique – Container loading problem – Prims algorithm and Kruskals Algorithm – 0/1 Knapsack problem, Optimal Merge pattern – Huffman Trees.
Unit IV
For complete syllabus and results, class timetable and more pls download iStudy. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.
Unit V
Coping With the Limitations of Algorithm Power
Lower – Bound Arguments – P, NP NP- Complete and NP Hard Problems. Backtracking – n-Queen problem – Hamiltonian Circuit Problem – Subset Sum Problem. Branch and Bound – LIFO Search and FIFO search – Assignment problem – Knapsack Problem – Travelling Salesman Problem -Approximation Algorithms for NP-Hard Problems – Travelling Salesman problem – Knapsack problem.
Course Outcome:
At the end of the course, the students 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 Books:
- Anany Levitin, Introduction to the Design and Analysis of Algorithms, Third Edition, Pearson Education, 2012.
- Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, Computer Algorithms/ C++, Second Edition, Universities Press, 2007.
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.
- Harsh Bhasin, Algorithms Design and Analysis, Oxford university press, 2016.
- S. Sridhar, Design and Analysis of Algorithms, Oxford university press, 2014.
- http://nptel.ac.in/
For detail syllabus of all other subjects of BE C&C, 2017 regulation do visit C&C 4th Sem syllabus for 2017 Regulation.
Dont forget to download iStudy for latest syllabus and results, class timetable and more.