Data Structures and Algorithms in Python

By:

Michael T. Goodrich Roberto Tamassia Michael H. Goldwasser

Material type: Text

TextPublication details: Delhi Wiley 2023Description: 782ISBN:

9789354247866

Subject(s):

Computer science

DDC classification:

005.133 M58211 D 400244

Reviews from LibraryThing.com:

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	Barcode
Books	CVV Institute of Science and Technology.	BTech-Computer Science	005.133 M58211 D (Browse shelf(Opens below))	Available	400244
Books	CVV Institute of Science and Technology.	BTech-Computer Science	005.133 M58211 D (Browse shelf(Opens below))	Available	400245
Books	CVV Institute of Science and Technology.	BTech-Computer Science	005.133 M58211 D (Browse shelf(Opens below))	Available	400246
Books	CVV Institute of Science and Technology.	BTech-Computer Science	005.133 M58211 D (Browse shelf(Opens below))	Available	400247
Books	CVV Institute of Science and Technology.	BTech-Computer Science	005.133 M58211 D (Browse shelf(Opens below))	Available	400248

Browsing CVV Institute of Science and Technology. shelves, Collection: BTech-Computer Science Close shelf browser (Hides shelf browser)

Previous								Next
Previous	005.133 J6131 P Python for Data Science	005.133 J6131 P Python for Data Science	005.133 J6131 P Python for Data Science	005.133 M58211 D Data Structures and Algorithms in Python	005.133 M58211 D Data Structures and Algorithms in Python	005.133 M58211 D Data Structures and Algorithms in Python	005.133 M58211 D Data Structures and Algorithms in Python	Next

Data structures and algorithms in Python offers a comprehensive, definitive introduction to data structures and algorithms, including their design, analysis, and implementation in Python. Utilizing a consistent object-oriented viewpoint throughout the book, It provides detailed algorithmic strategies for producing efficient realizations of common data structures such as arrays, stacks, queues, linked lists, trees, maps, hash tables, search trees, and graphs. The book also provides an in-depth analysis of algorithmic performance that helps readers to recognize common trade-offs between competing strategies. The book incorporates a host of pedagogical features, including illustrations, code fragments, and end-of-chapter exercises.

There are no comments on this title.

to post a comment.

here