Generating the subsets of a string Program plan: Filename: “SubsetGenerator.java” This program file is used to define a class “SubsetGenerator”. In the code, Import the required packages. Define a class “SubsetGenerator”. Declare an string class member “word”. Define a constructor “SubsetGenerator()”. Initialize the “word”. Define a method “getSubsets()”. Create an array list “result”. If the length of the word is “0”, Call “add()” to add the “word” to “result”. Return the “result”. Create a string variable “shorterWord” to hold a substring. Create all the subsets of “shorterWord”. Iterate a “for” loop, Add removed letter “s” to “result”. Add all words without the removed character “s” to “result”. Return the result. Filename: “SubsetGeneratorDemo.java” This program file is used to define a class “SubsetGeneratorDemo” to test the class “SubsetGenerator”. In the code, Define a class “SubsetGeneratorDemo”. Define a method “main()”. Create the object “generator” of class “SubsetGenerator” to initialize the class member of “SubsetGenerator” as “rum”. Create an array list “subsets”. Call the method “sort()” to sort the array list “subsets”. Print the values in “subsets”. Print the expected values. Initialize the class member of “SubsetGenerator” as “boy”. Set the values of “subsets”. Call the method “sort()” to sort the elements in the array list “subsets”. Print the values of “subsets”. Print the expected value. Initialize the class member of “SubsetGenerator” as “girl”. Set the values of “subsets”. Call the method “sort()” to sort the elements in the array list “subsets”. Print the values of “subsets”. Print the expected value.

Question

Want to see the full answer?

Answer 1

Question

Chapter 13, Problem 15PE

Program Plan Intro

Generating the subsets of a string

Program plan:

Filename: “SubsetGenerator.java”

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

Import the required packages.

Define a class “SubsetGenerator”.

Declare an string class member “word”.

Define a constructor “SubsetGenerator()”.

Initialize the “word”.

Define a method “getSubsets()”.

Create an array list “result”.

If the length of the word is “0”,

Call “add()” to add the “word” to “result”.

Return the “result”.

Create a string variable “shorterWord” to hold a substring.

Create all the subsets of “shorterWord”.

Iterate a “for” loop,

Add removed letter “s” to “result”.

Add all words without the removed character “s” to “result”.

Return the result.

Filename: “SubsetGeneratorDemo.java”

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

Define a class “SubsetGeneratorDemo”.

Define a method “main()”.

Create the object “generator” of class “SubsetGenerator” to initialize the class member of “SubsetGenerator” as “rum”.

Create an array list “subsets”.

Call the method “sort()” to sort the array list “subsets”.

Print the values in “subsets”.

Print the expected values.

Initialize the class member of “SubsetGenerator” as “boy”.

Set the values of “subsets”.

Call the method “sort()” to sort the elements in the array list “subsets”.

Print the values of “subsets”.

Print the expected value.

Initialize the class member of “SubsetGenerator” as “girl”.

Set the values of “subsets”.

Call the method “sort()” to sort the elements in the array list “subsets”.

Print the values of “subsets”.

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

1. What is the difference between a relative cell reference and an absolute cell reference and give an example of when you would use each.

What is the goal of using a chart in excel, and how is a chart useful and what is the goal of using sparklines in excel, and how are sparklines useful?

Prove for each pair of expression f(n) and g(n) whether f(n) is big O, little o Ω,ω or Θ of g(n). Use limits to find these. For each case it is possible that more than one of these conditions is satisfied:1. f(n) =log(n2^n), g(n) = log(sqrt(n)2^(n^2))2. f(n) =nsqrt(n) +log(n^n), g(n) =n + sqrt(n)logn