Category: Java

https://docs.oracle.com/en/java/javase/21/docs/api… Choose a feature of Java i

https://docs.oracle.com/en/java/javase/21/docs/api…
Choose a feature of Java i

https://docs.oracle.com/en/java/javase/21/docs/api…
Choose a feature of Java in the API that has not been covered yet, and discuss how it demonstrates inheritance.
Your post should include these features:
Post your code to the discussion by the due date
Professional writing with complete sentences and correct capitalization, punctuation, and grammar. Consider this post like it’s a message to a professional colleague
Include a direct link to the feature you’re describing
Describe it in summary, what it does, why it exists. Describe in general the constructors, methods, and static values of the class
Show clearly how your class has parents and children, including showing the lineage all the way to the Object class. Doing this with a picture or diagram will be effectiveDescribe methods and variables that are available in the context of your chosen class that are inherited from a parent class
I chose Feature: java.lang.StringBuilderdont

https://docs.oracle.com/en/java/javase/21/docs/api… Choose a feature of Java i

https://docs.oracle.com/en/java/javase/21/docs/api…
Choose a feature of Java i

https://docs.oracle.com/en/java/javase/21/docs/api…
Choose a feature of Java in the API that has not been covered yet, and discuss how it demonstrates inheritance.
Your post should include these features:
Post your code to the discussion by the due date
Professional writing with complete sentences and correct capitalization, punctuation, and grammar. Consider this post like it’s a message to a professional colleague
Include a direct link to the feature you’re describing
Describe it in summary, what it does, why it exists. Describe in general the constructors, methods, and static values of the class
Show clearly how your class has parents and children, including showing the lineage all the way to the Object class. Doing this with a picture or diagram will be effectiveDescribe methods and variables that are available in the context of your chosen class that are inherited from a parent class
I chose Feature: java.lang.StringBuilderdont

Magic Maze Assignment Directions can be found here Download here. Click here Dow

Magic Maze
Assignment Directions can be found here Download here.
Click here Dow

Magic Maze
Assignment Directions can be found here Download here.
Click here Download herefor driver file.
Click here Download herefor the python test script and here Download herefor the sample solution text file.
Text Files For Each Maze (click each one to download)
maze1.txt Download maze1.txt maze2.txt Download maze2.txt maze3.txt Download maze3.txt maze4.txt Download maze4.txt maze5.txtDownload maze5.txt
Make sure to include a comment header at the top of your file like the example below. If you don’t do it exactly like this, then points will be deducted in accordance with the rubric.
/* Johnny Knights
* Dr. Steinberg
* COP3503 Spring 2024
* Programming Assignment 2
*/
Assignment Video
Programming Assignment 2
Programming Assignment 2
CriteriaRatingsPts
This criterion is linked to a Learning OutcomeCode CompilationDid the student’s file compile successfully with no errors or warnings?
15 ptsFull Marks
Code compiled with no errors or warnings.
10 ptsPartial Marks
Code compiled, however warnings were generated.
6 ptsLow Marks
Code didn’t compile at all.
0 ptsNo Marks
No code submission was received.
15 pts
This criterion is linked to a Learning OutcomeProgram RunDid the program run successfully without crashing on Eustis?
5 ptsFull Marks
Program ran successfully on Eustis and passed all test cases.
2.5 ptsHalf Marks
Program ran on Eustis, however not all test cases passed.
0 ptsNo Marks
No code submission was received or could not run at all on Eustis.
5 pts
This criterion is linked to a Learning OutcomeImplementation of the MagicMaze ClassDid the student properly the MagicMaze Class based on the assignment directions?
15 ptsFull Marks
The class was implemented properly.
7.5 ptsHalf Marks
The class had some things missing that were specified in the assignment. Attributes, methods, etc…
0 ptsNo Marks
No code submission was received OR the code is extremely way off from what the assignment specified.
15 pts
This criterion is linked to a Learning OutcomeConstructor of MagicMaze classDid the student properly implement the constructor? This includes reading the proper text file of the maze.
10 ptsFull Marks
The constructor was implemented correctly.
5 ptsHalf Marks
The constructor was not implemented correctly. Mistakes were found in the code.
0 ptsNo Marks
No code submission was received or could not run at all on Eustis.
10 pts
This criterion is linked to a Learning OutcomesolveMagicMazeDid the student properly implement the solveMagicMaze method by using backtracking? If backtracking was not used, then the student will receive an automatic 0 on the total assignment score.
25 ptsFull Marks
The method was solved perfectly and backtracking was applied properly.
20 ptsHigh Marks
The method uses backtracking, however there exists one error.
12.5 ptsHalf Marks
The method uses backtracking, however there exists two – three errors.
6 ptsLow Marks
The method uses backtracking, however there exists more than three errors.
0 ptsNo Marks
No code submission was received or could not run at all on Eustis. OR Backtracking was not applied. This means the overall grade for the assignment is a 0.
25 pts
This criterion is linked to a Learning OutcomeMaze 1 PassDid Maze 1 pass? This includes the time constraint. If it did not solve the maze, then give no points for this test case.
5 ptsFull Marks
Yes!
0 ptsNo Marks
No!
5 pts
This criterion is linked to a Learning OutcomeMaze 2 PassDid Maze 2 pass? This includes the time constraint. If it did not solve the maze, then give no points for this test case.
5 ptsFull Marks
Yes!
0 ptsNo Marks
No!
5 pts
This criterion is linked to a Learning OutcomeMaze 3 PassDid Maze 3 pass? This includes the time constraint. If it did not solve the maze, then give no points for this test case.
5 ptsFull Marks
Yes!
0 ptsNo Marks
No!
5 pts
This criterion is linked to a Learning OutcomeMaze 4 PassDid Maze 4 pass? This includes the time constraint. If it did not solve the maze, then give no points for this test case.
5 ptsFull Marks
Yes!
0 ptsNo Marks
No!
5 pts
This criterion is linked to a Learning OutcomeMaze 5 PassDid Maze 5 pass? This includes the time constraint. If it did not solve the maze, then give no points for this test case.
5 ptsFull Marks
Yes!
0 ptsNo Marks
No!
5 pts
This criterion is linked to a Learning OutcomeCode Style and CommentsDid the student follow proper coding style techniques along with sufficient comments?
2.5 ptsFull Marks
Student used good coding style and provided sufficient number of comments.
1.25 ptsHalf Marks
Student somewhat used good coding style and provided sufficient number of comments. There were error(s) detected.
0 ptsNo Marks
Student did not used good coding style and provided sufficient number of comments.
2.5 pts
This criterion is linked to a Learning OutcomeCode Submission and HeaderDid the student properly named the .java file as stated in directions? Did the student provide a comment header at the top of the code file that contained (name, course, professors, assignment)?
2.5 ptsFull Marks
The student followed all directions of the naming the submission properly and providing a proper header at the top of the file.
1.25 ptsHalf Marks
The student somewhat followed directions of naming the submission properly and providing a proper header at the top of the file. There was an error detected.
0 ptsNo Marks
The student did not follow directions of naming the submission properly and providing a proper header at the top of the file.
2.5 pts
Total Points: 100

