Data structures algorithms python par lee kent (18 résultats)

paperback. Etat : Very Good. Cover and edges may have some wear.

Paperback. Etat : Fair. 2015. The item might be beaten up but readable. May contain markings or highlighting, as well as stains, bent corners, or any other major defect, but the text is not obscured in any way.

Etat : very_good. Book is in very good condition and may include minimal underlining highlighting. The book can also include "From the library of" labels. May not contain miscellaneous items toys, dvds, etc. . We offer 100% money back guarantee and 24 7 customer service.

Paperback. Etat : new. Paperback. 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 algorithmssupported by motivating examplesthat 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.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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

Etat : New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Etat : New. pp. 368 2nd ed. 2024 edition NO-PA16APR2015-KAP.

Etat : New. pp. 368.

Paperback. Etat : Brand New. 2nd edition. 414 pages. 9.00x5.75x1.00 inches. In Stock.

Etat : New. pp. 368.

Etat : New. pp. xv + 363.

Etat : New. pp. xv + 363 147 Illus. (139 Col.).

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.…

Paperback. Etat : New. Brand New! Fast Delivery This is an International Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 6-10 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.…

Etat : Good. Good condition. A copy that has been read but remains intact. May contain markings such as bookplates, stamps, limited notes and highlighting, or a few light stains.

Paperback. Etat : new. Paperback. 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 algorithmssupported by motivating examplesthat 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.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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.…

Etat : new. Questo è un articolo print on demand.

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.…

Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. 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.…