Design and analysis of algorithms : an indian adaptation

By:

Goodrich, Michael T

Contributor(s):

Material type: Text

TextPublication details: New Delhi Wiley India Pvt Ltd 2021Description: xxi, 302pISBN:

9789354248481 (pbk.)

Subject(s):

DDC classification:

005.1 GOO

Summary: Design and Analysis of Algorithms offers an exhaustive coverage of the design and analysis of algorithms and data structures. Integrating application with theory, the book presents algorithmic topics in a context that is motivated from applications to uses in society, computer games, computing industry, science, engineering, and the Internet. Beginning with the basic framework and tools needed to analyze algorithms, the book then presents fundamental data structures, such as stacks, queues, lists, and advanced data structures such as trees, search trees, priority queues, heaps, hash tables, union-find structures, and graphs.

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	Computer science	005.1 GOO (Browse shelf(Opens below))	Available		004847
Book	Plaksha University Library	Computer science	005.1 GOO (Browse shelf(Opens below))	Available		004848

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

Previous								Next
Previous	005.1 COR Introduction to algorithms	005.1 FRE Head First JavaScript Programming	005.1 GOO Design and analysis of algorithms : an indian adaptation	005.1 GOO Design and analysis of algorithms : an indian adaptation	005.1 KAN Test your C Skills	005.1 KLE Algorithm design	005.1 KLE Algorithm design	Next

https://www.wileyindia.com//design-and-analysis-of-algorithms-an-indian-adaptation.html

Design and Analysis of Algorithms offers an exhaustive coverage of the design and analysis of algorithms and data structures. Integrating application with theory, the book presents algorithmic topics in a context that is motivated from applications to uses in society, computer games, computing industry, science, engineering, and the Internet. Beginning with the basic framework and tools needed to analyze algorithms, the book then presents fundamental data structures, such as stacks, queues, lists, and advanced data structures such as trees, search trees, priority queues, heaps, hash tables, union-find structures, and graphs.

There are no comments on this title.

to post a comment.