Categories
Important question Notes question bank Question Paper R-2021 Syllabus

CS3401 Algorithms [PDF]

CS3401 Algorithms Study Materials

Anna University – CS3401 Algorithms Regulation 2021 Syllabus , Notes , Important Questions, Question Paper with Answers Previous Year Question Paper.

UNIT I INTRODUCTION CS3401 Algorithms Syllabus
Algorithm analysis: Time and space complexity – Asymptotic Notations and its properties Best case,
Worst case and average case analysis – Recurrence relation: substitution method – Lower bounds –
searching: linear search, binary search and Interpolation Search, Pattern search: The naïve stringmatching algorithm – Rabin-Karp algorithm – Knuth-Morris-Pratt algorithm. Sorting: Insertion sort –
heap sort

UNIT II GRAPH ALGORITHMS CS3401 Algorithms Notes
Graph algorithms: Representations of graphs – Graph traversal: DFS – BFS – applications – Connectivity,
strong connectivity, bi-connectivity – Minimum spanning tree: Kruskal’s and Prim’s algorithm- Shortest
path: Bellman-Ford algorithm – Dijkstra’s algorithm – Floyd-Warshall algorithm Network flow: Flow
networks – Ford-Fulkerson method – Matching: Maximum bipartite matching

UNIT III ALGORITHM DESIGN TECHNIQUES CS3401 Algorithms Important Questions
Divide and Conquer methodology: Finding maximum and minimum – Merge sort – Quick sort Dynamic
programming: Elements of dynamic programming — Matrix-chain multiplication – Multi stage graph —
Optimal Binary Search Trees. Greedy Technique: Elements of the greedy strategy – Activity-selection
problem –- Optimal Merge pattern — Huffman Trees.

UNIT IV STATE SPACE SEARCH ALGORITHMS CS3401 Algorithms Question Bank
Backtracking: n-Queens problem – Hamiltonian Circuit Problem – Subset Sum Problem – Graph
colouring problem Branch and Bound: Solving 15-Puzzle problem – Assignment problem – Knapsack
Problem – Travelling Salesman Problem

UNIT V NP-COMPLETE AND APPROXIMATION ALGORITHM CS3401 Algorithms Question Paper
Tractable and intractable problems: Polynomial time algorithms – Venn diagram representation – NPalgorithms – NP-hardness and NP-completeness – Bin Packing problem – Problem reduction: TSP – 3-CNF problem. Approximation Algorithms: TSP – Randomized Algorithms: concept and application
– primality testing – randomized quick sort – Finding kth smallest number

Syllabus Click Here
Notes Click Here
Important Questions Click Here
Previous Year Question Paper Click Here
Question Bank Click Here

TEXT BOOKS: CS3401 Algorithms Notes

1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to
Algorithms”, 3rd Edition, Prentice Hall of India, 2009.
2. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran “Computer Algorithms/C++” Orient
Blackswan, 2nd Edition, 2019.

REFERENCES: CS3401 Algorithms Important Questions

1. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, 3rd Edition, Pearson
Education, 2012.
2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, “Data Structures and Algorithms”, Reprint
Edition, Pearson Education, 2006.
3. S. Sridhar, “Design and Analysis of Algorithms”, Oxford university press, 2014.

Related Links

Anna University Syllabus Regulation 2021

Anna University Regulation 2021 Study Materials

Anna University Results

CGPA Calculator For Anna University

Download Padeepz App for Android

 

 

Leave a Reply

Your email address will not be published. Required fields are marked *