Design and analysis of algorithms a contemporary perspective/ Sandeep Sen
Material type: TextPublication details: United Kingdom : Cambridge University Press , 2019.Description: xxvi, 367 pages : figures ; 25 cmContent type:- text
- unmediated
- volume
- 9781108721998
- 005.1 Se551d
- QA9.58 .S454
Item type | Current library | Shelving location | Call number | Copy number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|
Books | Main Library-Nabua | Engineering Section | ENG 005.1 Se551d 2019 (Browse shelf(Opens below)) | 1-1 | Available | 023436 |
Includes index,
Includes bibliography pages (351-362).
The text covers important algorithm design techniques, such as greedy algorithms, dynamic programming, and divide-and-conquer, and gives applications to contemporary problems. Techniques including Fast Fourier transform, KMP algorithm for string matching, CYK algorithm for context free parsing and gradient descent for convex function minimization are discussed in detail. The book's emphasis is on computational models and their effect on algorithm design. It gives insights into algorithm design techniques in parallel, streaming and memory hierarchy computational models. The book also emphasizes the role of randomization in algorithm design, and gives numerous applications ranging from data-structures such as skip-lists to dimensionality reduction methods.
There are no comments on this title.