Fundamentals of data structures in C Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed

By:

Horowitz, Ellis

Contributor(s):

Publication details: Universities Press 2008 HyderabadEdition: 2/eDescription: xvii, 617p 23cmISBN:

9788173716058

Subject(s):

DDC classification:

004.422 HOR

Contents:

BASIC CONCEPTS ARRAYS AND STRUCTURES STACKS AND QUEUES LINKED LISTS TREES GRAPHS SORTING HASHING PRIORITY QUEUES EFFICIENT BINARY SEARCH TREES MULTI WAY SEARCH TREES DIGITAL SEARCH STRUCTURES

Summary: 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

List(s) this item appears in: New Arrivals March 2021 - Central Library IIITDMK

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 2.0 (1 votes)

Holdings ( 15 )
Title notes ( 2 )
Comments ( 0 )

Holdings
Item type	Current library	Collection	Call number	Status	Notes	Barcode
Books	IIITDM Kurnool General Stacks	Non-fiction	004.422 HOR (Browse shelf(Opens below))	Available		0003287
Books	IIITDM Kurnool General Stacks	Non-fiction	004.422 HOR (Browse shelf(Opens below))	Available		0003288
Books	IIITDM Kurnool General Stacks	Non-fiction	004.422 HOR (Browse shelf(Opens below))	Available		0003289
Books	IIITDM Kurnool General Stacks	Non-fiction	004.422 HOR (Browse shelf(Opens below))	Available		0003290
Reference	IIITDM Kurnool Reference	Reference	004.422 HOR (Browse shelf(Opens below))	Not For Loan		0003291
Books	IIITDM Kurnool General Stacks	Non-fiction	004.422 HOR (Browse shelf(Opens below))	Available		0001625
Books	IIITDM Kurnool General Stacks	Non-fiction	004.422 HOR (Browse shelf(Opens below))	Available		0001626
Books	IIITDM Kurnool General Stacks	Non-fiction	004.422 HOR (Browse shelf(Opens below))	Available		0001627
Books	IIITDM Kurnool General Stacks	Non-fiction	004.422 HOR (Browse shelf(Opens below))	Available		0001628
Books	IIITDM Kurnool General Stacks	Non-fiction	004.422 HOR (Browse shelf(Opens below))	Available		0001629
Books	IIITDM Kurnool General Stacks	Non-fiction	004.422 HOR (Browse shelf(Opens below))	Available	CSE	0000297
Books	IIITDM Kurnool General Stacks	Non-fiction	004.422 HOR (Browse shelf(Opens below))	Available	CSE	0000298
Books	IIITDM Kurnool General Stacks	Non-fiction	004.422 HOR (Browse shelf(Opens below))	Available	CSE	0000299
Books	IIITDM Kurnool General Stacks	Non-fiction	004.422 HOR (Browse shelf(Opens below))	Available	CSE	0000300
Books	IIITDM Kurnool General Stacks	Non-fiction	004.422 HOR (Browse shelf(Opens below))	Available	CSE	0000301

BASIC CONCEPTS ARRAYS AND STRUCTURES STACKS AND QUEUES LINKED LISTS TREES GRAPHS SORTING HASHING PRIORITY QUEUES EFFICIENT BINARY SEARCH TREES MULTI WAY SEARCH TREES DIGITAL SEARCH STRUCTURES

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

There are no comments on this title.

to post a comment.