Algorithms

By:

Dasgupta, Sanjoy

Contributor(s):

Material type: Text

TextPublication details: Chennai McGraw Hill Education (India) Private Limited 2023Edition: Indian edDescription: x, 320p. pbkISBN:

9789355325525

Subject(s):

DDC classification:

518.1 DAS

Summary: Overview This textbook explains the fundamentals of algorithms in a story line that makes the text enjoyable and easy to digest. The emphasis is mostly placed on understanding the crisp mathematical idea behind each algorithm in a manner that is intuitive and rigorous without being unduly formal. An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. A chapter on the Quantum Algorithm for factoring has also been added that provides a unique peephole into this exciting topic. Pedagogical features, such as the use of the three series of separate boxes have been introduced in the book to strengthen its narrative. These pieces provide historical context, description of how the algorithms is used in practice, and excursions for the mathematically sophisticated. Key Features • The book is concise and realistic; with key Design Issues and rationales that clearly outline the problems to be solved. It shows how to develop appealing algorithms to achieve desired results. • Small book on Algorithms covering most of the topics in the area. • The book also covers interesting stories about the development of important algorithms and their current uses in the global information environment. Chapter 0: Prologue Chapter 1: Algorithms with Numbers Randomized Algorithms: A Virtual Chapter Chapter 2: Divide-And-Conquer Algorithms Chapter 3: Decompositions of Graphs Chapter 4: Paths in Graphs Chapter 5: Greedy Algorithms Chapter 6: Dynamic Programming Chapter 7: Linear Programming and Reductions Chapter 8: NP-Complete Problems Chapter 9: Coping With NP-Completeness Chapter 10: Quantum Algorithms Historical Notes & Further Reading Index

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Status	Date due	Barcode
Book	Plaksha University Library	Mathematics	518.1 DAS (Browse shelf(Opens below))	Available		004928
Book	Plaksha University Library	Mathematics	518.1 DAS (Browse shelf(Opens below))	Available		004929

Browsing Plaksha University Library shelves, Collection: Mathematics Close shelf browser (Hides shelf browser)

Previous								Next
Previous	518.0285 PRE Numerical recipes : the art of scientific computing	518.1 DAS Algorithms	518.1 DAS Algorithms	518.1 DAS Algorithms	519 PAP Probability, random variables, and stochastic processes	519 PAP Probability, random variables, and stochastic processes	519 PAP Probability, random variables, and stochastic processes	Next

https://www.mheducation.co.in/algorithms-9789355325525-india

Overview
This textbook explains the fundamentals of algorithms in a story line that makes the text enjoyable and easy to digest. The emphasis is mostly placed on understanding the crisp mathematical idea behind each algorithm in a manner that is intuitive and rigorous without being unduly formal. An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. A chapter on the Quantum Algorithm for factoring has also been added that provides a unique peephole into this exciting topic.

Pedagogical features, such as the use of the three series of separate boxes have been introduced in the book to strengthen its narrative. These pieces provide historical context, description of how the algorithms is used in practice, and excursions for the mathematically sophisticated.

Key Features
• The book is concise and realistic; with key Design Issues and rationales that clearly outline the problems to be solved. It shows how to develop appealing algorithms to achieve desired results.
• Small book on Algorithms covering most of the topics in the area.
• The book also covers interesting stories about the development of important algorithms and their current uses in the global information environment.

Chapter 0: Prologue
Chapter 1: Algorithms with Numbers
Randomized Algorithms: A Virtual Chapter
Chapter 2: Divide-And-Conquer Algorithms
Chapter 3: Decompositions of Graphs
Chapter 4: Paths in Graphs
Chapter 5: Greedy Algorithms
Chapter 6: Dynamic Programming
Chapter 7: Linear Programming and Reductions
Chapter 8: NP-Complete Problems
Chapter 9: Coping With NP-Completeness
Chapter 10: Quantum Algorithms
Historical Notes & Further Reading
Index

There are no comments on this title.

to post a comment.