LEADER 03412nam 2200601 450 001 9910153115803321 005 20230803220301.0 010 $a1-292-03818-7 035 $a(CKB)2550000001126570 035 $a(SSID)ssj0001256832 035 $a(PQKBManifestationID)12514531 035 $a(PQKBTitleCode)TC0001256832 035 $a(PQKBWorkID)11293241 035 $a(PQKB)11108650 035 $a(MiAaPQ)EBC5174926 035 $a(MiAaPQ)EBC5176182 035 $a(MiAaPQ)EBC5832146 035 $a(MiAaPQ)EBC5139034 035 $a(MiAaPQ)EBC6399441 035 $a(Au-PeEL)EBL5139034 035 $a(CaONFJC)MIL527233 035 $a(OCoLC)1015865903 035 $a(EXLCZ)992550000001126570 100 $a20210401d2014 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt 182 $cc 183 $acr 200 10$aData structures and problem solving using Java /$fMark A. Weiss 205 $aFourth, pearson new international edition. 210 1$aHarlow, England :$cPearson,$d[2014] 210 4$dİ2014 215 $a1 online resource (944 pages) $cillustrations (some color) 225 1 $aAlways learning 300 $aIncludes index. 311 $a1-292-02576-X 311 $a1-299-95982-2 320 $aIncludes bibliographical references and index. 327 $aCover -- Table of Contents -- 1. Primitive Java -- 2. Reference Types -- 3. Objects and Classes -- 4. Inheritance -- 5. Algorithm Analysis -- 6. The Collections API -- 7. Recursion -- 8. Sorting Algorithms -- 9. Randomization -- 10. Fun and Games -- 11. Stacks and Compilers -- 12. Utilities -- 13. Graphs and Paths -- 14. Inner Classes and Implementation of ArrayList -- 15. Stacks and Queues -- 16. Linked Lists -- 17. Trees -- 18. Binary Search Trees -- 19. Hash Tables -- 20. A Priority Queue: The Binary Heap -- 21. Splay Trees -- 22. Merging Priority Queues -- 23. The Disjoint Set Class -- Appendix: Operators -- Appendix: Graphical User Interfaces -- Appendix: Bitwise Operations -- Index -- 1. 330 $aFor the second or third programming course.   A practical and unique approach to data structures that separates interface from implementation.   This book provides a practical introduction to data structures with an emphasis on abstract thinking and problem solving, as well as the use of Java. It does this through what remains a unique approach that clearly separates each data structure's interface (how to use a data structure) from its implementation (how to actually program that structure). Parts I (Tour of Java), II (Algorithms and Building Blocks), and III (Applications) lay the groundwork by discussing basic concepts and tools and providing some practical examples, while Part IV (Implementations) focuses on implementation of data structures. This forces the reader to think about the functionality of the data structures before the hash table is implemented.   The Fourth Edition features many new updates as well as new exercises. 410 0$aAlways learning. 606 $aJava (Computer program language) 615 0$aJava (Computer program language) 676 $a005.133 700 $aWeiss$b Mark Allen$061502 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910153115803321 996 $aData structures and problem solving using Java$93408704 997 $aUNINA