Permutation of word Program plan: Filename: “PermutationIterator.java” This program file is used to define a class “PermutationIterator”. In the code, Import the required packages. Define a class “PermutationIterator”. Define the class members. Define the constructor “PermutationIterator()”. Initialize the class members. Define a method “nextPermutation()”. If the length of the word is equal to 0. Increment “current” by 1. Return an empty string. Declare a variable “c” and assign the character of “word” at “current” position. Call the method “nextPermutation()” and assign the value to “nextpermut”. If the condition “!tailIterator.hasMorePermutations()” is true, Increment the current by 1. If the “current” is greater than or equal to length of the “word”, Set the value of “tailIterator” as “null”. Else If the “current+1” is greater than or equal to the length of the “word”, Get substring of “word” to “tail”. If the “current+1” is less than the length of the “word”, Get the substring of “word” to “tail”. Create “tailIterator” as an object of “PermutationIterator”. Return the value of sum of character “c” and string “nextPermut”. Define a method “hasMorePermutations()”. Return the value. Filename: “PermutationIterator.java” This program file is used to define a class “PermutationIteratorDemo”. In the code, Import the required packages. Define a class “PermutationIteratorDemo”. Define the “main” method. Define the object “iter” of “PermutationIterator”. Call the method “nextPermutation()” using “iter” and return the value. Print the expected value. Call the method “nextPermutation()” using “iter” and return the value. Print the expected value. Call the method “nextPermutation()” using “iter” and return the value. Print the expected value. Call the method “nextPermutation()” using “iter” and return the value. Print the expected value. Call the method “nextPermutation()” using “iter” and return the value. Print the expected value. Call the method “nextPermutation()” using “iter” and return the value. Print the expected value. Call the method “nextPermutation()” using “iter” and return the value. Print the expected value.

Question

Want to see the full answer?

Answer 1

Question

Chapter 13, Problem 4PP

Program Plan Intro

Permutation of word

Program plan:

Filename: “PermutationIterator.java”

This program file is used to define a class “PermutationIterator”. In the code,

Import the required packages.

Define a class “PermutationIterator”.

Define the class members.

Define the constructor “PermutationIterator()”.

Initialize the class members.

Define a method “nextPermutation()”.

If the length of the word is equal to 0.

Increment “current” by 1.

Return an empty string.

Declare a variable “c” and assign the character of “word” at “current” position.

Call the method “nextPermutation()” and assign the value to “nextpermut”.

If the condition “!tailIterator.hasMorePermutations()” is true,

Increment the current by 1.

If the “current” is greater than or equal to length of the “word”,

Set the value of “tailIterator” as “null”.

Else

If the “current+1” is greater than or equal to the length of the “word”,

Get substring of “word” to “tail”.

If the “current+1” is less than the length of the “word”,

Get the substring of “word” to “tail”.

Create “tailIterator” as an object of “PermutationIterator”.

Return the value of sum of character “c” and string “nextPermut”.

Define a method “hasMorePermutations()”.

Return the value.

Filename: “PermutationIterator.java”

This program file is used to define a class “PermutationIteratorDemo”. In the code,

Import the required packages.

Define a class “PermutationIteratorDemo”.

Define the “main” method.

Define the object “iter” of “PermutationIterator”.

Call the method “nextPermutation()” using “iter” and return the value.

Print the expected value.

Call the method “nextPermutation()” using “iter” and return the value.

Print the expected value.

Call the method “nextPermutation()” using “iter” and return the value.

Print the expected value.

Call the method “nextPermutation()” using “iter” and return the value.

Print the expected value.

Call the method “nextPermutation()” using “iter” and return the value.

Print the expected value.

Call the method “nextPermutation()” using “iter” and return the value.

Print the expected value.

Call the method “nextPermutation()” using “iter” and return the value.

Print the expected value.

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