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

DECODE-Design & Analysis of Algorithms

DECODE ISBN-9789333206389
10% Discount
₹ 140.00
₹ 126.00
+ -

1. Introduction
Algorithms, Analyzing algorithms, Complexity of algorithms, Growth of functions, Performance measurements, Sorting and order statistics - Shell sort, Quick sort, Merge sort, Heap sort, Comparison of sorting algorithms, Sorting in linear time. (Chapter - 1)
2. Advanced Data Structures
Red-black trees, B-trees, Binomial heaps, Fibonacci heaps. (Chapter - 2)
3.
Divide and conquer with examples such as sorting, Matrix multiplication, Convex hull and searching.
Greedy methods with examples such as optimal reliability allocation, Knapsack, Minimum spanning trees - Prim's and Kruskal's algorithms, Single source shortest paths - Dijkstra's and Bellman Ford algorithms. (Chapters - 3, 4)
4.
Dynamic programming with examples such as Knapsack.
All pair shortest paths - Warshal's and Floyd's algorithms, Resource allocation problem.
Backtracking, Branch and bound with examples such as travelling salesman problem, Graph coloring, n-Queen problem, Hamiltonian cycles and sum of subsets. (Chapters - 5, 6)
5. Selected Topics
Algebraic computation, Fast Fourier transform, String matching, Theory of NP-completeness, Approximation algorithms and randomized algorithms. (Chapter - 7)

 

1. Introduction
Algorithms, Analyzing algorithms, Complexity of algorithms, Growth of functions, Performance measurements, Sorting and order statistics - Shell sort, Quick sort, Merge sort, Heap sort, Comparison of sorting algorithms, Sorting in linear time. (Chapter - 1)
2. Advanced Data Structures
Red-black trees, B-trees, Binomial heaps, Fibonacci heaps. (Chapter - 2)
3.
Divide and conquer with examples such as sorting, Matrix multiplication, Convex hull and searching.
Greedy methods with examples such as optimal reliability allocation, Knapsack, Minimum spanning trees - Prim's and Kruskal's algorithms, Single source shortest paths - Dijkstra's and Bellman Ford algorithms. (Chapters - 3, 4)
4.
Dynamic programming with examples such as Knapsack.
All pair shortest paths - Warshal's and Floyd's algorithms, Resource allocation problem.
Backtracking, Branch and bound with examples such as travelling salesman problem, Graph coloring, n-Queen problem, Hamiltonian cycles and sum of subsets. (Chapters - 5, 6)
5. Selected Topics
Algebraic computation, Fast Fourier transform, String matching, Theory of NP-completeness, Approximation algorithms and randomized algorithms. (Chapter - 7)

 

Write your own review
  • Only registered users can write reviews
  • Bad
  • Excellent
Customers who bought this item also bought

DECODE-Principles of Programming Languages

A. A. Puntambekar ISBN-9789333219488
10% Discount
₹ 99.00 ₹ 110.00

DECODE -Database Management System

Prof. Seema V. Kedar ISBN-9789333206488
10% Discount
₹ 126.00 ₹ 140.00

DECODE-Cyber Security

Vandana Gupta ISBN-9789333206228
10% Discount
₹ 86.00 ₹ 95.00

DECODE- Managerial Economics

V. S. Bagad ISBN-9789333220194
10% Discount
₹ 68.00 ₹ 75.00