YCS935 ALGORITHM DESIGN TECHNIQUES SYLLABUS | ANNA UNIVERSITY BCA 3RD SEM SYLLABUS REGULATION 2010 2011 2012-2013 BELOW IS THE ANNA UNIVERSITY THIRD SEMESTER B.C.A. (BACHELOR OF COMPUTER APPLICATIONS) DEPARTMENT SYLLABUS, TEXTBOOKS, REFERENCE BOOKS,EXAM PORTIONS,QUESTION BANK,PREVIOUS YEAR QUESTION PAPERS,MODEL QUESTION PAPERS, CLASS NOTES, IMPORTANT 2 MARKS, 8 MARKS, 16 MARKS TOPICS. IT IS APPLICABLE FOR ALL STUDENTS ADMITTED IN THE YEAR 2011 2012-2013 (ANNA UNIVERSITY CHENNAI,TRICHY,MADURAI,TIRUNELVELI,COIMBATORE), 2010 REGULATION OF ANNA UNIVERSITY CHENNAI AND STUDENTS ADMITTED IN ANNA UNIVERSITY CHENNAI DURING 2010
YCS935 ALGORITHM DESIGN TECHNIQUES L T P C
3 0 0 3
UNIT I INTRODUCTION 9
Introduction – Notion of Algorithm - Fundamentals of algorithmic problem solving – Important
problem types – Fundamentals of the analysis of algorithm efficiency – analysis frame work –
Asymptotic notations – Mathematical analysis for recursive and non-recursive algorithms.
INIT II DIVIDE AND CONQUER METHOD AND GREEDY METHOD 9
Divide and conquer methodology – Merge sort – Quick sort – Binary search – Binary tree
traversal – Multiplication of large integers – Strassen’s matrix multiplication – Greedy method –
Prim’s algorithm – Kruskal’s algorithm – Dijkstra’s algorithm.
UNIT III DYNAMIC PROGRAMMING 9
Computing a binomial coefficient– Warshall’s and Floyd’ algorithm – Optimal binary search tree –
Knapsack problem – Memory functions.
UNIT IV BACKTRACKING AND BRANCH AND BOUND 9
Backtracking – N-Queens problem – Hamiltonian circuit problem – Subset sum problem –
Branch and bound – Assignment problem – Knapsack problem – Traveling salesman problem.
UNIT V NP-HARD AND NP-COMPLETE PROBLEMS 9
P & NP problems–NP-complete problems –Approximation algorithms for NP-hard problems –
Traveling salesman problem – Knapsack problem.
TOTAL : 45 PERIODAS
REFERENCES :
1. Anany Levitin “Introduction to the Design and Analysis of Algorithms” Pearson Education
2003.
2. Thomas H.Cormen, Charles E.Leiserson, Ronald L.Rivest, “Introduction to algorithms”
Prentice Hall 1990.
3. SaraBaase and Allen Van Gelder, “Computer Algorithms – Introduction to Design and
Analysis” Pearson education, 2003.
4. A.V.Aho, J.E Hopenfit and J.D.Ullman, “The Design and Analysis of Computer
algorithms” Pearson education Asia, 2003.
YCS935 ALGORITHM DESIGN TECHNIQUES L T P C
3 0 0 3
UNIT I INTRODUCTION 9
Introduction – Notion of Algorithm - Fundamentals of algorithmic problem solving – Important
problem types – Fundamentals of the analysis of algorithm efficiency – analysis frame work –
Asymptotic notations – Mathematical analysis for recursive and non-recursive algorithms.
INIT II DIVIDE AND CONQUER METHOD AND GREEDY METHOD 9
Divide and conquer methodology – Merge sort – Quick sort – Binary search – Binary tree
traversal – Multiplication of large integers – Strassen’s matrix multiplication – Greedy method –
Prim’s algorithm – Kruskal’s algorithm – Dijkstra’s algorithm.
UNIT III DYNAMIC PROGRAMMING 9
Computing a binomial coefficient– Warshall’s and Floyd’ algorithm – Optimal binary search tree –
Knapsack problem – Memory functions.
UNIT IV BACKTRACKING AND BRANCH AND BOUND 9
Backtracking – N-Queens problem – Hamiltonian circuit problem – Subset sum problem –
Branch and bound – Assignment problem – Knapsack problem – Traveling salesman problem.
UNIT V NP-HARD AND NP-COMPLETE PROBLEMS 9
P & NP problems–NP-complete problems –Approximation algorithms for NP-hard problems –
Traveling salesman problem – Knapsack problem.
TOTAL : 45 PERIODAS
REFERENCES :
1. Anany Levitin “Introduction to the Design and Analysis of Algorithms” Pearson Education
2003.
2. Thomas H.Cormen, Charles E.Leiserson, Ronald L.Rivest, “Introduction to algorithms”
Prentice Hall 1990.
3. SaraBaase and Allen Van Gelder, “Computer Algorithms – Introduction to Design and
Analysis” Pearson education, 2003.
4. A.V.Aho, J.E Hopenfit and J.D.Ullman, “The Design and Analysis of Computer
algorithms” Pearson education Asia, 2003.
No comments:
Post a Comment
Any doubt ??? Just throw it Here...