000 02388nam a2200241Ia 4500
003 NULRC
005 20250520100704.0
008 250520s9999 xx 000 0 und d
020 _a9780133744057
040 _cNULRC
050 _aQA 76.9.D33 .C37 2015
100 _aCarrano, Frank M.
_eauthor
245 0 _aData structures and abstractions with JavaTM /
_cFrank M. Carrano and Timothy M. Henry
250 _aFourth edition
260 _aHarlow, Essex, England :
_bPearson Education Limited,
_cc2015
300 _axxviii, 897 pages :
_billustrations ;
_c26 cm.
365 _bUSD433.69
505 _aIntroduction: organizing data -- 1. Bags -- 2. Bag implementations that use arrays -- 3. A bag implementation that links data -- 4.The efficiency of algorithms -- 5.Stacks -- 6.Stack implementations -- 7. Recursion -- 8. An introduction to sorting -- 9. Faster sorting methods -- 10.Queues, deques, and priority queues -- 11. Queue, deque, and priority queue implementations -- 12. Lists -- 13. A list implementation that uses an array -- 14. A list implementation that links data -- 15. Iterators for the ADT list -- 16. Sorted lists -- 17. Inheritance and lists -- 18. Searching -- 19. Dictionaries -- 20. Dictionary implementations -- 21.Introducing hashing -- 22. Hashing as a dictionary implementation -- 23.Trees -- 24. Tree implementations -- 25. A binary search tree implementation -- 26. A heap implementation -- 27. Balanced search trees -- 28. Graphs -- 29. Graph implementations.
520 _aData Structures and Abstractions with Java is suitable for one- or two-semester courses in data structures (CS-2) in the departments of Computer Science, Computer Engineering, Business, and Management Information Systems. This book is also useful for programmers and software engineers interested in learning more about data structures and abstractions. This is the most student-friendly data structures text available that introduces ADTs in individual, brief chapters — each with pedagogical tools to help students master each concept. Using the latest features of Java, this unique object-oriented presentation makes a clear distinction between specification and implementation to simplify learning, while providing maximum classroom flexibility.
650 _aDATA STRUCTURES (COMPUTER SCIENCE)
700 _aHenry, Timothy M.
_eco-author
942 _2lcc
_cBK
999 _c11469
_d11469