Hands-on data structures and algorithms with Python : write complex and powerful using the latest features of Python 3.7 (Record no. 31268)

000 -LEADER
fixed length control field a
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 220916b xxu||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781788995573
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.133
Item number AGA
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Agarwal, Basant
245 ## - TITLE STATEMENT
Title Hands-on data structures and algorithms with Python : write complex and powerful using the latest features of Python 3.7
250 ## - EDITION STATEMENT
Edition statement 2nd ed.
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Name of publisher, distributor, etc Packt Publishing,
Date of publication, distribution, etc 2018
Place of publication, distribution, etc Birmingham :
300 ## - PHYSICAL DESCRIPTION
Extent 380 p. ;
Other physical details ill.,
Dimensions 25 cm
365 ## - TRADE PRICE
Price amount 2799.00
Price type code INR
Unit of pricing 01
520 ## - SUMMARY, ETC.
Summary, etc Data structures allow you to store and organize data efficiently. They are critical to any problem, provide a complete solution, and act like reusable code. Hands-On Data Structures and Algorithms with Python teaches you the essential Python data structures and the most common algorithms for building easy and maintainable applications.

This book helps you to understand the power of linked lists, double linked lists, and circular linked lists. You will learn to create complex data structures, such as graphs, stacks, and queues. As you make your way through the chapters, you will explore the application of binary searches and binary search trees, along with learning common techniques and structures used in tasks such as preprocessing, modeling, and transforming data. In the concluding chapters, you will get to grips with organizing your code in a manageable, consistent, and extendable way. You will also study how to bubble sort, selection sort, insertion sort, and merge sort algorithms in detail.

By the end of the book, you will have learned how to build components that are easy to understand, debug, and use in different applications. You will get insights into Python implementation of all the important and relevant algorithms.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Querying
Topical term or geographic name as entry element Computer science
Topical term or geographic name as entry element Computer logic
Topical term or geographic name as entry element Data structures
Topical term or geographic name as entry element Python Programming
Topical term or geographic name as entry element Amortized analysis
Topical term or geographic name as entry element Asymptotic analysis
Topical term or geographic name as entry element Binary search tree
Topical term or geographic name as entry element Bubble sort algorithms
Topical term or geographic name as entry element Coin-counting problem
Topical term or geographic name as entry element Depth-first search
Topical term or geographic name as entry element Interpolation search
Topical term or geographic name as entry element Iterative function
Topical term or geographic name as entry element Knuth-Morris-Pratt (KMP) algorithm
Topical term or geographic name as entry element List-based queues
Topical term or geographic name as entry element Media player queues
Topical term or geographic name as entry element Node-based queues
Topical term or geographic name as entry element Ordered linear search
Topical term or geographic name as entry element Pattern matching algoorithms
Topical term or geographic name as entry element Python environment
Topical term or geographic name as entry element Queue
Topical term or geographic name as entry element Recursive function
Topical term or geographic name as entry element Strings
Topical term or geographic name as entry element Tuples
Topical term or geographic name as entry element Traveling salesman problem
Topical term or geographic name as entry element Unsupervised learning
700 ## - ADDED ENTRY--PERSONAL NAME
Personal name Baka, Benjamin
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Item type Books
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Permanent location Current location Date acquired Cost, normal purchase price Total Checkouts Full call number Barcode Checked out Date last seen Date last borrowed Koha item type
          DAIICT DAIICT 2022-09-16 2799.00 3 005.133 AGA 033319 2023-09-28 2023-09-14 2023-09-14 Books

Powered by Koha