Design and Analysis of Algorithms tuitions, online teachers, home tutors, coaching, tutions, project guidance

Online | Offline Teachers for Design and Analysis of Algorithms

Visit http://www.learninggeeks.info for Registration. 

Call us @ 9718322472, 9810333483 

Mail us for any queries: learninggeeks@gmail.com

Mathematical Preliminaries: Review of growth functions, Solution of difference equations.

Sorting and Order Statistics Merge sort, Heap sort, Quick sort, radix sort, bucket sort, median and order statistics.                                                                           

Advanced Data Structures Review of binary search trees, dynamic set operation,  red black trees, binomial heap.

Dynamic Programming Matrix multiplications, longest common subsequence and optimal polygon triangulation problems.                                                          

 

Greedy Algorithms: Activity selection, Huffman coding, and task scheduling problem.

Amortized Analysis Aggregate, accounting, and potential methods.                     

 

String Matching, Naïve String Matching, Rabin karp and KMP algorithms.

 

 

TEXT:

1.         T. H. Cormen, C. E. Leiserson, R. L. Rivest, Clifford Stein, “Introduction to Algorithms”, 2^nd Ed., PHI, 2004.

 

REFERENCES:

1.         A. V. Aho, J. E. Hopcroft, J. D. Ullman, “The Design and Analysis of Computer Algorithms”, Addition Wesley, 1998.

2.         Ellis Horowitz and Sartaz Sahani, “Computer Algorithms”, Galgotia Publications, 1999.

3.         D. E. Knuth, “The Art of Computer Programming”, 2^nd Ed., Addison Wesley, 1998

 

Posted via web from learninggeeks's posterous