東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Data structures and algorithms with Python = with an introduction to multiprocessing /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Data structures and algorithms with Python/ by Kent D. Lee, Steve Hubbard.
其他題名:	with an introduction to multiprocessing /
作者:	Lee, Kent D.
其他作者:	Hubbard, Steve.
出版者:	Cham :Springer International Publishing : : 2024.,
面頁冊數:	xvi, 398 p. :ill. (some col.), digital ;24 cm.
內容註:	1. Python Programming 101 -- 2. Computational Complexity -- 3. Recursion -- 4. Sequences -- 5. Sets and Maps -- 6. Trees -- 7. Graphs -- 8. Membership Structures -- 9. Heaps -- 10. Balanced Binary Search Trees -- 11. B-Trees -- 12. Heuristic Search.
Contained By:	Springer Nature eBook
標題:	Computer algorithms. -
電子資源:	https://doi.org/10.1007/978-3-031-42209-6
ISBN:	9783031422096

Data structures and algorithms with Python = with an introduction to multiprocessing /
Lee, Kent D.

Data structures and algorithms with Pythonwith an introduction to multiprocessing /[electronic resource] :by Kent D. Lee, Steve Hubbard. - Second edition. - Cham :Springer International Publishing :2024. - xvi, 398 p. :ill. (some col.), digital ;24 cm. - Undergraduate topics in computer science,2197-1781. - Undergraduate topics in computer science..

1. Python Programming 101 -- 2. Computational Complexity -- 3. Recursion -- 4. Sequences -- 5. Sets and Maps -- 6. Trees -- 7. Graphs -- 8. Membership Structures -- 9. Heaps -- 10. Balanced Binary Search Trees -- 11. B-Trees -- 12. Heuristic Search.

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 courses Provides learning goals, review questions, and programming exercises in each chapter, as well as numerous examples Presents a primer on Python for those coming from a different language background Adds 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 algorithms Offers downloadable programs and supplementary files at an associated website to help students 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.

ISBN: 9783031422096

Standard No.: 10.1007/978-3-031-42209-6doiSubjects--Topical Terms:

523872
Computer algorithms.

LC Class. No.: QA76.9.D35

Dewey Class. No.: 005.73

Data structures and algorithms with Python = with an introduction to multiprocessing /
LDR:03424nmm a2200373 a 4500 001 2368563
003 DE-He213
005 20240124155214.0
006 m d
007 cr nn 008maaau
008 241127s2024 sz s 0 eng d
020 $a 9783031422096 $q (electronic bk.)
020 $a 9783031422089 $q (paper)
024 7 $a 10.1007/978-3-031-42209-6 $2 doi
035 $a 978-3-031-42209-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.D35
072 7 $a UMB $2 bicssc
072 7 $a GPF $2 bicssc
072 7 $a COM031000 $2 bisacsh
072 7 $a UMB $2 thema
072 7 $a GPF $2 thema
082 0 4 $a 005.73 $2 23
090 $a QA76.9.D35 $b L478 2024
100 1 $a Lee, Kent D. $3 704278
245 1 0 $a Data structures and algorithms with Python $h [electronic resource] : $b with an introduction to multiprocessing / $c by Kent D. Lee, Steve Hubbard.
250 $a Second edition.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2024.
300 $a xvi, 398 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Undergraduate topics in computer science, $x 2197-1781
505 0 $a 1. Python Programming 101 -- 2. Computational Complexity -- 3. Recursion -- 4. Sequences -- 5. Sets and Maps -- 6. Trees -- 7. Graphs -- 8. Membership Structures -- 9. Heaps -- 10. Balanced Binary Search Trees -- 11. B-Trees -- 12. Heuristic Search.
520 $a 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 courses Provides learning goals, review questions, and programming exercises in each chapter, as well as numerous examples Presents a primer on Python for those coming from a different language background Adds 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 algorithms Offers downloadable programs and supplementary files at an associated website to help students 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.
650 0 $a Computer algorithms. $3 523872
650 0 $a Data structures (Computer science) $3 527210
650 0 $a Python (Computer program language) $3 729789
650 1 4 $a Data Structures and Information Theory. $3 3382368
650 2 4 $a Algorithms. $3 536374
650 2 4 $a Python. $3 3201289
650 2 4 $a Programming Techniques. $3 892496
700 1 $a Hubbard, Steve. $3 2133922
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Undergraduate topics in computer science. $3 1567579
856 4 0 $u https://doi.org/10.1007/978-3-031-42209-6
950 $a Computer Science (SpringerNature-11645)