DATA STRUCTURES AND ALGORITHMS : (Record no. 51801)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 01909 m a2200205 44500 |
| 001 - CONTROL NUMBER | |
| control field | sulb-eb0028134 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | BD-SySUS |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20160428134613.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | s2008 xx |||||||||||| ||||und d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9780071337205 |
| International Standard Book Number | |
| 037 ## - SOURCE OF ACQUISITION | |
| Terms of availability | 4,380 |
| 040 1# - CATALOGING SOURCE | |
| Original cataloging agency | XX-XxUND |
| Transcribing agency | XX-XxUND |
| Modifying agency | BD-SySUS. |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Relator code | A01 |
| Personal name | PAI, |
| 245 1# - TITLE STATEMENT | |
| Title | DATA STRUCTURES AND ALGORITHMS : |
| Remainder of title | CONCEPTS, TECHNIQUES AND APPLICATIONS |
| Medium | [electronic resource] / |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | 480 p. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | Intended for a course on Data Structures at the UG level, this title details concepts, techniques, and applications pertaining to the subject in a lucid style. Independent of any programming language, the text discusses several illustrative problems to reinforce the understanding of the theory. It offers a plethora of programming assignments and problems to aid implementation of Data Structures. Features Lucid Language: Language used is easy to comprehend and the text steers clear of complicated formalisms, case in point being the coverage of Trees. Exhaustive coverage: Separate chapters for Binary Search Trees and AVL Trees, B-Trees and Tries, and Red Black Trees and Splay Trees. Example driven approach: After a brief introduction to the topic, the text applies these concepts using solved examples and algorithms. Eg. Infix, Prefix, and PostFix Expressions. Use of Pseudocodes: Will provide students with flexibility in terms of language of implementation. Unique Feature: ADT for each Data Structure has been discussed in a separate section at the end of every chapter. Breakup of Examples and Problems Solved Examples: 124 Review Questions: 215 Illustrative Problems: 133 Programming Assignments: 74 Illustrations: 369 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="http://mcgrawhilleducation.pdn.ipublishcentral.com/product/data-structures-algorithms-concepts-techniques-applications">http://mcgrawhilleducation.pdn.ipublishcentral.com/product/data-structures-algorithms-concepts-techniques-applications</a> |
| Public note | Link to access the E-book |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | |
No items available.