Design and Analysis of Algorithms : A Contemporary Perspective / by Sandeep Sen and Amit Kumar. [Electronic Resource]
Material type: Computer filePublication details: Cambridge : Cambridge University Press, 2019Description: xxvi, 367pISBN:- 9781108654937
- 005.1Â Se55D
Item type | Home library | Collection | Call number | Status | Notes | Date due | Barcode | Item holds | |
---|---|---|---|---|---|---|---|---|---|
e-Book | S. R. Ranganathan Learning Hub Online | Textbook | 005.1 Se55D (Browse shelf(Opens below)) | Available (e-Book For Access) | Platform : Cambridge Core | EB0396 |
Browsing S. R. Ranganathan Learning Hub shelves, Shelving location: Online, Collection: Textbook Close shelf browser (Hides shelf browser)
004.65 P442C Computer Networks : A Systems Approach | 005.1 B737A Advanced Data Structures | 005.1 G563P P, NP and NP - Completeness : The Basics of Computational Complexity | 005.1 Se55D Design and Analysis of Algorithms : A Contemporary Perspective | 005.1 So55S Software Engineering | 005.117 L978L Learning Python : Powerful Object-Oriented Programming. | 005.117 M597L Learning UML 2.0 |
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.