{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":18,"n_cols":5,"rows_kept":18,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[11,2,11,3],[12,2,12,3],[16,2,16,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910153115803321"]
[null,null,"Autore",null,"Weiss Mark Allen"]
[null,null,"Titolo",null,"Data structures and problem solving using Java / / Mark A. Weiss"]
[null,null,"Pubbl/distr/stampa",null,"Harlow, England : , : Pearson, , [2014]"]
[{"$nulls":4},"©2014"]
[null,null,"ISBN",null,"1-292-03818-7"]
[null,null,"Edizione",null,"[Fourth, pearson new international edition.]"]
[null,null,"Descrizione fisica",null,"1 online resource (944 pages) : illustrations (some color)"]
[null,null,"Collana",null,"Always learning"]
[null,null,"Disciplina",null,"005.133"]
[null,null,"Soggetti",null,"Java (Computer program language)"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Includes index."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Cover -- 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."]
[null,null,null,"Sommario/riassunto","For 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."]