TCS 503 : DESIGN & ANALYSIS OF ALGORITHMS BOOKS & REFERENCES
>>Send ur suggestion to Mynotes Tab
Unit -I
Introduction: Algorithms, analysis of algorithms, Growth of Functions,
Master's Theorem, Designing of Algorithms. Sorting and order Statistics:
Heap sort, Quick sort, Sorting in Linear time, Medians and Order Statistics.
Unit -II
Advanced Data Structure: Red-Black Trees, Augmenting Data Structure. B-
Trees, Binomial Heaps, Fibonacci Heaps, Data Stricture for Disjoint Sets.
Unit -III
Advanced Design and Analysis Techniques: Dynamic Programming,
Greedy Algorithms, Amortized Analysis, Back Tracking.
Unit -IV
Graph Algorithms: Elementary Graphs Algorithms, Minimum Spanning Trees,
Single-source Shortest Paths, All-Pairs Shortest Paths, Maximum Flow, and
Traveling Salesman Problem.
Unit -V
Selected Topics: Randomized Algorithms, String Matching, NP Completeness,
Approximation Algorithms.
References:
2. Basse, "Computer Algorithms: Introduction to Design & Analysis",
Addision Wesley.
3. Horowitz & Sahani, "Fundamental of Computer Algorithm", Galgotia.
