Data structures and algorithms with Python : with an introduction to multiprocessing / by Kent D. Lee and Steve Hubbard

By:

Lee, Kent D

Contributor(s):

Hubbard, Steve

Material type:

TextSeries: Undergraduate topics in computer sciencePublication details: Cham : Springer, 2024Edition: 2nd edDescription: xvi, 398 pISBN:

9783031422089

Subject(s):

DDC classification:

005.73 LEE-D

Summary: This textbook explains the concepts and techniques required to write programs that can handle large amounts of data efficiently. Project-oriented and classroom-tested, the book presents a number of important algorithms -- supported by motivating examples -- that bring meaning to the problems faced by computer programmers. The idea of computational complexity is introduced, demonstrating what can and cannot be computed efficiently at scale, helping programmers make informed judgements about the algorithms they use. The easy-to-read text assumes some basic experience in computer programming and familiarity in an object-oriented language, but not necessarily with Python. Topics and features.

Item type:

Books

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

Average rating: 0.0 (0 votes)

Holdings
Current library	Call number	Status	Barcode
UMT Main Campus	005.73 LEE-D (Browse shelf(Opens below))	Available	152214

Browsing UMT Main Campus shelves Close shelf browser (Hides shelf browser)

Previous								Next
Previous	005.73 KRU-D Data structures and program design in C	005.73 KRU-D Data structures and program design	005.73 LEE-A Algorithms and data structures in computer engineering	005.73 LEE-D Data structures and algorithms with Python : with an introduction to multiprocessing /	005.73 LIP-D Data structures	005.73 LIP-D Schaum's outlines data structures	005.73 LIP-D Data structures	Next

Index present

This textbook explains the concepts and techniques required to write programs that can handle large amounts of data efficiently. Project-oriented and classroom-tested, the book presents a number of important algorithms -- supported by motivating examples -- that bring meaning to the problems faced by computer programmers. The idea of computational complexity is introduced, demonstrating what can and cannot be computed efficiently at scale, helping programmers make informed judgements about the algorithms they use. The easy-to-read text assumes some basic experience in computer programming and familiarity in an object-oriented language, but not necessarily with Python. Topics and features.

Eng

There are no comments on this title.

to post a comment.