WELCOME TO TECHNICAL PUBLICATIONS
You have no items in your shopping cart.
Close
Filters
Search

Decode Advanced Algorithms for JNTU-H 16 Course (IV - II -CSE - CS861PE)

SKU: 9789389750652
A. A. Puntambekar ISBN 9789389750652 Buy E-book Buy Kindle Edition Buy Printed Book
₹ 150.00
+ -

UNIT - I Introduction : Role of Algorithms in computing, Order Notation, Recurrences, Probabilistic Analysis and Randomized Algorithms. Sorting and Order Statistics: Heap sort, Quick sort and Sorting in Linear Time. Advanced Design and Analysis Techniques : Dynamic Programming- Matrix chain Multiplication, Longest common Subsequence and optimal binary Search trees. (Chapters - 1, 2) UNIT - II Greedy Algorithms - Huffman Codes, Activity Selection Problem. Amortized Analysis. Graph Algorithms : Topological Sorting, Minimum Spanning trees, Single Source Shortest Paths, Maximum Flow algorithms. (Chapters - 3, 4) UNIT - III Sorting Networks : Comparison Networks, Zero-one principle, bitonic Sorting Networks, Merging Network, Sorting Network. Matrix Operations - Strassen's Matrix Multiplication, inverting matrices, Solving system of linear Equations. (Chapters - 5, 6) UNIT - IV String Matching : Naive String Matching, Rabin-Karp algorithm, matching with finite Automata, Knuth- Morris - Pratt algorithm. (Chapter - 7) UNIT - V NP-Completeness and Approximation Algorithms : Polynomial time, polynomial time verification, NP-Completeness and reducibility, NP-Complete problems. Approximation Algorithms- Vertex cover Problem, Travelling Sales person problem. (Chapter - 8)

UNIT - I Introduction : Role of Algorithms in computing, Order Notation, Recurrences, Probabilistic Analysis and Randomized Algorithms. Sorting and Order Statistics: Heap sort, Quick sort and Sorting in Linear Time. Advanced Design and Analysis Techniques : Dynamic Programming- Matrix chain Multiplication, Longest common Subsequence and optimal binary Search trees. (Chapters - 1, 2) UNIT - II Greedy Algorithms - Huffman Codes, Activity Selection Problem. Amortized Analysis. Graph Algorithms : Topological Sorting, Minimum Spanning trees, Single Source Shortest Paths, Maximum Flow algorithms. (Chapters - 3, 4) UNIT - III Sorting Networks : Comparison Networks, Zero-one principle, bitonic Sorting Networks, Merging Network, Sorting Network. Matrix Operations - Strassen's Matrix Multiplication, inverting matrices, Solving system of linear Equations. (Chapters - 5, 6) UNIT - IV String Matching : Naive String Matching, Rabin-Karp algorithm, matching with finite Automata, Knuth- Morris - Pratt algorithm. (Chapter - 7) UNIT - V NP-Completeness and Approximation Algorithms : Polynomial time, polynomial time verification, NP-Completeness and reducibility, NP-Complete problems. Approximation Algorithms- Vertex cover Problem, Travelling Sales person problem. (Chapter - 8)

Write your own review
  • Only registered users can write reviews
  • Bad
  • Excellent