MRP: ₹495
₹424
₹ 71 Off
(Incl. of all taxes)
Qty
Buying in bulk?
In stock
Deliver to
- 7-day returns
- Secure payment
- International shipping
- Carefully packed
Get this at ₹ 403Extra 5% OffAdd items worth ₹999 to the cart & get extra 5% off
Get this at ₹ 382Extra 10% OffAdd items worth ₹1499 to the cart & get extra 10% off
Book Summary
About the Book: Design and Analysis of Algorithoms
This edition is structured to cover the key aspects of the subject design and
analysis of algorithms in 5 units which are further divided into 31 chapters.
The edition gives in-depth understanding of important topics likealgorithms,
asymptotic notations, growth of function, recurrences, sorting in polynomial
time, sorting in linear time, advanced data structure, advanced design and
analysis techniques, graph algorithms, string matching, randomized algorithms,
np-completeness and reduction, approximation algorithms, FFT and sorting
network. The edition would serve as an extremely useful text for B.Tech (CS/IT),
M.Tech and MCA students, teachers, researchers and professionals and covers
revised syllabus of all
- ISBN-13
- 9789389124361
- Language
- English
- Binding
- Paper Back
- Publisher
- Global Academic Publishers and distributors
- Publishing Date
- 2019
- Total Pages
- 540
Design and Analysis of Algorithoms
by Kaushal Kishor Rastogi (Author),
Global Academic Publishers and distributors (Publisher)
fictionfantasyyoung adultaward winning
Frequently bought together
Total for 3 items₹550₹635You save ₹85
Product Specifications
Book Summary
About the Book: Design and Analysis of Algorithoms
This edition is structured to cover the key aspects of the subject design and
analysis of algorithms in 5 units which are further divided into 31 chapters.
The edition gives in-depth understanding of important topics likealgorithms,
asymptotic notations, growth of function, recurrences, sorting in polynomial
time, sorting in linear time, advanced data structure, advanced design and
analysis techniques, graph algorithms, string matching, randomized algorithms,
np-completeness and reduction, approximation algorithms, FFT and sorting
network. The edition would serve as an extremely useful text for B.Tech (CS/IT),
M.Tech and MCA students, teachers, researchers and professionals and covers
revised syllabus of all
Book Specifications
- ISBN-13
- 9789389124361
- Language
- English
- Binding
- Paper Back
- Publisher
- Global Academic Publishers and distributors
- Publishing Date
- 2019
- Total Pages
- 540