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:
Students of computer science will find this clear and concise textbook invaluable for undergraduate courses on data structures and algorithms, at both introductory and advanced levels. The book is also suitable as a refresher guide for computer programmers starting new jobs working with Python.
Dr. Kent D. Lee is a Professor Emeritus of Computer Science at Luther College, Decorah, Iowa, USA. He is the author of the successful Springer books, Python Programming Fundamentals, and Foundations of Programming Languages.
Dr. Steve Hubbard is a Professor Emeritus of Mathematics and Computer Science at Luther College.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Dr. Kent D. Lee is a Professor Emeritus of Computer Science at Luther College, Decorah, Iowa, USA. He now works for Hewlett Packard Enterprise as an Engineer and Architect on the DragonHPC project within the High Performance Computing division (formerly Cray, Inc.). He is the author of the successful introductory companion textbook from Springer, Python Programming Fundamentals, and the Foundations of Programming Languages - an excellent textbook on compiler and interpreter implementation.
Dr. Steve Hubbard is a Professor Emeritus of Mathematics and Computer Science at Luther College.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : Books From California, Simi Valley, CA, Etats-Unis
paperback. Etat : Very Good. Cover and edges may have some wear. N° de réf. du vendeur mon0003704162
Quantité disponible : 1 disponible(s)
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. pp. 368 2nd ed. 2024 edition NO-PA16APR2015-KAP. N° de réf. du vendeur 26398336460
Quantité disponible : 4 disponible(s)
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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:Includes introductory and advanced data structures and algorithms topics, with suggested chapter sequences for those respective coursesProvides learning goals, review questions, and programming exercises in each chapter, as well as numerous examplesPresents a primer on Python for those coming from a different language backgroundAdds a new chapter on multiprocessing with Python using the DragonHPCmultinodeimplementation of multiprocessing (includes a tutorial)Reviews the use of hashing in sets and maps, and examines binary search trees, tree traversals, and select graph algorithmsOffersdownloadable programs and supplementary files at an associated website to help studentsStudentsof computer science will find this clear and concise textbook invaluable for undergraduate courses on data structures and algorithms, at both introductory and advanced levels. The book is also suitable as a refresher guide for computer programmers starting new jobs working with Python.Dr. Kent D. Leeis a Professor Emeritus of Computer Science at Luther College, Decorah, Iowa, USA. He is the author of the successful Springer books,Python Programming Fundamentals,andFoundations of Programming Languages.Dr. Steve Hubbardis a Professor Emeritus of Mathematics and Computer Science at Luther College. 416 pp. Englisch. N° de réf. du vendeur 9783031422089
Quantité disponible : 2 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. Print on Demand pp. 368. N° de réf. du vendeur 399089171
Quantité disponible : 4 disponible(s)
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. PRINT ON DEMAND pp. 368. N° de réf. du vendeur 18398336454
Quantité disponible : 4 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Includes broad coverage of both introductory and advanced data structures topics, supported by examplesMakes learning fun, using the development of graphical user interface programs to illustrate conceptsIncludes supplementary material: sn. N° de réf. du vendeur 945398594
Quantité disponible : Plus de 20 disponibles
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. Neuware -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:Includes introductory and advanced data structures and algorithms topics, with suggested chapter sequences for those respective coursesProvides learning goals, review questions, and programming exercises in each chapter, as well as numerous examplesPresents a primer on Python for those coming from a different language backgroundAdds a new chapter on multiprocessing with Python using the DragonHPC multinode implementation of multiprocessing (includes a tutorial)Reviews the use of hashing in sets and maps, and examines binary search trees, tree traversals, and select graph algorithmsOffers downloadable programs and supplementary files at an associated website to help studentsStudents of computer science will find this clear and concise textbook invaluable for undergraduate courses on data structures and algorithms, at both introductory and advanced levels. The book is also suitable as a refresher guide for computer programmers starting new jobs working with Python.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 416 pp. Englisch. N° de réf. du vendeur 9783031422089
Quantité disponible : 2 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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:Includes introductory and advanced data structures and algorithms topics, with suggested chapter sequences for those respective coursesProvides learning goals, review questions, and programming exercises in each chapter, as well as numerous examplesPresents a primer on Python for those coming from a different language backgroundAdds a new chapter on multiprocessing with Python using the DragonHPCmultinodeimplementation of multiprocessing (includes a tutorial)Reviews the use of hashing in sets and maps, and examines binary search trees, tree traversals, and select graph algorithmsOffersdownloadable programs and supplementary files at an associated website to help studentsStudentsof computer science will find this clear and concise textbook invaluable for undergraduate courses on data structures and algorithms, at both introductory and advanced levels. The book is also suitable as a refresher guide for computer programmers starting new jobs working with Python.Dr. Kent D. Leeis a Professor Emeritus of Computer Science at Luther College, Decorah, Iowa, USA. He is the author of the successful Springer books,Python Programming Fundamentals,andFoundations of Programming Languages.Dr. Steve Hubbardis a Professor Emeritus of Mathematics and Computer Science at Luther College. N° de réf. du vendeur 9783031422089
Quantité disponible : 1 disponible(s)
Vendeur : preigu, Osnabrück, Allemagne
Taschenbuch. Etat : Neu. Data Structures and Algorithms with Python | With an Introduction to Multiprocessing | Kent D. Lee (u. a.) | Taschenbuch | xvi | Englisch | 2024 | Springer | EAN 9783031422089 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. N° de réf. du vendeur 127335821
Quantité disponible : 5 disponible(s)