Question

This lab will give you a practice with both queue and stack ADTs. In this work, you are to determine if an input string is a palindrome. A string of characters is a palindrome if and only if it reads the same forward and backward. Examples: eye, abba, civic, radar, and so on.

Sample Output:

Please enter a string of characters: abba

The given string is a palindrome.

Want to examine another string? (y/n): y

Please enter a string of characters: 11223311

The given string is not a palindrome, since the symbol at position 3 from the left is different from the symbol at position 3 from the right.

Want to examine another string? (y/n):n

Bye!

// This class provides method to test if a string is a Palindrome using Stack/Queue ADTs.
// Provide more inputs here.
import java.util.Stack;
import java.util.Scanner;
import java.util.Queue;
import java.util.LinkedList;
class Palindrome {
// This is a main method to test checkPalindrome method
public static void main(String[] args) {
String inputString = new String("");
Scanner in = new Scanner(System.in);
do {
// please put your code to test checkPalindrome method here
} while ( inputString.equals("y") && inputString.length() == 1 );
System.out.print("Bye!");
}
// This is checkPalindrome method. It checks if an input string is Palindrome or not.
// It returns 0 if a string is a Palindrome. Otherwise, it returns a position of a character where it finds
// a different value.
// Pre-Condition: string must not be null.
// Post-Condition: Return 0 if input string is a Palindrome. Return a positive number indicate the location where
// a difference found.
public static int checkPalindrome(String strValue) {  
Stack<Character> stack = new Stack<Character>();
Queue<Character> queue = new LinkedList<Character>();
  
// check if string is null. If it is null, return a -1
  
// normalize the string values to lower case, remove spaces
strValue = strValue.toLowerCase().replaceAll("\\W", "");

// store data on stack/queue adts first

// loop: comparing, retrieving text, terminate loop if stack is emptied or found a difference

return indexVal;
}
}

Answer 1

Please find my implementation.

Pelase rate my answer if it helped you!!

import java.util.Stack;

import java.util.Scanner;

import java.util.Queue;

import java.util.LinkedList;

public class Palindrome {

   // This is a main method to test checkPalindrome method

   public static void main(String[] args) {

       String inputString = new String("");

       Scanner in = new Scanner(System.in);

       do {

           // please put your code to test checkPalindrome method here

           System.out.print("Please enter a string of characters: ");

           inputString = in.nextLine();

          

           int index = checkPalindrome(inputString);

          

           if(index == -1) {

               System.out.println("Input string is null");

           }else if(index > 0) {

               System.out.println("The given string is not a palindrome, since the symbol at position "+index

                       + "from the left is different from the symbol at position "+index+" from the right.");

           }else{

               System.out.println("The given string is a palindrome.");

           }

          

           System.out.print("Want to examine another string? (y/n): ");

           inputString = in.nextLine();

       } while ( inputString.equals("y") && inputString.length() == 1 );

       System.out.print("Bye!");

   }

   // This is checkPalindrome method. It checks if an input string is Palindrome or not.

   // It returns 0 if a string is a Palindrome. Otherwise, it returns a position of a character where it finds

   // a different value.

   // Pre-Condition: string must not be null.

   // Post-Condition: Return 0 if input string is a Palindrome. Return a positive number indicate the location where

   // a difference found.

   public static int checkPalindrome(String strValue) {

       Stack<Character> stack = new Stack<Character>();

       Queue<Character> queue = new LinkedList<Character>();

       // check if string is null. If it is null, return a -1

       if(strValue == null)

           return -1;

       // normalize the string values to lower case, remove spaces

       strValue = strValue.toLowerCase().replaceAll("\\W", "");

       // store data on stack/queue adts first

       for(int i=0; i<strValue.length(); i++) {

           char c = strValue.charAt(i);

          

           stack.push(c);

           queue.add(c);

       }

       // loop: comparing, retrieving text, terminate loop if stack is emptied or found a difference

      

       int indexVal = 0;

      

       while(!stack.isEmpty()) {

          

           if(stack.peek() != queue.peek()) {

               return (indexVal+1);

           }

          

           indexVal++;

           stack.pop();

           queue.poll();

       }

       return 0;

   }

}

| Quick Access 哈歇8/ Scala Studentsin R Proble @ JavadoB. Declara Ap search貝Consol × Progre dl Remote TestNG <terminated> Palindrome [Java Application] /Library/Java/JavaVirtualMachines/jdk1.8.0_102.jdk/Contents/Home Please enter a string of characters: aba The given string is a palindrome. checkPa Want to examine another string? (y/n): y args) Please enter a string of characters: 11223311 I- I1 rI ingc" ; The given string is not a palindrome, since the symbol at position 3from the left is tem. in); Want to examine another string? (y/n): n to test eO; rome(inp entero Input st The give left is The given string is a palindrome."); o examine another string? (y/n):"; eO; ("y") && inputString.lengthO1; d. It checks if an input string is Palindrome or not. Palindrome. Otherwise, it returns a position of a character where it finds t be null. nput string is a Palindrome. Return a positive number indicate the location where