Data Structures in Java

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Campesato, Oswald
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Bloomfield : Mercury Learning & Information, 2023.
Temas:
Java (Computer program language)
Data structures (Computer science)
Acceso en línea:Texto completo
Tabla de Contenidos:
  • Cover
  • Title Page
  • Copyright
  • Dedication
  • Contents
  • Preface
  • Chapter 1: Introduction to Java
  • A Very Brief Introduction to Java
  • Downloading a Java Release (Short Version)
  • Selecting a Version of Java (Detailed Version)
  • Java 8 and Java 11
  • Java Version Numbers
  • JRE Versus a JDK
  • Java Distributions
  • Java IDEs
  • Data Types, Operators, and Their Precedence
  • Java Comments
  • Java Operators
  • Creating and Compiling Java Classes
  • "Hello World" and Working With Numbers
  • The Java String Class
  • Java Strings With Metacharacters
  • The Java New Operator
  • Equality of Strings
  • Comparing Strings
  • Searching for a Substring in Java
  • Useful String Methods in Java
  • Parsing Strings in Java
  • Conditional Logic in Java
  • Determining Leap Years
  • Finding the Divisors of a Number
  • Checking for Palindromes
  • Working With Arrays of Strings
  • Working With the StringBuilder Class
  • Static Methods in Java
  • Other Static Types in Java
  • Summary
  • Chapter 2: Recursion and Combinatorics
  • What Is Recursion?
  • Arithmetic Series
  • Calculating Arithmetic Series (Iterative)
  • Calculating Arithmetic Series (Recursive)
  • Calculating Partial Arithmetic Series
  • Geometric Series
  • Calculating a Geometric Series (Iterative)
  • Calculating Geometric Series (Recursive)
  • Factorial Values
  • Calculating Factorial Values (Iterative)
  • Calculating Factorial Values (Recursive)
  • Calculating Factorial Values (Tail Recursion)
  • Fibonacci Numbers
  • Calculating Fibonacci Numbers (Recursive)
  • Calculating Fibonacci Numbers (Iterative)
  • Task: Reverse a String via Recursion
  • Task: Check for Balanced Parentheses
  • Task: Calculate the Number of Digits
  • Task: Determine if a Positive Integer is Prime
  • Task: Find the Prime Divisors of a Positive Integer
  • Task: Goldbach's Conjecture
  • Task: Calculate the GCD (Greatest Common Divisor)
  • Task: Calculate the LCM (Lowest Common Multiple)
  • What Is Combinatorics?
  • Working With Permutations
  • Working With Combinations
  • The Number of Subsets of a Finite Set
  • Task: Subsets Containing a Value Larger Than k
  • Summary
  • Chapter 3: Strings and Arrays
  • Time and Space Complexity
  • Task: Maximum and Minimum Powers of an Integer
  • Task: Binary Substrings of a Number
  • Task: Common Substring of Two Binary Numbers
  • Task: Multiply and Divide via Recursion
  • Task: Sum of Prime and Composite Numbers
  • Task: Count Word Frequencies
  • Task: Check if a String Contains Unique Characters
  • Task: Insert Characters in a String
  • Task: String Permutations
  • Task: Check for Palindromes
  • Task: Check for Longest Palindrome
  • Working With Sequences of Strings
  • The Maximum Length of a Repeated Character in a String
  • Find a Given Sequence of Characters in a String
  • Task: Longest Sequences of Substrings
  • The Longest Sequence of Unique Characters
  • The Longest Repeated Substring
  • Working With 1D Arrays

Ejemplares similares