| 000 -LEADER |
|---|
| fixed length control field |
07214nam a22004097a 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
CITU |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20241022100307.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
241018b ||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9781786308917 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9781394192045 |
| Qualifying information |
(electronic bk. : oBook) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
1394192045 |
| Qualifying information |
(electronic bk. : oBook) |
| 024 7# - OTHER STANDARD IDENTIFIER |
|---|
| Standard number or code |
10.1002/9781394192045 |
| Source of number or code |
doi |
| 035 ## - SYSTEM CONTROL NUMBER |
|---|
| System control number |
(OCoLC)1366105179 |
| 041 ## - LANGUAGE CODE |
|---|
| Language code of text/sound track or separate title |
eng |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA76.9.D35 |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
005.7/3 |
| Edition number |
23 |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Preferred name for the person |
Pai, G. A. Vijayalakshmi, |
| Authority record control number |
https://id.loc.gov/authorities/names/nb2008019895 |
| Relator term |
author. |
| 245 12 - TITLE STATEMENT |
|---|
| Title |
A textbook of data structures and algorithms. |
| Number of part/section of a work |
2, |
| Name of part/section of a work |
Mastering nonlinear data structures / |
| Statement of responsibility, etc |
G. A. Vijayalakshmi Pai. |
| 246 30 - VARYING FORM OF TITLE |
|---|
| Title proper/short title |
Mastering nonlinear data structures. |
| 264 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Place of publication, distribution, etc |
London, UK : |
| Name of publisher, distributor, etc |
ISTE, Ltd. ; |
| Place of publication, distribution, etc |
Hoboken, NJ : |
| Name of publisher, distributor, etc |
John Wiley & Sons, Inc., |
| Date of publication, distribution, etc |
2023. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
1 online resource. |
| 336 ## - CONTENT TYPE |
|---|
| Content type term |
text |
| Content type code |
txt |
| Source |
rdacontent. |
| 337 ## - MEDIA TYPE |
|---|
| Media type term |
computer |
| Media type code |
c |
| Source |
rdamedia. |
| 338 ## - CARRIER TYPE |
|---|
| Carrier type term |
online resource |
| Carrier type code |
cr |
| Source |
rdacarrier. |
| 340 ## - PHYSICAL MEDIUM |
|---|
| Source |
rdacc |
| Authority record control number or standard number |
http://rdaregistry.info/termList/RDAColourContent/1003. |
| 490 1# - SERIES STATEMENT |
|---|
| Series statement |
Computer engineering series. |
| 505 0# - CONTENTS |
|---|
| Formatted contents note |
Table of Contents<br/>Preface ix<br/><br/>Acknowledgments xv<br/><br/>Chapter 8 Trees and Binary Trees 1<br/><br/>8.1 Introduction 1<br/><br/>8.2 Trees: definition and basic terminologies 1<br/><br/>8.2.1 Definition of trees 1<br/><br/>8.2.2 Basic terminologies of trees 2<br/><br/>8.3 Representation of trees 3<br/><br/>8.4 Binary trees: basic terminologies and types 6<br/><br/>8.4.1 Basic terminologies 6<br/><br/>8.4.2 Types of binary trees 7<br/><br/>8.5 Representation of binary trees 8<br/><br/>8.5.1 Array representation of binary trees 8<br/><br/>8.5.2 Linked representation of binary trees 10<br/><br/>8.6 Binary tree traversals 11<br/><br/>8.6.1 Inorder traversal 12<br/><br/>8.6.2 Postorder traversal 16<br/><br/>8.6.3 Preorder traversal 19<br/><br/>8.7 Threaded binary trees 22<br/><br/>8.7.1 Linked representation of a threaded binary tree 24<br/><br/>8.7.2 Growing threaded binary trees 24<br/><br/>8.8 Applications 25<br/><br/>8.8.1 Expression trees 26<br/><br/>8.8.2 Traversals of an expression tree 27<br/><br/>8.8.3 Conversion of infix expression to postfix expression 27<br/><br/>8.8.4 Segment trees 31<br/><br/>8.9 Illustrative problems 42<br/><br/>Chapter 9 Graphs 61<br/><br/>9.1 Introduction 61<br/><br/>9.2 Definitions and basic terminologies 63<br/><br/>9.3 Representations of graphs 75<br/><br/>9.3.1 Sequential representation of graphs 76<br/><br/>9.3.2 Linked representation of graphs 80<br/><br/>9.4 Graph traversals 81<br/><br/>9.4.1 Breadth first traversal 81<br/><br/>9.4.2 Depth first traversal 83<br/><br/>9.5 Applications 87<br/><br/>9.5.1 Single source shortest path problem 87<br/><br/>9.5.2 Minimum cost spanning trees 90<br/><br/>9.6 Illustrative problems 97<br/><br/>Chapter 10 Binary Search Trees and AVL Trees 115<br/><br/>10.1 Introduction 115<br/><br/>10.2 Binary search trees: definition and operations 115<br/><br/>10.2.1 Definition 115<br/><br/>10.2.2 Representation of a binary search tree 116<br/><br/>10.2.3 Retrieval from a binary search tree 117<br/><br/>10.2.4 Why are binary search tree retrievals more efficient than sequential list retrievals? 118<br/><br/>10.2.5 Insertion into a binary search tree 120<br/><br/>10.2.6 Deletion from a binary search tree 122<br/><br/>10.2.7 Drawbacks of a binary search tree 125<br/><br/>10.2.8 Counting binary search trees 128<br/><br/>10.3 AVL trees: definition and operations 130<br/><br/>10.3.1 Definition 131<br/><br/>10.3.2 Retrieval from an AVL search tree 132<br/><br/>10.3.3 Insertion into an AVL search tree 133<br/><br/>10.3.4 Deletion from an AVL search tree 141<br/><br/>10.3.5 R category rotations associated with the delete operation 146<br/><br/>10.3.6 L category rotations associated with the delete operation 150<br/><br/>10.4 Applications 151<br/><br/>10.4.1 Representation of symbol tables in compiler design 151<br/><br/>10.5 Illustrative problems 154<br/><br/>Chapter 11 B Trees and Tries 175<br/><br/>11.1 Introduction 175<br/><br/>11.2 m-way search trees: definition and operations 176<br/><br/>11.2.1 Definition 176<br/><br/>11.2.2 Node structure and representation 176<br/><br/>11.2.3 Searching an m-way search tree 178<br/><br/>11.2.4 Inserting into an m-way search tree 178<br/><br/>11.2.5 Deleting from an m-way search tree 179<br/><br/>11.2.6 Drawbacks of m-way search trees 184<br/><br/>11.3 B trees: definition and operations 184<br/><br/>11.3.1 Definition 184<br/><br/>11.3.2 Searching a B tree of order m 186<br/><br/>11.3.3 Inserting into a B tree of order m 186<br/><br/>11.3.4 Deletion from a B tree of order m 190<br/><br/>11.3.5 Height of a B tree of order m 194<br/><br/>11.4 Tries: definition and operations 195<br/><br/>11.4.1 Definition and representation 195<br/><br/>11.4.2 Searching a trie 197<br/><br/>11.4.3 Insertion into a trie 197<br/><br/>11.4.4 Deletion from a trie 198<br/><br/>11.4.5 Some remarks on tries 200<br/><br/>11.5 Applications 200<br/><br/>11.5.1 File indexing 201<br/><br/>11.5.2 Spell checker 203<br/><br/>11.6 Illustrative problems 204<br/><br/>Chapter 12 Red-Black Trees and Splay Trees 215<br/><br/>12.1 Red-black trees 215<br/><br/>12.1.1 Introduction to red-black trees 215<br/><br/>12.1.2 Definition 216<br/><br/>12.1.3 Representation of a red-black tree 219<br/><br/>12.1.4 Searching a red-black tree 220<br/><br/>12.1.5 Inserting into a red-black tree 220<br/><br/>12.1.6 Deleting from a red-black tree 228<br/><br/>12.1.7 Time complexity of search, insert and delete operations on a red-black tree 236<br/><br/>12.2 Splay trees 236<br/><br/>12.2.1 Introduction to splay trees 236<br/><br/>12.2.2 Splay rotations 237<br/><br/>12.2.3 Some remarks on amortized analysis of splay trees 242<br/><br/>12.3 Applications 244<br/><br/>12.4 Illustrative problems 245<br/><br/>References 261<br/><br/>Index 263<br/><br/>Summaries of other volumes 265 |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
Data structures and algorithms is a fundamental course in Computer Science, which enables learners across any discipline to develop the much-needed foundation of efficient programming, leading to better problem solving in their respective disciplines.<br/><br/>A Textbook of Data Structures and Algorithms is a textbook that can be used as course material in classrooms, or as self-learning material. The book targets novice learners aspiring to acquire advanced knowledge of the topic. Therefore, the content of the book has been pragmatically structured across three volumes and kept comprehensive enough to help them in their progression from novice to expert.<br/><br/>With this in mind, the book details concepts, techniques and applications pertaining to data structures and algorithms, independent of any programming language. It includes 181 illustrative problems and 276 review questions to reinforce a theoretical understanding and presents a suggestive list of 108 programming assignments to aid in the implementation of the methods covered. |
| 545 0# - BIOGRAPHICAL OR HISTORICAL DATA |
|---|
| Biographical or historical note |
G A Vijayalakshmi Pai SMIEEE is a Professor of Computer Applications at PSG College of Technology, Coimbatore, India. She has authored books and investigated research projects funded by government agencies in the disciplines of Computational Finance and Computational Intelligence. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Data structures (Computer science) |
| Authority record control number |
https://id.loc.gov/authorities/subjects/sh85035862. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computer algorithms. |
| Authority record control number |
https://id.loc.gov/authorities/subjects/sh91000149. |
| 655 #4 - INDEX TERM--GENRE/FORM |
|---|
| Genre/form data or focus term |
Electronic books. |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE |
|---|
| Uniform title |
Computer engineering series (London, England) |
| Authority record control number |
https://id.loc.gov/authorities/names/no2013062030. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
https://onlinelibrary.wiley.com/doi/book/10.1002/9781394192045 |
| Link text |
Full text available at Wiley Online Library Click here to view |
| 942 ## - ADDED ENTRY ELEMENTS |
|---|
| Source of classification or shelving scheme |
|
| Item type |
EBOOK |