LEADER 01338cam2-2200397---450 001 990001427460203316 005 20200402090057.0 035 $a000142746 035 $aUSA01000142746 035 $a(ALEPH)000142746USA01 035 $a000142746 100 $a20040216d1954----km-y0itay50------ba 101 0 $aita 102 $aIT 105 $aa|||z|||001yy 200 1 $a<>: 1888-1891$fGiosuč Carducci 210 $aBologna$cZanichelli$dstampa 1954 215 $a379 p., [1] carta di tav.$critr.$d21 cm 461 0$1001000143241$12001$aEdizione nazionale delle opere di Giosue Carducci 462 0$1001000142710$12001$aLettere 700 1$aCARDUCCI,$bGiosuč$0439461 801 0$aIT$bsalbc$gISBD 912 $a990001427460203316 951 $aVI.3.E. 269/31/17(V A 4/17)$b5044 L.M.$cVI.3.$d00040639 951 $aVI.3.E. 269/31/17a(V A cont. 3/17)$b65864 L.M.$cVI.3.$d00046957 959 $aBK 969 $aUMA 979 $aSIAV8$b10$c20040216$lUSA01$h1635 979 $aPATRY$b90$c20040406$lUSA01$h1740 979 $aCOPAT1$b90$c20060117$lUSA01$h1331 979 $aANNAMARIA$b90$c20081204$lUSA01$h1109 979 $aANNAMARIA$b90$c20081209$lUSA01$h1132 979 $aANNAMARIA$b90$c20120917$lUSA01$h0915 979 $aANNAMARIA$b90$c20160129$lUSA01$h1001 996 $a1888-1891$9930840 997 $aUNISA LEADER 06629nam 22007455 450 001 9910300476403321 005 20200704224612.0 010 $a9781430266204 010 $a1430266201 024 7 $a10.1007/978-1-4302-6620-4 035 $a(CKB)3710000000089043 035 $a(EBL)1694234 035 $a(OCoLC)870904380 035 $a(SSID)ssj0001174399 035 $a(PQKBManifestationID)11667692 035 $a(PQKBTitleCode)TC0001174399 035 $a(PQKBWorkID)11107879 035 $a(PQKB)10563669 035 $a(MiAaPQ)EBC1694234 035 $a(DE-He213)978-1-4302-6620-4 035 $a(WaSeSS)IndRDA00019386 035 $a(CaSebORM)9781430266198 035 $a(PPN)176750282 035 $a(OCoLC)ocn870904380 035 $a(EXLCZ)993710000000089043 100 $a20140228d2014 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aAdvanced Topics in Java $eCore Concepts in Data Structures /$fby Noel Kalicharan 205 $a1st ed. 2014. 210 1$aBerkeley, CA :$cApress :$cImprint: Apress,$d2014. 215 $a1 online resource (322 p.) 225 1 $aExpert's Voice in Java 300 $aIncludes index. 311 08$a9781430266198 311 08$a1430266198 327 $a""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"" 327 $a""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"" 327 $a""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 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"" 327 $a""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"" 327 $a""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"" 327 $a""5.2 Writing Recursive Functions in Java"" 330 $aJava 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. 410 0$aExpert's voice in Java. 517 3 $aCore concepts in data structures 606 $aJava (Computer program language) 606 $aSoftware engineering 606 $aJava$3https://scigraph.springernature.com/ontologies/product-market-codes/I29070 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 615 0$aJava (Computer program language) 615 0$aSoftware engineering. 615 14$aJava. 615 24$aSoftware Engineering/Programming and Operating Systems. 676 $a004 676 $a005.2 700 $aKalicharan$b Noel$4aut$4http://id.loc.gov/vocabulary/relators/aut$0846188 801 0$bUMI 801 1$bUMI 906 $aBOOK 912 $a9910300476403321 996 $aAdvanced Topics in Java$92175738 997 $aUNINA