Implementation of “PrimeSequence” class Program plan: In a file “Sequence .java”, Create a package. Create an interface “Sequence”, Declare the method “next()”. In a file “PrimeSequence .java”, Create a package. Create a class “PrimeSequence”, Initialize the variable to “2”. Use naïve algorithm to produce the next value in the sequence of prime using the following “next()” method. Define the method “next()”, Initialize the Boolean variable to false. Execute he following, Declare the loop variable. Create loop to check each number less than the “n” for divisibility of “n”. Check whether the value is same as “n”, If it is true, set the Boolean variable to true. Increment the counter variable. End the loop while the condition is false. Return the value. In a file “SequenceDemo.java”, Create a package. Create a class “SequenceDemo”, Define the method “main()” Create object for “PrimeSequence”. Execute lop for “100” times, Print the prime number obtained by “next()”.

Question

Want to see the full answer?

Answer 1

Question

Chapter 9, Problem 13PP

Program Plan Intro

Implementation of “PrimeSequence” class

Program plan:

In a file “Sequence .java”,

Create a package.

Create an interface “Sequence”,

Declare the method “next()”.

In a file “PrimeSequence .java”,

Create a package.

Create a class “PrimeSequence”,

Initialize the variable to “2”.

Use naïve algorithm to produce the next value in the sequence of prime using the following “next()” method.

Define the method “next()”,

Initialize the Boolean variable to false.

Execute he following,

Declare the loop variable.

Create loop to check each number less than the “n” for divisibility of “n”.

Check whether the value is same as “n”,

If it is true, set the Boolean variable to true.

Increment the counter variable.

End the loop while the condition is false.

Return the value.

In a file “SequenceDemo.java”,

Create a package.

Create a class “SequenceDemo”,

Define the method “main()”

Create object for “PrimeSequence”.

Execute lop for “100” times,

Print the prime number obtained by “next()”.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

D. S. Malik, Data Structures Using C++, 2nd Edition, 2010

Methods (Ch6) - Review 1. (The MyRoot method) Below is a manual implementation of the Math.sqrt() method in Java. There are two methods, method #1 which calculates the square root for positive integers, and method #2, which calculates the square root of positive doubles (also works for integers). public class SquareRoot { public static void main(String[] args) { } // implement a loop of your choice here // Method that calculates the square root of integer variables public static double myRoot(int number) { double root; root=number/2; double root old; do { root old root; root (root_old+number/root_old)/2; } while (Math.abs(root_old-root)>1.8E-6); return root; } // Method that calculates the square root of double variables public static double myRoot(double number) { double root; root number/2; double root_old; do { root old root; root (root_old+number/root_old)/2; while (Math.abs (root_old-root)>1.0E-6); return root; } } Program-it-Yourself: In the main method, create a program that…

I would like to know the main features about the following 3 key concepts:1. Backup Domain Controller (BDC)2. Access Control List (ACL)3. Dynamic Memory