1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Dahasolnce [82]
4 years ago
14

a) (20 points) Define the method inDogish recursively such that it returns true if the word is in dog-ish and false if it is not

. I left a dogish Helper method, which I guarantee you will need to recursively solve dogish. An iterative solution will receive no points. (b) (20 points) Define the method inXish that does the same logic of dog-ish but for some word X. The method returns true if the word contains all the letters in the word X. The solution must be recursive. An iterative solution will receive no points.
Computers and Technology
1 answer:
tia_tia [17]4 years ago
7 0

Answer:

/ Main.java

class Main {

     public static void main(String[] args) {

           //System.out.println(inDogish("aplderogad"));

           //System.out.println(inXish("aplderogad", "dog"));

     }

     // returns true if the word is in dog-ish

     // returns false if word is not in dog-ish

     public static boolean inDogish(String word) {

           /**

           * Note: we can use the inXish() method to complete this method in a

           * single line if you want. just write 'return inXish(word,"dog");' and

           * you are done.

           */

           // if word is null or empty, returning false

           if (word == null || word.length() == 0) {

                 return false;

           }

           // converting word to lower case

           word = word.toLowerCase();

           // if 'd' does not exist on the word, returning false

           if (!dogishHelper(word, 'd')) {

                 return false;

           }

           // removing the characters upto first 'd' in word

           word = word.substring(word.indexOf('d') + 1);

           // if 'o' does not exist on the word, returning false

           if (!dogishHelper(word, 'o')) {

                 return false;

           }

           // removing the characters upto first 'o' in word

           word = word.substring(word.indexOf('o') + 1);

           // if 'g' does not exist on the word, returning false, otherwise

           // returning true

           if (!dogishHelper(word, 'g')) {

                 return false;

           } else {

                 return true;

           }

     }

     // necessary to implement inDogish recursively.

     // returns true if letter is in word, else not.

     public static boolean dogishHelper(String word, char letter) {

           // if word is empty, returning -1

           if (word == null || word.length() == 0) {

                 return false;

           }

           // if first character in word is letter, returning 0

           if (word.charAt(0) == letter) {

                 return true;

           }

           return dogishHelper(word.substring(1), letter);

     }

     // the best thing about the above helper method is that we can use it in

     // inXish method also

     // a generalized version of the inDogish method

     public static boolean inXish(String word, String x) {

           // if x is empty, returning true (base case, which means all the letters

           // in x are in word in that order)

           if (x.length() == 0) {

                 return true;

           }

           // getting first character of x

           char first = x.charAt(0);

           // if first character does not exist on the word, returning false

           if (!dogishHelper(word, first)) {

                 return false;

           }

           // calling and returning inXish recursively, passing the word after

           // removing characters upto first occurrance of char first, and x after

           // removing first character from it

           return inXish(word.substring(word.indexOf(first) + 1), x.substring(1));

     }

}

Explanation:

You might be interested in
Programs which were typically reserved for college-level classes such as computer animation and CAD programs are now being appli
Irina-Kira [14]
Answer: I think C


Step by step explanation:
8 0
3 years ago
Hola busco ya saben nv por fa no sean malos nunca e tuvido una ni se como se siente el amor
iVinArrow [24]
Que-?? “Nv” no sé qué es eso?
6 0
3 years ago
Read 2 more answers
Where will the CPU store data for easy access and quick retrieval during these computations?
zalisa [80]
CPU's have little storage devices on the CPU called registers.
4 0
3 years ago
The residual volume can be measured directly with: Select an answer and submit. For keyboard navigation, use the up/down arrow k
TEA [102]

The residual volume can not be measured directly.

<h3>How is residual volume measured?</h3>

Residual volume is known to be measured by what we call a gas dilution test.

Note that this test often  measures how the concentration of the gases in the container changes.

<h3>What is residual volume?</h3>

This is known to be the Volume of air that is left over after a FORCED EXPIRATION. Note that it is one that cannot be measured by a spirometer.

Hence, The residual volume can not be measured directly.

Learn more about residual volume from

brainly.com/question/12897209

#SPJ1

6 0
2 years ago
First generation computers used vacuum tube technology true or false
Murrr4er [49]

I guees the correct option is True.

Vacuum Tubes technology was used in the first generation of computers.

7 0
4 years ago
Other questions:
  • Which of the following is a benefit, as well as a risk, associated with client/server networks?
    8·2 answers
  • Create a file with a 20 lines of text and name it "lines.txt". Write a program to read this a file "lines.txt" and write the tex
    12·1 answer
  • Which education level has the highest return on investment (ROI)? AHigh School Diploma BROI is equal for all of the above. CSeni
    6·1 answer
  • Do you think an employer can accurately judge an applicant’s skills and character by reviewing his/her job application? Why or w
    14·1 answer
  • I really need this right now i just cant understand
    8·1 answer
  • A(n) ________ is a navigation aid that shows the path you have taken to get to a web page or where the page is located within th
    5·2 answers
  • Omega Software Inc. is currently running a training program for employees to upgrade their software skills so that they are able
    10·1 answer
  • To apply the StartSafe philosophy to preventing workplace violence, what are the three steps to follow? A. Plan for your job req
    12·2 answers
  • Question 1 (10 points)
    8·1 answer
  • The Klez virus was a worm created to "spoof others. What is "spoofing"?
    6·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!