MARC details
000 -LEADER |
fixed length control field |
03741nmm a22003137a 4500 |
003 - CONTROL NUMBER IDENTIFIER |
control field |
OSt |
005 - DATE AND TIME OF LATEST TRANSACTION |
control field |
20240723093326.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
fixed length control field |
240723b |||||||| |||| 00| 0 eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
9789355513311 (e-book) |
040 ## - CATALOGING SOURCE |
Transcribing agency |
Cavite State University - Main Campus Library |
Description conventions |
rda |
041 ## - LANGUAGE CODE |
Language code of text/sound track or separate title |
eng |
050 ## - LIBRARY OF CONGRESS CALL NUMBER |
Classification number |
K5105 |
Item number |
B49 2023 |
100 ## - MAIN ENTRY--PERSONAL NAME |
Personal name |
Bhasin, Harsh |
9 (RLIN) |
47528 |
Relator term |
author |
245 ## - TITLE STATEMENT |
Title |
Data structures with python : |
Remainder of title |
get familiar with the common data structures and algorithms in python / |
Statement of responsibility, etc. |
by Harsh Bhasin |
260 ## - PUBLICATION, DISTRIBUTION, ETC. |
Place of publication, distribution, etc. |
London : |
Name of publisher, distributor, etc. |
BPB Publications, |
Date of publication, distribution, etc. |
2023 |
300 ## - PHYSICAL DESCRIPTION |
Extent |
1 online resource (409, pages) : |
Other physical details |
color illustrations. |
336 ## - CONTENT TYPE |
Source |
rdacontent |
Content type term |
text |
337 ## - MEDIA TYPE |
Source |
rdamedia |
Media type term |
computer |
338 ## - CARRIER TYPE |
Source |
rdacarrier |
Carrier type term |
online resource |
500 ## - GENERAL NOTE |
General note |
https://portal.igpublish.com/iglibrary/ is required to read this e-book. |
504 ## - BIBLIOGRAPHY, ETC. NOTE |
Bibliography, etc. note |
Includes index<br/> |
505 ## - FORMATTED CONTENTS NOTE |
Formatted contents note |
1. Introduction to data structures -- 2. Design methodologies -- 3. Recursion -- 4. Arrays -- 5. Linked list -- 6. Stacks -- 7. Queues -- 8. Trees-I -- 9. Trees-II -- 10. Priority queues -- 11. Graphs -- 12. Sorting -- 13. Median and order statistics<br/>-- 14. Hashing -- 15. String matching |
520 ## - SUMMARY, ETC. |
Summary, etc. |
Develop a strong foundation in Data Structures and Algorithms and become a skilled programmer Key Features ? Explore various data structures and algorithms and their applications. ? Learn how to use advanced data structures and algorithms to solve complex computational problems. ? An easy-to-understand guide that gives a comprehensive introduction to data structures and algorithms using the Python programming language. Description Data structures are a way of organizing and storing data in a computer so that it can be accessed and manipulated efficiently. If you want to become an accomplished programmer and master this subject, then this book is for you. The book starts by introducing you to the fascinating world of data structures and algorithms. This book will help you learn about different algorithmic techniques such as Dynamic programming, Greedy algorithms, and Backtracking, and their applications in solving various computational problems. The book will then teach you how to analyze the complexity of Recursive algorithms. Moving on, the book will help you get familiar with the concept of Linked lists, which is an important foundation for understanding other data structures, such as Stacks and Queues, which are covered in detail later in this book. The book will also teach you about advanced data structures such as Trees and Graphs, their different types, and their applications. Towards the end, the book will teach you how to use various Sorting, Searching Selection and String algorithms. By the end of the book, you will get a comprehensive and in-depth understanding of various data structures and algorithms and their applications in solving real-world computational problems efficiently. What you will learn ? Get familiar with the fundamentals of data structures such as arrays, linked lists, stacks, and queues. ? Understand the basics of algorithm analysis and complexity theory. ? Explore different approaches to the algorithm design, such as divide-and-conquer |
541 ## - IMMEDIATE SOURCE OF ACQUISITION NOTE |
Source of acquisition |
Fund 164 |
Vendor |
CE-Logic |
Method of acquisition |
Purchased |
Date of acquisition |
February 19, 2024 |
Accession number |
OEBP000441<br/> |
Owner |
P. Roderno |
Purchase price |
PHP 1,938.00 <br/> |
PO No. |
2024-02-0124 |
Sales Invoice No. |
2024-1-113 |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Python (Computer program language) |
9 (RLIN) |
4472 |
856 ## - ELECTRONIC LOCATION AND ACCESS |
Electronic File |
<a href="https://portal.igpublish.com/iglibrary/obj/BPB0000411?searchid=1719985632909~45X3KRKTm4hxryagJrBh">https://portal.igpublish.com/iglibrary/obj/BPB0000411?searchid=1719985632909~45X3KRKTm4hxryagJrBh</a> |
Link text |
Click here to read Full-Text E-Book |
856 ## - ELECTRONIC LOCATION AND ACCESS |
Electronic File |
<a href="https://docs.google.com/forms/d/e/1FAIpQLSfSoAj3qM4b_ttQMZLuimqgwkfHDH1NyJ7S4eyjHD7Vr4j7EQ/viewform">https://docs.google.com/forms/d/e/1FAIpQLSfSoAj3qM4b_ttQMZLuimqgwkfHDH1NyJ7S4eyjHD7Vr4j7EQ/viewform</a> |
Link text |
Log-in to the website is required to read this e-book. Click here to request access. |
942 ## - ADDED ENTRY ELEMENTS (KOHA) |
Source of classification or shelving scheme |
Library of Congress Classification |
Koha item type |
Online E-Books |