000			02118nam a2200229Ia 4500
003			NULRC
005			20250520102719.0
008			250520s9999 xx 000 0 und d
020			_a9781466589896
040			_cNULRC
050			_aQA 76.73.J28 .J64 2014
100			_aJohnson, Mark J. _eauthor
245		2	_aA Concise introduction to data structures using Java / _cMark J. Johnson
260			_aBoca Raton, Florida : _bCRC Press, _cc2014
300			_axvii, 218 pages : _billustrations ; _c24 cm.
365			_bUSD53.96
504			_aIncludes bibliographical references and index.
505			_a1. A brief introduction to Java -- 2. Algorithm analysis -- 3. Integer stacks -- 4. Generic stacks -- 5.Queues -- 6. Lists -- 7. Recursion -- 8. Trees -- 9. Binary search trees -- 10. Heaps -- 11. Hash tables.
520			_aA student-friendly text, A Concise Introduction to Data Structures Using Java takes a developmental approach, starting with simpler concepts first and then building toward greater complexity. Important topics, such as linked lists, are introduced gradually and revisited with increasing depth. More code and guidance are provided at the beginning, allowing students time to adapt to Java while also beginning to learn data structures. As students develop fluency in Java, less code is provided and more algorithms are outlined in pseudocode. The text is designed to support a second course in computer science with an emphasis on elementary data structures. The clear, concise explanations encourage students to read and engage with the material, while partial implementations of most data structures give instructors the flexibility to develop some methods as examples and assign others as exercises. The book also supplies an introductory chapter on Java basics that allows students who are unfamiliar with Java to quickly get up to speed. The book helps students become familiar with how to use, design, implement, and analyze data structures, an important step on the path to becoming skilled software developers.
650			_aJAVA (COMPUTER PROGRAM LANGUAGE)
942			_2lcc _cBK
999			_c13587 _d13587