000 -LEADER |
fixed length control field |
nam a22 4500 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
fixed length control field |
240304b xxu||||| |||| 00| 0 eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
9783031422089 |
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
Classification number |
005.7 |
Item number |
LEE |
100 ## - MAIN ENTRY--PERSONAL NAME |
Personal name |
Lee, Kent D. |
245 ## - TITLE STATEMENT |
Title |
Data structures and algorithms with Python : with an introduction to multiprocessing |
250 ## - EDITION STATEMENT |
Edition statement |
2nd ed. |
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
Name of publisher, distributor, etc |
Springer, |
Date of publication, distribution, etc |
2023 |
Place of publication, distribution, etc |
Cham : |
300 ## - PHYSICAL DESCRIPTION |
Extent |
xv, 363 p. ; |
Other physical details |
ill., |
Dimensions |
23 cm |
365 ## - TRADE PRICE |
Price amount |
49.99 |
Price type code |
€ |
Unit of pricing |
94.80 |
490 ## - SERIES STATEMENT |
Series statement |
Undergraduate topics in computer science |
504 ## - BIBLIOGRAPHY, ETC. NOTE |
Bibliography, etc |
Includes bibliographical references and index. |
520 ## - SUMMARY, ETC. |
Summary, etc |
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 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Tkinter |
|
Topical term or geographic name as entry element |
Splay tree |
|
Topical term or geographic name as entry element |
Recursive function |
|
Topical term or geographic name as entry element |
Adix Sort |
|
Topical term or geographic name as entry element |
Depth first search |
|
Topical term or geographic name as entry element |
Breadth first search |
|
Topical term or geographic name as entry element |
Bloom filter |
|
Topical term or geographic name as entry element |
Binary search tree |
|
Topical term or geographic name as entry element |
B-Tree |
|
Topical term or geographic name as entry element |
AVL tree |
700 ## - ADDED ENTRY--PERSONAL NAME |
Personal name |
Hubbard, Steve |
942 ## - ADDED ENTRY ELEMENTS (KOHA) |
Source of classification or shelving scheme |
|
Item type |
Books |