{"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":28,"n_cols":5,"rows_kept":28,"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],[4,2,4,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[11,2,11,3],[15,2,15,3],[16,2,16,3],[20,2,20,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910300476403321"]
[null,null,"Autore",null,"Kalicharan Noel"]
[null,null,"Titolo",null,"Advanced Topics in Java : Core Concepts in Data Structures / / by Noel Kalicharan"]
[null,null,"Pubbl/distr/stampa",null,"Berkeley, CA : , : Apress : , : Imprint : Apress, , 2014"]
[null,null,"ISBN",null,"9781430266204"]
[{"$nulls":4},"1430266201"]
[null,null,"Edizione",null,"[1st ed. 2014.]"]
[null,null,"Descrizione fisica",null,"1 online resource (322 p.)"]
[null,null,"Collana",null,"Expert's Voice in Java"]
[null,null,"Disciplina",null,"004"]
[{"$nulls":4},"005.2"]
[null,null,"Soggetti",null,"Java (Computer program language)"]
[{"$nulls":4},"Software engineering"]
[{"$nulls":4},"Java"]
[{"$nulls":4},"Software Engineering/Programming and Operating Systems"]
[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,"\"\"Contents at a Glance\"\"; \"\"Contents\"\"; \"\"About the Author\"\"; \"\"About the Technical Reviewers\"\"; \"\"Preface\"\"; \"\"Chapter 1: Sorting, Searching, and Merging\"\"; \"\"1.1 Sorting an Array: Selection Sort\"\"; \"\"1.1.1 Analysis of Selection Sort\"\"; \"\"1.2 Sorting an Array: Insertion Sort\"\"; \"\"1.2.1 Analysis of Insertion Sort\"\"; \"\"1.3 Inserting an Element in Place\"\"; \"\"1.4 Sorting a String Array\"\"; \"\"1.5 Sorting Parallel Arrays\"\"; \"\"1.6 Binary Search\"\"; \"\"1.7 Searching an Array of Strings\"\"; \"\"1.8 Example: Word Frequency Count\"\"; \"\"1.9 Merging Ordered Lists\"\"; \"\"1.9.1 Implementing the Merge\"\""]
[{"$nulls":4},"\"\"Chapter 2: Introduction to Objects\"\"\"\"2.1 Objects\"\"; \"\"2.2 Defining Classes and Creating Objects\"\"; \"\"2.2.1 Access to Class and Instance Variables\"\"; \"\"2.2.2 Initializing Class and Instance Variables\"\"; \"\"2.3 Constructors\"\"; \"\"2.3.1 Overloading a Constructor\"\"; \"\"2.4 Data Encapsulation, Accessor, and Mutator Methods\"\"; \"\"2.4.1 An Improved Constructor\"\"; \"\"2.4.2 Accessor Methods\"\"; \"\"2.5 Printing an Objectâ€?s Data\"\"; \"\"2.5.3 Using the toString() Method\"\"; \"\"2.6.1 Testing the Class Part\"\"; \"\"2.7 How to Name Your Java Files\"\"; \"\"2.8 Working with Objects\"\""]
[{"$nulls":4},"\"\"2.8.1 Assigning an Object Variable to Another\"\"\"\"2.8.2 Losing Access to an Object\"\"; \"\"2.8.3 Comparing Object Variables\"\"; \"\"2.10 Passing an Object as an Argument\"\"; \"\"2.11 Array of Objects\"\"; \"\"2.11.1 Finding the Part with the Lowest Price\"\"; \"\"2.12 Searching an Array of Objects\"\"; \"\"2.13 Sorting an Array of Objects\"\"; \"\"2.15 How to Return More Than "]
[{"$nulls":4},"One Value: Voting\"\"; \"\"Chapter 3: Linked Lists\"\"; \"\"3.1 Defining Linked Lists\"\"; \"\"3.2 Basic Operations on a Linked List\"\"; \"\"3.2.1 Counting the Nodes in a Linked List\"\"; \"\"3.2.2 Searching a Linked List\"\""]
[{"$nulls":4},"\"\"3.2.3 Finding the Last Node in a Linked List\"\"\"\"3.3 Building a Linked List: Adding a New Item at the Tail\"\"; \"\"3.4 Insertion Into a Linked List\"\"; \"\"3.5 Building a Linked List: Adding a New Item at the Head\"\"; \"\"3.6 Deletion from a Linked List\"\"; \"\"3.7 Building a Sorted Linked List\"\"; \"\"3.8 A Linked List Class\"\"; \"\"3.9 How to Organize Java Files\"\"; \"\"3.10 Expanding the LinkedList Class\"\"; \"\"3.11 Example: Palindrome\"\"; \"\"3.12 Saving a Linked List\"\"; \"\"3.13 Arrays vs. Linked Lists\"\"; \"\"3.14 Storing a Linked List Using Arrays\"\"; \"\"3.15 Merging Two Sorted Linked Lists\"\""]
[{"$nulls":4},"\"\"3.16 Circular and Two-Way Linked Lists\"\"\"\"3.16.1 Circular Lists\"\"; \"\"3.16.2 Two-Way (Doubly Linked) Lists\"\"; \"\"Chapter 4: Stacks and Queues\"\"; \"\"4.1 Abstract Data Types\"\"; \"\"4.2 Stacks\"\"; \"\"4.2.1 Implementing a Stack Using an Array\"\"; \"\"4.2.2 Implementing a Stack Using a Linked List\"\"; \"\"4.3 A General Stack Type\"\"; \"\"4.3.1 Example: Convert from Decimal to Binary\"\"; \"\"4.4 How to Convert from Infix to Postfix\"\"; \"\"4.4.1 Evaluating an Arithmetic Expression\"\"; \"\"4.5 Queues\"\"; \"\"4.5.1 Implementing a Queue Using an Array\"\"; \"\"Chapter 5: Recursion\"\"; \"\"5.1 Recursive Definition\"\""]
[{"$nulls":4},"\"\"5.2 Writing Recursive Functions in Java\"\""]
[null,null,null,"Sommario/riassunto","Java is one of the most widely used programming languages today. It was first released by Sun Microsystems in 1995. Over the years, its popularity has grown to the point where it plays an important role in most of our lives. From laptops to data centers, game consoles to scientific supercomputers, cell phones to the Internet, Java is everywhere! There are tons of applications and heaps of websites that will not work unless you have Java installed, and more are created every day. And, of course, Java is used to power what has become the world's most dominant mobile platform, Android. Advanced Topics In Java teaches the algorithms and concepts that any budding software developer should know. You'll delve into topics such as sorting, searching, merging, recursion, random numbers and simulation, among others. You will increase the range of problems you can solve when you learn how to create and manipulate versatile and popular data structures such as binary trees and hash tables. This book assumes you have a working knowledge of basic programming concepts such as variables, constants, assignment, selection (if..else) and looping (while, for). It also assumes you are comfortable with writing functions and working with arrays. If you study this book carefully and do the exercises conscientiously, you would become a better and more agile software developer, more prepared to code today's applications - no matter the language."]