YIT938 ALGORITHMS DESIGN LAB 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
YIT938 ALGORITHMS DESIGN LABORATORY L T P C
0 0 3 2
1. Apply the divide and Conquer technique to arrange a set of numbers using merge sort
method.
2. Perform Strassen’s matrix multiplication using divide and conquer method.
3. Solve the knapsack problem using greedy method.
4. Construct a minimum spanning tree using greedy method.
5. Construct optimal binary search trees using dynamic programming method of problem
solving.
6. Find the solution for traveling salesperson problem using dynamic programming
approach.
7. Perform graph traversals.
8. Implement the 8-Queens Problem using backtracking.
9. Implement knapsack problem using backtracking.
10. Find the solution of traveling salesperson problem using backtracking
TOTAL: 45 PERIODS
YIT938 ALGORITHMS DESIGN LABORATORY L T P C
0 0 3 2
1. Apply the divide and Conquer technique to arrange a set of numbers using merge sort
method.
2. Perform Strassen’s matrix multiplication using divide and conquer method.
3. Solve the knapsack problem using greedy method.
4. Construct a minimum spanning tree using greedy method.
5. Construct optimal binary search trees using dynamic programming method of problem
solving.
6. Find the solution for traveling salesperson problem using dynamic programming
approach.
7. Perform graph traversals.
8. Implement the 8-Queens Problem using backtracking.
9. Implement knapsack problem using backtracking.
10. Find the solution of traveling salesperson problem using backtracking
TOTAL: 45 PERIODS
No comments:
Post a Comment
Any doubt ??? Just throw it Here...