I need a tutor who has experience with GitHub, Maven, and java. I will give tuto

I need a tutor who has experience with GitHub, Maven, and java. I will give tuto

I need a tutor who has experience with GitHub, Maven, and java. I will give tutor my GitHub login, and then the tutor will follow the instructions in the file below. (You are editing code to make sure tic tax toe code works good). My professor said there shouldn’t be more then 15 lines of code added (it can be less) to the assignment and it shouldn’t take more then 4 hours. Easy assignment. Thank you!

ALL I NEED IS FOR YOU TO REVISE MY ANSWER/ CORRECT IT AND INPUT IT INTO A FILE a

ALL I NEED IS FOR YOU TO REVISE MY ANSWER/ CORRECT IT AND INPUT IT INTO A FILE a

ALL I NEED IS FOR YOU TO REVISE MY ANSWER/ CORRECT IT AND INPUT IT INTO A FILE and urgently as the test ends soon so I need it ASAP. THIS IS THE ANSWER: Here’s a Java code snippet that uses the Sieve of Eratosthenes algorithm to find prime numbers between 2 and 999 and write them to a text file named “primes.txt”:
“`java
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
public class PrimeNumberFinder {
public static void main(String[] args) {
int n = 1000;
boolean[] primes = new boolean[n];
for (int i = 2; i < n; i++) { primes[i] = true; } for (int p = 2; p * p < n; p++) { if (primes[p]) { for (int i = p * p; i < n; i += p) { primes[i] = false; } } } try { PrintWriter outputFile = new PrintWriter(new FileWriter("primes.txt")); int count = 0; for (int i = 2; i < n; i++) { if (primes[i]) { outputFile.println(i); count++; } } outputFile.println(); outputFile.println("Total number of prime numbers: " + count); outputFile.close(); System.out.println("Prime numbers have been written to primes.txt"); } catch (IOException e) { System.out.println("File Not Found"); } } } ``` This code initializes an array of boolean values to track prime numbers using the Sieve of Eratosthenes algorithm. It then loops through the array to find prime numbers and writes them to the "primes.txt" file. Finally, it prints the total number of prime numbers found. Please note that you need to handle the `IOException` by catching it and displaying the "File Not Found" message to the console, as specified in the requirements HERE'S THE QUESTION: .A prime number is any integer greater than 1 that's evenly divisible only by itself and 1. The Sieve of Eratosthenes is a method of finding prime numbers. It operates as follows: a) Create a Boolean array with all elements initialized to true. Array elements with prime indices will remain true. All other array elements will eventually be set to false. b) Starting with array index 2, determine whether a given element is true. If so, loop through the remainder of the array and set to false every element whose index is a multiple of the index for the element with value true. Then continue the process with the next element with value true. For array index 2, all elements beyond element 2 in the array that have indices which are multiples of 2 (indices 4, 6, 8, 10, etc.) will be set to false; for array index 3, all elements beyond element 3 in the array that have indices which are multiples of 3 (indices 6, 9, 12, 15, etc.) will be set to false; and so on. When this process is completed, the array elements that are still true indicate that the index is a prime number. These indices can be displayed. Write an application that uses an array of 1,000 elements to determine and writes the prime numbers between 2 and 999 and the number of these prime numbers to a text file named "primes.txt". Ignore array elements 0 and 1. Include code to handle the FileNotFound exception and display "File Not Found" message to the console should the exception occur. In the text file "primes.txt", each prime number should occupy a single line. The total number of prime numbers should occupy the last line of the text file with one empty line from the last prime number. For example, if the requirement were to write the prime number between 2 and 9, the primes.txt file should have the following content: