LEADER 00000cam a2200841Ia 4500 001 870904380 003 OCoLC 005 20240129213017.0 006 m o d 007 cr unu|||||||| 008 140221s2014 nyua o 001 0 eng d 019 880827068|a961603830|a1005788324|a1026429514|a1048150483 |a1065928698|a1066433264|a1069667453|a1086530808 |a1111055483|a1203990306 020 9781430266204|q(electronic bk.) 020 1430266201|q(electronic bk.) 024 7 10.1007/978-1-4302-6620-4|2doi 029 1 AU@|b000053305663 029 1 AU@|b000059644846 029 1 AU@|b000060583806 029 1 CHNEW|b000887684 029 1 CHVBK|b374466017 029 1 DEBBG|bBV041784149 029 1 DEBBG|bBV042989612 029 1 DEBBG|bBV043609463 029 1 DEBSZ|b404338690 029 1 DEBSZ|b407738959 029 1 NZ1|b15579431 029 1 AU@|b000072992196 035 (OCoLC)870904380|z(OCoLC)880827068|z(OCoLC)961603830 |z(OCoLC)1005788324|z(OCoLC)1026429514|z(OCoLC)1048150483 |z(OCoLC)1065928698|z(OCoLC)1066433264|z(OCoLC)1069667453 |z(OCoLC)1086530808|z(OCoLC)1111055483|z(OCoLC)1203990306 037 CL0500000388|bSafari Books Online 040 UMI|beng|epn|cUMI|dB24X7|dGW5XE|dCOO|dDEBBG|dOCLCO|dS4S |dIDEBK|dYDXCP|dDEBSZ|dE7B|dCDX|dEBLCP|dOCLCQ|dOCLCF|dVT2 |dOCLCQ|dLIV|dMERUC|dOCLCQ|dESU|dOCLCQ|dN$T|dREB|dIOG|dCEF |dINT|dU3W|dAU@|dOCLCQ|dWYU|dYOU|dUWO|dOCLCQ|dUAB|dUKAHL |dOCLCQ|dDCT|dOCLCQ|dBRF|dOCLCO|dOCLCQ|dOCLCO 049 INap 082 04 005.13/3 082 04 005.13/3|223 099 eBook O'Reilly for Public Libraries 100 1 Kalicharan, Noel. 245 10 Advanced topics in Java :|bcore concepts in data structures /|cNoel Kalicharan.|h[O'Reilly electronic resource] 246 30 Core concepts in data structures 260 [Berkeley, CA] :|bApress,|c©2014. 300 1 online resource (1 volume) :|billustrations 336 text|btxt|2rdacontent 337 computer|bc|2rdamedia 338 online resource|bcr|2rdacarrier 347 text file|bPDF|2rda 490 1 The expert's voice in Java 505 0 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 505 8 Chapter 2: Introduction to Objects2.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 Objectâ€?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 505 8 2.8.1 Assigning an Object Variable to Another2.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 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 505 8 3.2.3 Finding the Last Node in a Linked List3.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 505 8 3.16 Circular and Two-Way Linked Lists3.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 520 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. 588 0 Online resource; title from PDF title page (EBSCO, viewed November 30, 2017). 590 O'Reilly|bO'Reilly Online Learning: Academic/Public Library Edition 650 0 Java (Computer program language) 650 0 Data structures (Computer science) 650 6 Java (Langage de programmation) 650 6 Structures de données (Informatique) 650 7 Data structures (Computer science)|2fast 650 7 Java (Computer program language)|2fast 773 0 |tSpringer eBooks 776 08 |iPrinted edition:|z9781430266198 830 0 Expert's voice in Java. 856 40 |uhttps://ezproxy.naperville-lib.org/login?url=https:// learning.oreilly.com/library/view/~/9781430266198/?ar |zAvailable on O'Reilly for Public Libraries 938 Askews and Holts Library Services|bASKH|nAH29483094 938 Books 24x7|bB247|nbks00062134 938 Coutts Information Services|bCOUT|n28232990 938 EBL - Ebook Library|bEBLB|nEBL1694234 938 ebrary|bEBRY|nebr10845439 938 EBSCOhost|bEBSC|n1173936 938 ProQuest MyiLibrary Digital eBook Collection|bIDEB |ncis28232990 938 YBP Library Services|bYANK|n11694404 994 92|bJFN