Online Tuitons 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.
BOOKS:
. T. H. Cormen, C. E. Leiserson, R. L. Rivest, Clifford Stein, “Introduction to Algorithms”, 2nd Ed., PHI, 2004.
. A. V. Aho, J. E. Hopcroft, J. D. Ullman, “The Design and Analysis of Computer Algorithms”, Addition Wesley, 1998.
. Ellis Horowitz and Sartaz Sahani, “Computer Algorithms”, Galgotia Publications, 1999.
. D. E. Knuth, “The Art of Computer Programming”, 2nd Ed., Addison Wesley, 1998
Design and Analysis of Algorithms, Design and Analysis of Algorithms Tutions, Design and Analysis of Algorithms Tuitions,Design and Analysis of Algorithms Teachers, Design and Analysis of Algorithms Tutors, Design and Analysis of Algorithms Tution, Design and Analysis of Algorithms Tuition, Design and Analysis of Algorithms Tutor, Design and Analysis of Algorithms Teacher
No comments:
Post a Comment