MARC details
000 -LEADER |
fixed length control field |
02041nam a2200229Ia 4500 |
003 - CONTROL NUMBER IDENTIFIER |
control field |
NUBLRC |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
fixed length control field |
241210s9999 xx 000 0 und d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
978-1-80107-344-8 |
040 ## - CATALOGING SOURCE |
Transcribing agency |
NUBLRC |
050 ## - LIBRARY OF CONGRESS CALL NUMBER |
Classification number |
GC QA 76.73 .P98 .A33 2022 c.1 |
100 ## - MAIN ENTRY--PERSONAL NAME |
Personal name |
Agarwal, Basant |
245 #0 - TITLE STATEMENT |
Title |
Hands-on data structures and algorithms with python : |
Remainder of title |
store, manipulate, and access data effectively and boost the performance of your applications / |
Statement of responsibility, etc. |
Basant, Agarwal |
250 ## - EDITION STATEMENT |
Edition statement |
Third Edition |
260 ## - PUBLICATION, DISTRIBUTION, ETC. |
Place of publication, distribution, etc. |
Mumbai : |
Name of publisher, distributor, etc. |
Packt Publlishing Ltd., |
Date of publication, distribution, etc. |
c2022 |
300 ## - PHYSICAL DESCRIPTION |
Extent |
472 pages : |
Other physical details |
illustration ; |
Dimensions |
25cm. |
365 ## - TRADE PRICE |
Price amount |
USD 60.99 |
504 ## - BIBLIOGRAPHY, ETC. NOTE |
Bibliography, etc. note |
Include index. |
505 ## - FORMATTED CONTENTS NOTE |
Formatted contents note |
Chapter 1. Python data types and structure -- Chapter 2. Introduction to algorithm design -- Chapter 3. Algorithm design techniques and strategies -- Chapter 4. Linked lists -- Chapter 5. Stacksand queues -- Chapter 6. Trees -- Chapter 7. Heaps and priority queus -- Chapter 8. Hash tables -- Chapter 9. Graphs and algorithms -- Chapter 10. Searching -- Chapter 11. Sorting -- Chapter 12. Selection algorithms -- Chapter 13. String matching algorithms. |
520 ## - SUMMARY, ETC. |
Summary, etc. |
Choosing the right data structure is pivotal to optimizing the performance and scalability of applications. This new edition of Hands-On Data Structures and Algorithms with Python will expand your understanding of key structures, including stacks, queues, and lists, and also show you how to apply priority queues and heaps in applications. You'll learn how to analyze and compare Python algorithms, and understand which algorithms should be used for a problem based on running time and computational complexity. You will also become confident organizing your code in a manageable, consistent, and scalable way, which will boost your productivity as a Python developer.By the end of this Python book, you'll be able to manipulate the most important data structures and algorithms to more efficiently store, organize, and access data in your applications. |
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
COMPUTER PROGRAMMING |
942 ## - ADDED ENTRY ELEMENTS (KOHA) |
Source of classification or shelving scheme |
Library of Congress Classification |
Koha item type |
Books |