Cargando…

Advanced topics in Java : core concepts in data structures /

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, c...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Kalicharan, Noel
Formato: Electrónico eBook
Idioma:Inglés
Publicado: [Berkeley, CA] : Apress, ©2014.
Colección:Expert's voice in Java.
Temas:
Acceso en línea:Texto completo (Requiere registro previo con correo institucional)
Tabla de Contenidos:
  • 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
  • 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
  • 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
  • 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
  • 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