# CS6402 Design and Analysis of Algorithms Previous Year Question Papers

CS6402 Design and Analysis of Algorithms Previous Year Question Papers

B.E – Computer Science and Engineering, Second Year 4th Semester CS6402 Design and Analysis of Algorithms Previous Year Question Papers For The Regulation 2013.

(Note:  This Is The Only Site, Where You Can Download The Previous Year Anna University Question Papers In PDF Format With Good Quality And With Out Any Water Marks.

You Can Download The Files In A Single Click & No More Re-directs )

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

The 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

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

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.

UNIT IV- ITERATIVE IMPROVEMENT

The Simplex Method-The Maximum-Flow Problem – Maximum Matching in Bipartite Graphs- The Stable Marriage Problem.

UNIT V- COPING WITH THE LIMITATIONS OF ALGORITHM POWER

Limitations of Algorithm Power-Lower-Bound Arguments-Decision Trees-P, NP and NP-Complete Problems–Coping with the Limitations – Backtracking – n-Queens problem – Hamiltonian Circuit Problem – Subset Sum Problem-Branch and Bound – Assignment problem – Knapsack Problem – Traveling Salesman Problem- Approximation Algorithms for NP-Hard Problems – Traveling Salesman problem – Knapsack problem.

## CS6402 Design and Analysis of Algorithms Previous Year Question Papers for the Regulation 2013

Related searches: anna university, anna university examinations, anna university previous year question papers, question papers download, regulation 2013, BE Computer Science and Engineering, 2nd year, 4th semester, pdf format, question bank, CSE questions, Nov/Dec 2017, Apr/May 2017,  Nov/Dec 2016, May/June 2016, Nov/Dec 2015, Apr/May 2015, CS6402, Design and Analysis of Algorithms,