Question

Question 5 (3 points) (Bonus) Below shows a recursive method that can recognize whether a String parameter consists of a specific pattern and returns true if the String has that pattern, false otherwise. public boolean pattern Recognizer(String 2) return true; if (2 == null) return true; else if (a.length(== 11 |(a.length() == 2&&2.charAt(0) == 2.charAt()))) else if (a.length() == 2 && 2.charAt(0) != a.charAt(1)) return false; else if (a.charAt(0) == a.charAt(a.length() - 1)) retum patterRecognizer(a substring(1, a.length() - 1)): else return false; } myString substring(1, a. length() - 1) will remove the first and last character from myString. What is the return value when patternRecognizer("rotator") is called? True None of the above False Question 6 (3 points) The following code is executed and a NullPointerException arises in m2(). Assume m20 method does not provide an exception handler for NullPointerException. However, m10 method provides a mechanism handles NullPointerException, then public static void main(String[] args) { ExceptionThrowerCode etc = new Exception ThrowerCode(): etc mlo; etc m2; catch(NullPointerException npe) {...} } } it is caught in main Oit is caught in m2 it is caught in mi it is not caught leading to the program terminating Question 7 (3 points) If the numbers 3, 8.2.4.6. is added to a queue, in the order given. Then being removed from the queue and added into a stack one by one. Which number will be the last number to be removed from the stack later? None of the above

Answer 1

Question 5:

import java.util.*;
public class Main
{
   public static void main(String args[])
   {  
  
System.out.println(patternRecognizer("rotator"));
}
public static boolean patternRecognizer(String a)
{
   if(a==null) return true;
   else if(a.length()==1 || (a.length()==2 && a.charAt(0)==a.charAt(1)))
       return true;
   else if(a.length()==2 && a.charAt(0)!=a.charAt(1))
       return false;
   else if(a.charAt(0)==a.charAt(a.length()-1))
       return patternRecognizer(a.substring(1,a.length()-1));
   else return false;
}
}

The answer is option 2 "True"

The pattern is nothing but the palindrome.As rotator is palindrome it returns true.

1) It can't be 6 as the method is boolean it only returns true or false not any other value.

2) The answer is true recursively checks the first and last character and at last returns true as the rotator is palindrome.

3)It can't be none of the above as the answer is true.

4)It can't be false as the rotator is palindrome.

The given question has Threee questions included in it.

As per the HOMEWORKLIB RULESs I have answered the first question.

I request you to re-post the remaining questions as a separate one.

Please do comment for any queries.
Please like it.
Thank you.