Data structures and algorithms with python / (Record no. 14214)

MARC details
000 -LEADER
fixed length control field 02275nam a2200241Ia 4500
003 - CONTROL NUMBER IDENTIFIER
control field NULRC
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20250520102735.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 250520s9999 xx 000 0 und d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783319130712
040 ## - CATALOGING SOURCE
Transcribing agency NULRC
050 ## - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA 76.73.J38 .L44 2015
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Lee, Kent D.
Relator term author
245 #0 - TITLE STATEMENT
Title Data structures and algorithms with python /
Statement of responsibility, etc. Kent D. Lee and Steve Hubbard.
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. Cham, Switzerland :
Name of publisher, distributor, etc. Springer International Publishing,
Date of publication, distribution, etc. c2015
300 ## - PHYSICAL DESCRIPTION
Extent xv, 363 pages :
Other physical details illustrations ;
Dimensions 24 cm.
365 ## - TRADE PRICE
Price amount USD45.51
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc. note Includes bibliographical references and index.
505 ## - FORMATTED CONTENTS NOTE
Formatted contents note 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 ## - SUMMARY, ETC.
Summary, etc. 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 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. 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 from a different language background.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element DATA STRUCTURES (COMPUTER SCIENCE)
700 ## - ADDED ENTRY--PERSONAL NAME
Personal name Hubbard, Steve.
Relator term co-author
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Library of Congress Classification
Koha item type Books
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Collection Home library Current library Shelving location Date acquired Source of acquisition Cost, normal purchase price Total checkouts Full call number Barcode Date last seen Copy number Price effective from Koha item type
    Library of Congress Classification     Computer Science LRC - Main National University - Manila General Circulation 08/09/2016 Purchased - Amazon 45.57   GC QA 76.73.J38 .L44 2015 NULIB000011973 05/20/2025 c.1 05/20/2025 Books