Question

In java:

A fun language:

f you recently ate at Chipotle, you may have received a brown paper bag with gibberish letters written on it: “AKINGMAY AWAY IGPAY EALDAY ABOUTWAY IGPAY ATINLAY”. In fact this message is written in Piglatin, a simple but fictitious language. Piglatin converts a word in English using the following two rules: If the letter begins with a vowel, then “WAY” is appended to the word. If the letter begins with a consonant (a letter other than a vowel), then the first letter of the word is moved to the end, and then “AY” is appended to it. Using these rules, one can decode the Chipotle message to “MAKING A PIG DEAL ABOUT PIG LATIN”.

What to do: Write a method that codes and returns an English sentence in Piglatin. Write tests for this method.

Abstraction: Can some of these operations be merged into a common higher-order-function? Determine if these operations can be expressed as a map, filter, fold/reduce, or a combination of them. If so, write these general-purpose methods and re-implement the above operations using them.

Answer 1

Note: Implemented the code. Please comment for further help. Please uprate.

Code:

Piglatin.java

public class Piglatin {
  
   String string;
  
   //constructor
   Piglatin(String text){
       this.string=text;
   }

   //creating Piglatin string
   public String createPiglatin(){
       //splitting string to individual words
       String[] words = string.split("\\s+");
       //making string empty
       string="";
       //loop for each word
       for(int i=0;i<words.length;i++){
           //convert to lowercase
           words[i]=words[i].toLowerCase();
           //if vowel then add way at the end
           if(words[i].charAt(0) =='a' ||words[i].charAt(0) =='e'||words[i].charAt(0) =='i'||words[i].charAt(0) =='o'||words[i].charAt(0) =='u'){
               words[i]=words[i]+"way";
           }else{
               //else remove first letter, add to end and then add ay at end
               words[i]=words[i].substring(1, words[i].length())+words[i].substring(0,1)+"ay";
           }
           //converting back to uppercase
           words[i]=words[i].toUpperCase();
           //making string again
           string=string+words[i]+" ";
       }
       //Trimming extra spaces
       string=string.trim();
       //return string
       return string;
   }
}

PiglatinTestCase.java

import static org.junit.Assert.*;

import org.junit.Assert;
import org.junit.Before;
import org.junit.Test;

public class PiglatinTestCase {

   //Piglatin object
   Piglatin obj;
   //setting and initializing
   @Before
   public void setUp() throws Exception {
       obj=new Piglatin("MAKING A PIG DEAL ABOUT PIG LATIN");
   }

   //checking if result is same
   @Test
   public final void testCreatePiglatinToPass() {
       Assert.assertEquals("AKINGMAY AWAY IGPAY EALDAY ABOUTWAY IGPAY ATINLAY", obj.createPiglatin());
   }
  
   @Test
   public final void testCreatePiglatinToFail() {
       Assert.assertEquals("AKINGMAY AWAY IGPAY EALDAY ABOUTWAY IGPAY", obj.createPiglatin());
   }

}

Output:

Tested with one pass and one fail case

This part seems to be irrelevant to the given question as no operation is mentioned. Please comment if you need help.

Abstraction: Can some of these operations be merged into a common higher-order-function? Determine if these operations can be expressed as a map, filter, fold/reduce, or a combination of them. If so, write these general-purpose methods and re-implement the above operations using them.