000			nam a22 4500
999			_c32603 _d32603
008			240304b xxu||||| |||| 00| 0 eng d
020			_a9783031422089
082			_a005.7 _bLEE
100			_aLee, Kent D.
245			_aData structures and algorithms with Python : with an introduction to multiprocessing
250			_a2nd ed.
260			_bSpringer, _c2023 _aCham :
300			_axv, 363 p. ; _bill., _c23 cm
365			_b49.99 _c€ _d94.80
490			_aUndergraduate topics in computer science
504			_aIncludes bibliographical references and index.
520			_aThis 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			_aTkinter
650			_aSplay tree
650			_aRecursive function
650			_aAdix Sort
650			_aDepth first search
650			_aBreadth first search
650			_aBloom filter
650			_aBinary search tree
650			_aB-Tree
650			_aAVL tree
700			_aHubbard, Steve
942			_2ddc _cBK