book

JAVA Basics Using ChatGPT/GPT-4

Name: JAVA Basics Using ChatGPT/GPT-4
Author: Oswald Campesato
ISBN: 9781501518973

by Oswald Campesato

December 2023

Intermediate to advanced

315 pages

6h 52m

English

Mercury Learning and Information

Read now

Unlock full access

Cover
Halftitle
Title
Copyright
Dedication
Contents
Preface
Chapter 1: Introduction to Java
A Very Brief Introduction to JavaDownloading a Java Release (Short Version)Selecting a Version of Java (Detailed Version)Java 8 and Java 11Java Version NumbersJRE Versus a JDKJava DistributionsJava IDEsData Types, Operators, and Their PrecedenceJava CommentsJava OperatorsCreating and Compiling Java Classes“Hello World” and Working With NumbersThe Java String ClassJava Strings With MetacharactersThe Java new OperatorEquality of StringsComparing StringsSearching for a Substring in JavaUseful String Methods in JavaParsing Strings in JavaConditional Logic in JavaDetermining Leap YearsFinding the Divisors of a NumberChecking for PalindromesWorking With Arrays of StringsWorking With the StringBuilder ClassWorking With the StringBuffer ClassStatic Methods in JavaOther Static Types in JavaSummary
Chapter 2: Recursion and Combinatorics
What Is Recursion?Arithmetic SeriesCalculating Arithmetic Series (Iterative)Calculating Arithmetic Series (Recursive)Calculating Partial Arithmetic SeriesGeometric SeriesCalculating a Geometric Series (Iterative)Calculating Geometric Series (Recursive)Factorial ValuesCalculating Factorial Values (Iterative)Calculating Factorial Values (Recursive)Calculating Factorial Values (Tail Recursion)Fibonacci NumbersCalculating Fibonacci Numbers (Recursive)Calculating Fibonacci Numbers (Iterative)Task: Reverse a String via RecursionTask: Check for Balanced ParenthesesTask: Calculate the Number of DigitsTask: Determine if a Positive Integer Is PrimeTask: Find the Prime Divisors of a Positive IntegerTask: Goldbach’s ConjectureTask: Calculate the GCD (Greatest Common Divisor)Task: Calculate the LCM (Lowest Common Multiple)What Is Combinatorics?Working With PermutationsWorking With CombinationsThe Number of Subsets of a Finite SetTask: Subsets Containing a Value Larger than kSummary
Chapter 3: Strings and Arrays
Time and Space ComplexityTask: Maximum and Minimum Powers of an IntegerTask: Binary Substrings of a NumberTask: Common Substring of Two Binary NumbersTask: Multiply and Divide via RecursionTask: Sum of Prime and Composite NumbersTask: Count Word FrequenciesTask: Check if a String Contains Unique CharactersTask: Insert Characters in a StringTask: String PermutationsTask: Check for PalindromesTask: Check for the Longest PalindromeWorking With Sequences of StringsThe Maximum Length of a Repeated Character in a StringFind a Given Sequence of Characters in a StringTask: The Longest Sequences of SubstringsThe Longest Sequence of Unique CharactersThe Longest Repeated SubstringWorking With 1D ArraysRotate an ArrayTask: Invert Adjacent Array ElementsTask: Shift Nonzero Elements LeftwardTask: Sort Array In-Place in O(n) Without a Sort FunctionTask: Generate 0 That Is Three Times More Likely than a 1Task: Invert Bits in Even and Odd PositionsTask: Check for Adjacent Set Bits in a Binary NumberTask: Count Bits in a Range of NumbersTask: Find the Right-Most Set Bit in a NumberTask: The Number of Operations to Make All Characters EqualTask: Compute XOR Without XOR for Two Binary NumbersTask: Swap Adjacent Bits in Two Binary NumbersWorking With 2D ArraysThe Transpose of a MatrixSummary

