JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

Course Objective

The student can able to attain knowledge in advanced algorithms.

Course Outcomes

The student can able to analyze the performance of algorithms

List of Experiments

• 1. Implement assignment problem using Brute Force method
• 2. Perform multiplication of long integers using divide and conquer method.
• 3. Implement a solution for the knapsack problem using the Greedy method.
• 4. Implement Gaussian elimination method.
• 5. Implement LU decomposition
• 6. Implement Warshall algorithm
• 7. Implement the Rabin Karp algorithm.
• 8. Implement the KMP algorithm.
• 9. Implement Harspool algorithm
• 10. Implement max-flow problem.

TEXT BOOK:

• 1. Design and Analysis of Algorithms, S.Sridhar, OXFORD University Press

REFERENCES:

• 1. Introduction to Algorithms, second edition, T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, PHI Pvt. Ltd./ Pearson Education.
• 2. Fundamentals of Computer Algorithms, Ellis Horowitz, Satraj Sahni and Rajasekharam, Universities Press.
• 3. Design and Analysis of algorithms, Aho, Ullman and Hopcroft, Pearson education.