000			02002nam a2200217Ia 4500
008			210916s9999 xx 000 0 und d
020			_a9788120337312
082			_a005.1 _bSAM
100			_aSamanta, Debasis _94941
245		0	_aClassic data structures
250			_a2nd ed.
260			_aDelhi _bPHI Learning _c2019
300			_a808p.
520			_aThis book is the second edition of a text designed for undergraduate engineering courses in Data Structures. The treatment of the subject matter in this second edition maintains the same general philosophy as in the first edition but with significant additions. These changes are designed to improve the readability and understandability of all algorithms so that the students acquire a firm grasp of the key concepts. The book provides a complete picture of all important data structures used in modern programming practice. It shows : ? various ways of representing a data structure ? different operations to manage a data structure ? several applications of a data structure The algorithms are presented in English-like constructs for ease of comprehension by students, though all of them have been implemented separately in C language to test their correctness. Key Features : ? Red-black tree and spray tree are discussed in detail ? Includes a new chapter on Sorting ? Includes a new chapter on Searching ? Includes a new appendix on Analysis of Algorithms for those who may be unfamiliar with the concepts of algorithms ? Provides numerous section-wise assignments in each chapter ? Also included are exercises?Problems to Ponder?in each chapter to enhance learning The book is suitable for students of : (i) computer science (ii) computer applications (iii) information and communication technology (ICT)
650			_aData Structures _94942
650			_aC language _91355
650			_acomputer applications _94943
650			_acomputer science _9400
650			_aInformation and communication technology (ICT) _94944
942			_cBK
999			_c6913 _d6913