國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Data structures and algorithms with ...

Hubbard, Steve.

Data structures and algorithms with Python

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Data structures and algorithms with Pythonby Kent D. Lee, Steve Hubbard.
作者:	Lee, Kent D.
其他作者:	Hubbard, Steve.
出版者:	Cham :Springer International Publishing :2015.
面頁冊數:	xv, 363 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer eBooks
標題:	Data structures (Computer science)
電子資源:	http://dx.doi.org/10.1007/978-3-319-13072-9
ISBN:	9783319130729 (electronic bk.)

Data structures and algorithms with Python
Lee, Kent D.

Data structures and algorithms with Python[electronic resource] /by Kent D. Lee, Steve Hubbard. - Cham :Springer International Publishing :2015. - xv, 363 p. :ill. (some col.), digital ;24 cm. - Undergraduate topics in computer science,1863-7310. - Undergraduate topics in computer science..

Python Programming 101 -- Computational Complexity -- Recursion -- Sequences -- Sets and Maps -- Trees -- Graphs -- Membership Structures -- Heaps -- Balanced Binary Search Trees -- B-Trees -- Heuristic Search -- Appendix A: Integer Operators -- Appendix B: Float Operators -- Appendix C: String Operators and Methods -- Appendix D: List Operators and Methods -- Appendix E: Dictionary Operators and Methods -- Appendix F: Turtle Methods -- Appendix G: TurtleScreen Methods -- Appendix H: Complete Programs.

This clearly structured and easy to read 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 also introduced, demonstrating what can and cannot be computed efficiently so that the programmer can make informed judgements about the algorithms they use. The text assumes some basic experience in computer programming and familiarity in an object-oriented language, but not necessarily with Python. Topics and features: Includes both introductory and advanced data structures and algorithms topics, with suggested chapter sequences for those respective courses provided in the preface Provides learning goals, review questions and programming exercises in each chapter, as well as numerous illustrative examples Offers downloadable programs and supplementary files at an associated website, with instructor materials available from the author Presents a primer on Python for those coming from a different language background Reviews the use of hashing in sets and maps, along with an examination of binary search trees and tree traversals, and material on depth first search of graphs Discusses topics suitable for an advanced course, such as membership structures, heaps, balanced binary search trees, B-trees and heuristic search Students of computer science will find this clear and concise textbook to be 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.

ISBN: 9783319130729 (electronic bk.)

Standard No.: 10.1007/978-3-319-13072-9doiSubjects--Topical Terms:

183917
Data structures (Computer science)

LC Class. No.: QA76.9.D35

Dewey Class. No.: 005.73

Data structures and algorithms with Python
LDR:03345nmm a2200325 a 4500 001 461386
003 DE-He213
005 20150825135016.0
006 m d
007 cr nn 008maaau
008 151110s2015 gw s 0 eng d
020 $a 9783319130729 (electronic bk.)
020 $a 9783319130712 (paper)
024 7 $a 10.1007/978-3-319-13072-9 $2 doi
035 $a 978-3-319-13072-9
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.D35
072 7 $a UMB $2 bicssc
072 7 $a COM062000 $2 bisacsh
082 0 4 $a 005.73 $2 23
090 $a QA76.9.D35 $b L478 2015
100 1 $a Lee, Kent D. $3 509229
245 1 0 $a Data structures and algorithms with Python $h [electronic resource] / $c by Kent D. Lee, Steve Hubbard.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a xv, 363 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Undergraduate topics in computer science, $x 1863-7310
505 0 $a Python Programming 101 -- Computational Complexity -- Recursion -- Sequences -- Sets and Maps -- Trees -- Graphs -- Membership Structures -- Heaps -- Balanced Binary Search Trees -- B-Trees -- Heuristic Search -- Appendix A: Integer Operators -- Appendix B: Float Operators -- Appendix C: String Operators and Methods -- Appendix D: List Operators and Methods -- Appendix E: Dictionary Operators and Methods -- Appendix F: Turtle Methods -- Appendix G: TurtleScreen Methods -- Appendix H: Complete Programs.
520 $a This clearly structured and easy to read 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 also introduced, demonstrating what can and cannot be computed efficiently so that the programmer can make informed judgements about the algorithms they use. The text assumes some basic experience in computer programming and familiarity in an object-oriented language, but not necessarily with Python. Topics and features: Includes both introductory and advanced data structures and algorithms topics, with suggested chapter sequences for those respective courses provided in the preface Provides learning goals, review questions and programming exercises in each chapter, as well as numerous illustrative examples Offers downloadable programs and supplementary files at an associated website, with instructor materials available from the author Presents a primer on Python for those coming from a different language background Reviews the use of hashing in sets and maps, along with an examination of binary search trees and tree traversals, and material on depth first search of graphs Discusses topics suitable for an advanced course, such as membership structures, heaps, balanced binary search trees, B-trees and heuristic search Students of computer science will find this clear and concise textbook to be 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.
650 0 $a Data structures (Computer science) $3 183917
650 0 $a Python (Computer program language) $3 215247
650 0 $a Computer algorithms. $3 184478
650 1 4 $a Computer Science. $3 212513
650 2 4 $a Data Structures. $3 273992
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Programming Techniques. $3 274470
700 1 $a Hubbard, Steve. $3 713446
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Undergraduate topics in computer science. $3 559648
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-13072-9
950 $a Computer Science (Springer-11645)