000			02022nam a2200253Ia 4500
003			NULRC
005			20250520102719.0
008			250520s9999 xx 000 0 und d
020			_a9781118771334
040			_cNULRC
050			_aQA 76.73.J38 .G66 2014
100			_aGoodrich, Michael T. _eauthor
245		0	_aData structures and algorithms in Java / _cMichael T. Goodrich, Roberto Tamassia and Michael H. Goldwasser
250			_aSIXTH EDITION
260			_aHoboken, New Jersey : _bJohn Wiley & Son, Inc., _cc2014
300			_axvi, 720 pages : _billustrations ; _c23 cm.
365			_bUSD138.54
504			_aIncludes bibliographical references and index.
505			_a1. Java primer -- 2. Object-oriented design -- 3. Fundamental data structures -- 4. Algorithm analysis -- 5. Recursion -- 6. Stacks, queues and deques -- 7. List and iterator ADTs -- 8.Trees -- 9. Priority queues -- 10. Maps, hash tables and skip lists -- 11. Search trees -- 12. Sorting and selection -- 13. Text processing -- 14. Graph algorithm -- 15.Memory management and B-Trees.
520			_aThe design and analysis of efficient data structures has long been recognized as a key component of the Computer Science curriculum. Goodrich and Tomassia's approach to this classic topic is based on the object-oriented paradigm as the framework of choice for the design of data structures. For each ADT presented in the text, the authors provide an associated Java interface. Concrete data structures realizing the ADTs are provided as Java classes implementing the interfaces. The Java code implementing fundamental data structures in this book is organized in a single Java package, net.datastructures. This package forms a coherent library of data structures and algorithms in Java specifically designed for educational purposes in a way that is complimentary with the Java Collections Framework.
650			_aCOMPUTER ALGORITHMS
700			_aTammassia, Roberto ;Michael H. Goldwasser _eco-author ;co-author
942			_2lcc _cBK
999			_c13586 _d13586