🏠 Home | 👤 My Account | 🔍 Advanced Search | 📚 About Library | 📚 New Arrivals
Amazon cover image
Image from Amazon.com

Fundamentals of Data Structures in C_2nd Edition

By: Publication details: Universities Press Telangana 2023Edition: 2Description: 664 Item Weight ‏ : ‎ 920 g Dimensions ‏ : ‎ 20.3 x 25.4 x 4.7 cmISBN:
  • 978-8173716058
Subject(s): DDC classification:
  • 005.73 HOR
Summary: This new edition 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, this text presents advanced or 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 discusses several trie variations and their application to Internet packet forwarding.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Shelving location Call number Status Barcode
Text Book VAST Central Library Computer Science and Engineering S-21/CS 005.73 HOR (Browse shelf(Opens below)) Available 38168

This new edition 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, this text presents advanced or 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 discusses several trie variations and their application to Internet packet forwarding.

There are no comments on this title.

to post a comment.