Fundamentals of Data Structures in C ; GSC002257. GSC002258 / Ellis, Horowitz, Sartaj Sahni and Susan Anderson-Freed / Text/
Material type:
TextPublication details: India Universities Press 2007 Description: 617pgs (Inc Index) , : PbISBN: 9788173716058Subject(s): Computer Science | Fundamentals - Data Sturctures in C | Basic Concepts - Data Structures in CDDC classification: 005.73 H816F Online resources: Click here to access online
| Item type | Current library | Call number | Copy number | Status | Date due | Barcode |
|---|---|---|---|---|---|---|
General
|
Cawston Learning Resource Centre BNU Section | 005.73 H816F (Browse shelf(Opens below)) | C.1 | Available | H816 F | |
|
General
|
Cawston Learning Resource Centre BNU Section | 005.73 H816F (Browse shelf(Opens below)) | C.2 | Available | 049809 |
The classic data structure textbook provides a comprehensive and technically rigorous introduction to data structures such as arrays, stacks, queues, linked lists, trees and graphs, and techniques such as sorting hashing that form the basis of all software. In addition, it presents advanced of specialized data structures such as priority queues, efficient binary search trees, multiway search trees and digital search structures. The book now discusses topics such as weight biased leftist trees, pairing heaps, symmetric min-max heaps, interval heaps, top-down splay trees, B+ trees and suffix trees. Red-black trees have been made more accessible. The section on multiway tries has been significantly expanded and several trie variations and their application to Interner packet forwarding have been disused
Includes bibliographical references and index
There are no comments on this title.