Chapter 4: Search and Sort Algorithms
Search AlgorithmsLinear SearchBinary Search Walk-ThroughBinary Search (Iterative Solution)Binary Search (Recursive Solution)Well-Known Sorting AlgorithmsBubble SortFind Anagrams in a List of WordsSelection SortInsertion SortComparison of Sort AlgorithmsMerge SortMerge Sort With a Third ArrayMerge Sort Without a Third ArrayMerge Sort: Shift Elements From End of ListsHow Does Quicksort Work?Quicksort Code SampleShell SortTask: Sorted Arrays and the Sum of Two NumbersSummary
Chapter 5: Linked Lists
Types of Data StructuresLinear Data StructuresNonlinear Data StructuresData Structures and OperationsOperations on Data StructuresWhat Are Singly Linked Lists?Tradeoffs for Linked ListsSingly Linked Lists: Create and Append OperationsA Node Class for Singly Linked ListsJava Code for Appending a NodeFinding a Node in a Linked ListAppending a Node in a Linked ListFinding a Node in a Linked List (Method 2)Singly Linked Lists: Update and Delete OperationsUpdating a Node in a Singly Linked ListJava Code to Update a NodeDeleting a Node in a Linked ListJava Code for Deleting a NodeJava Code for a Circular Linked ListJava Code for Updating a Circular Linked ListWorking With Doubly Linked Lists (DLL)A Node Class for Doubly Linked ListsAppending a Node in a Doubly Linked ListJava Code for Appending a NodeJava Code for Inserting a New Root NodeJava Code for Inserting an Intermediate NodeTraversing the Nodes in a Doubly Linked ListUpdating a Node in a Doubly Linked ListJava Code to Update a NodeDeleting a Node in a Doubly Linked ListJava Code to Delete a NodeSummary
Chapter 6: Linked Lists
Task: Adding Numbers in a Linked List (1)Task: Adding Numbers in a Linked List (2)Task: Adding Numbers in a Linked List (3)Task: Display the First k NodesTask: Display the Last k NodesReverse a Singly Linked List via RecursionTask: Remove DuplicatesTask: Concatenate Two ListsTask: Merge Two Ordered Linked ListsTask: Split an Ordered List Into Two ListsTask: Remove a Given Node From a ListTask: Find the Middle Element in a ListTask: Reverse a Linked ListTask: Check for Palindrome in a Linked ListSummary
Chapter 7: Queues and Stacks
What Is a Queue?Types of QueuesCreating a Queue in JavaCreating a Queue Using an ArrayOther Types of QueuesWhat Is a Stack?Use Cases for StacksOperations With StacksWorking With StacksTask: Reverse and Print Stack ValuesTask: Display the Min and Max Stack Values (1)Task: Reverse a String Using a StackTask: Find Stack PalindromesTask: Balanced ParenthesesTask: Tokenize Arithmetic ExpressionsTask: Classify Tokens in Arithmetic ExpressionsInfix, Prefix, and Postfix NotationsSummary
Chapter 8: ChatGPT and GPT-4
What Is Generative AI?Key Features of Generative AIPopular Techniques in Generative AIWhat Makes Generative AI DifferentConversational AI Versus Generative AIPrimary ObjectiveApplicationsTechnologies UsedTraining and InteractionEvaluationData RequirementsIs DALL-E Part of Generative AI?Are ChatGPT-3 and GPT-4 Part of Generative AI?DeepMindDeepMind and GamesPlayer of Games (PoG)OpenAICohereHugging FaceHugging Face LibrariesHugging Face Model HubAI21InflectionAIAnthropicWhat Is Prompt Engineering?Prompts and CompletionsTypes of PromptsInstruction PromptsReverse PromptsSystem Prompts Versus Agent PromptsPrompt TemplatesPrompts for Different LLMsPoorly Worded PromptsWhat Is ChatGPT?ChatGPT: GPT-3 “on Steroids”?ChatGPT: Google “Code Red”ChatGPT Versus Google SearchChatGPT Custom InstructionsChatGPT on Mobile Devices and BrowsersChatGPT and PromptsGPTBotChatGPT PlaygroundPlugins, Advanced Data Analysis, and Code WhispererPluginsAdvanced Data Analysis (Formerly Code Interpreter)Advanced Data Analysis Versus Claude-2Code WhispererDetecting Generated TextConcerns About ChatGPTCode Generation and Dangerous TopicsChatGPT Strengths and WeaknessesSample Queries and Responses From ChatGPTChatGPT and Medical DiagnosisAlternatives to ChatGPTGoogle BardYouChatPi From InflectionMachine Learning and ChatGPTWhat is InstructGPT?VizGPT and Data VisualizationWhat Is GPT-4?GPT-4 and Test-Taking ScoresGPT-4 ParametersGPT-4 Fine TuningChatGPT and GPT-4 CompetitorsBardCoPilot (OpenAI/Microsoft)Codex (OpenAI)Apple GPTPaLM-2Med-PaLM MClaude 2LlaMa-2How to Download LlaMa-2LlaMa-2 Architecture FeaturesFine Tuning LlaMa-2“Hello World” From GPT-4When Is GPT-5 Available?Summary
Chapter 9: Java and GPT-4
Reverse a String Using RecursionCalculate Factorial ValuesCheck For Prime NumbersChecking Goldbach’s ConjectureCheck For PalindromesImplement a Binary Search AlgorithmCheck for Unique Characters in a StringInsert Strings in a Linked ListRemove Duplicate Strings From a Linked ListImplement a Queue Using an ArrayImplement a Stack Using an ArraySummary
Index

Overview

Encourages readers to compare and contrast hand-written code with ChatGPT-generated code. This approach fosters discussions on code efficiency, readability, and maintainability, enhancing understanding of programming paradigms and techniques.

This book is designed for those new to Java and interested in understanding how ChatGPT/GPT-4 can enhance programming. It offers a unique approach to learning Java, combining traditional hand-written code with cutting-edge ChatGPT-generated examples. The book covers the basics of Java programming and development environments, including understanding recursion, strings, arrays, fundamental data structures, algorithm analysis, queues and stacks, and follows with the role of ChatGPT in generating, explaining, and debugging code. Companion files with source code and figures available for downloading. It’s an essential resource for those starting Java programming and for anyone curious about the applications of ChatGPT in coding.

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.

Julian F.

Head of Cybersecurity

I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.

Addison B.

Field Engineer

I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.

Amir M.

Data Platform Tech Lead

I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.

Mark W.

Embedded Software Engineer

Designing a Modern Application Data Stack

Publisher Resources

ISBN: 9781501518973

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business

Soft Skills