Quick Links

University Papers | University Syllabus | Entrance Exam |

PSU Papers | Bank Papers | Placement Papers |

VTU | Anna Univerity Syllabus | Anna Univerity Papers |

**Anna University**

**Question Paper Code : 20369**

**B.E/B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2018.**

**Fourth**

**Semester**

**Computer Science and Engineering**

**CS6402 Design and Analysis of Algorithms**

**(****Common to****Information Technology )****( Regulation 2013 )**

**Download PDF**

**For More 1st Year Question Papers**

**For More Question paper of CSE**

**For More Question paper of IT**

**Books:**

Anna university all semester examination books and study material can be accessed through below link. Feel free search for different subject books and authors. The link will provide both local and foreign author books for references. Share the page with friends and college students as required.

**GATE:**

GATE papers can be a good practice for any competitive technical exams like DRDO, ISRO, REC, BEL, BHEL, GAIL, ONGC, IOC, NTPC, NHPC etc. As candidates we can prepare for GATE exams and try solving the papers for getting good score in other entrance examinations.

CS6402 Design and Analysis of Algorithms Syllabus

UNIT I INTRODUCTION

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 Design and Analysis of Algorithms Syllabus

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 CS6402 Syllabus

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 Design and Analysis of Algorithms Syllabus

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

UNIT V COPING WITH THE LIMITATIONS OF ALGORITHM POWER CS6402 Syllabus

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.

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 Design and Analysis of Algorithms Syllabus

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 CS6402 Syllabus

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 Design and Analysis of Algorithms Syllabus

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

UNIT V COPING WITH THE LIMITATIONS OF ALGORITHM POWER CS6402 Syllabus

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.

## 0 Comments