[PDF] CS3401 Algorithms (ALG) Books, Lecture Notes, 2 marks with answers, Important Part B 16 Marks Questions, Question Bank & Syllabus

Download CS3401 Algorithms (ALG) Books Lecture Notes Syllabus Part-A 2 marks with answers CS3401 Algorithms Important Part-B 16 marks Questions, PDF Books, Question Bank with answers Key, CS3401 Algorithms Syllabus & Anna University CS3401 Algorithms Question Papers Collection.

Download link is provided for Students to download the Anna University CS3401 Algorithms Syllabus Question Bank Lecture Notes Part A 2 marks with answers & Part B 16 marks Question Bank with answer, Anna University Question Paper Collection, All the materials are listed below for the students to make use of it and get good (maximum) marks with our study materials.

“CS3401 Algorithms Notes, Lecture Notes, Previous Years Question Papers “

“CS3401 Algorithms Important 16 marks Questions with Answers”

“CS3401 Algorithms Important 2 marks & 16 marks Questions with Answers”

“CS3401 Algorithms Important Part A & Part B Questions”

“CS3401 Algorithms Syllabus, Local Author Books, Question Banks”

You all must have this kind of questions in your mind. Below article will solve this puzzle of yours. Just take a look and download the study materials for your preparation.

CS3401 Algorithms (ALG) Notes Part A & Part B Important Questions with AnswersCS3401 Algorithms

CS3401 Algorithms – Study Materials – Details

Semester 04
Department Computer Science and Engineering (CSE)
Year Second Year (II Year)
Regulation R2021
Subject Code / Name CS3401 Algorithms (ALG)
Content Syllabus, Question Banks, Local Authors Books, Lecture Notes, Important Part A 2 Marks Questions and Important Part B 16 Mark Questions, Previous Years Anna University Question Papers Collections.
Material Format PDF (Free Download)

CS3401 Algorithms (ALG) “R2021 – SYLLABUS”

CS3401 ALGORITHMS

UNIT I INTRODUCTION

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 string-matching algorithm – Rabin-Karp algorithm – Knuth-Morris-Pratt algorithm. Sorting: Insertion sort – heap sort

UNIT II GRAPH ALGORITHMS

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

See also  [PDF] MA3354 Discrete Mathematics (DM) Books, Lecture Notes, 2 marks with answers, Important Part B 16 Marks Questions, Question Bank & Syllabus

UNIT III ALGORITHM DESIGN TECHNIQUES

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

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

Tractable and intractable problems: Polynomial time algorithms – Venn diagram representation – NP-algorithms – 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

PRACTICAL EXERCISES: 30 PERIODS

Searching and Sorting Algorithms

1. Implement Linear Search. Determine the time required to search for an element. Repeat the experiment for different values of n, the number of elements in the list to be searched and plot a graph of the time taken versus n.

2. Implement recursive Binary Search. Determine the time required to search an element. Repeat the experiment for different values of n, the number of elements in the list to be searched and plot a graph of the time taken versus n.

 

3. Given a text txt [0…n-1] and a pattern pat [0…m-1], write a function search (char pat [ ], char txt [ ]) that prints all occurrences of pat [ ] in txt [ ]. You may assume that n > m.

 

4. Sort a given set of elements using the Insertion sort and Heap sort methods and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n.

See also  [PDF] EE3303 Electrical Machines - I (EM-I) Books, Lecture Notes, 2 marks with answers, Important Part B 16 Marks Questions, Question Bank & Syllabus

Graph Algorithms

1. Develop a program to implement graph traversal using Breadth First Search

2. Develop a program to implement graph traversal using Depth First Search

3. From a given vertex in a weighted connected graph, develop a program to find the shortest paths to other vertices using Dijkstra’s algorithm.

4. Find the minimum cost spanning tree of a given undirected graph using Prim’s algorithm.

5. Implement Floyd’s algorithm for the All-Pairs- Shortest-Paths problem.

6. Compute the transitive closure of a given directed graph using Warshall’s algorithm.

Algorithm Design Techniques

1. Develop a program to find out the maximum and minimum numbers in a given list of n numbers using the divide and conquer technique.

2. Implement Merge sort and Quick sort methods to sort an array of elements and determine the time required to sort. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n.

State Space Search Algorithms

1. Implement N Queens problem using Backtracking.

Approximation Algorithms Randomized Algorithms

1. Implement any scheme to find the optimal solution for the Traveling Salesperson problem and then solve the same problem instance using any approximation algorithm and determine the error in the approximation.

2. Implement randomized algorithms for finding the kth smallest number. The programs can be implemented in C/C++/JAVA/ Python.

TEXT BOOKS:

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:

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.

DOWNLOAD LINK

Anna University CS3401 Algorithms Books Question Banks Lecture Notes Syllabus CS3401 Algorithms Part A 2 Marks with Answers Part – B 16 Marks Questions with Answers & Anna University CS3401 Algorithms Question Paper Collection and Local Author Books.

Click below the link “DOWNLOAD” to save the Book/Material (PDF)

See also  [PDF] CY3151 Engineering Chemistry (CHE) Books, Lecture Notes, 2 marks with answers, Important Part B 16 Marks Questions, Question Bank & Syllabus

Kindly Note : There are different collection of CS3401 Algorithms study materials are listed below. Based on your requirement choose the suitable material for your preparation.

Lecture Notes

CS3401 Algorithms Lecture Notes

  • CS3401 Lecture Notes Collection 01 – DOWNLOAD

  • CS3401 Lecture Notes Collection 02 – DOWNLOAD

  • CS3401 Lecture Notes Collection 03 – DOWNLOAD

Part A – 2 Marks

CS3401 Algorithms Unit wise 2 marks Question with Answers

  • CS3401 Important Question Collection – DOWNLOAD

Part B – 16 Marks & Student Notes

CS3401 Algorithms Unit wise 2 Marks, 16 Marks Questions with Answers

  • CS3401 Student Notes Collection 01 – DOWNLOAD

  • CS3401 Student Notes Collection 02 – DOWNLOAD

  • CS3401 Student Notes Collection 03 – DOWNLOAD


We need Your Support, Kindly Share this Web Page with Other Friends

If you have any Engineering study materials with you kindly share it through Contact Us Form, It will be useful to other friends & We Will Publish The Book/Materials Submitted By You Immediately Including The Book/Materials Credits (Your Name) Soon After We Receive It (If The Book/Materials Is Not Posted Already By Us)

If You Think This Materials Is Useful, Kindly Share it.

Useful LinkAnna University Useful Links
    • Click Here To Check Anna University Recent Updates. 
    • Click Here To Download Anna University UG/ PG Regulation 2021 Syllabus.
    • Click Here To Check Anna University Results

Useful LinkOther Useful Links

    • Click Here To Download Other Semester Civil Engineering R2021Study Material.
    • Click Here To Download Other Semester CSE R2021Study Material.
    • Click Here To Download Other Semester ECE R2021Study Material.
    • Click Here To Download Other Semester EEE R2021Study Material.
    • Click Here To Download Other Semester Mechanical Engineering R2021Study Material.
    • Click Here To Download Department Wise R2017 & R2013 Study Materials.
    • Click Here To Download GATE Exam Study Materials.

Thank you for visiting my thread. Hope this post is helpful to you. Have a great day !

Kindly share this post with your friends to make this exclusive release more useful.

LEAVE A REPLY

Please enter your comment!
Please enter your name here