how would you change the test method of the palindrome class so that it considerer all character, not just letters? please identify the statements you would change, and how you would change them: public class Palindrome { public static boolean test(String candidate) // Returns true if candidate is a palindrome, false otherwise. { char ch; // current candidate character being processed int length; // length of candidate string char fromStack; // current character popped from stack char fromQueue; // current character dequeued from queue boolean stillPalindrome; // true if string might still be a palindrome StackInterface<Character> stack; // holds non blank string characters QueueInterface<Character> queue; // also holds non blank string characters // initialize variables and structures length = candidate.length(); stack = new ArrayBoundedStack<Character>(length); queue = new ArrayBoundedQueue<Character>(length); // obtain and handle characters for (int i = 0; i < length; i++) { ch = candidate.charAt(i); if (Character.isLetter(ch)) { ch = Character.toLowerCase(ch); stack.push(ch); queue.enqueue(ch); } } // determine if palindrome stillPalindrome = true; while (stillPalindrome && !stack.isEmpty()) { fromStack = stack.top(); stack.pop(); fromQueue = queue.dequeue(); if (fromStack != fromQueue) stillPalindrome = false; } // return result return stillPalindrome; }}

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

how would you change the test method of the palindrome class so that it considerer all character, not just letters? please identify the statements you would change, and how you would change them:

public class Palindrome {
public static boolean test(String candidate)
   // Returns true if candidate is a palindrome, false otherwise.
   {
     char ch;                   // current candidate character being processed
     int length;                // length of candidate string
     char fromStack;            // current character popped from stack
     char fromQueue;            // current character dequeued from queue
     boolean stillPalindrome;   // true if string might still be a palindrome

StackInterface<Character> stack; // holds non blank string characters
QueueInterface<Character> queue; // also holds non blank string characters

     // initialize variables and structures
     length = candidate.length();
     stack = new ArrayBoundedStack<Character>(length);
     queue = new ArrayBoundedQueue<Character>(length);

     // obtain and handle characters
     for (int i = 0; i < length; i++)
     {
       ch = candidate.charAt(i);
       if (Character.isLetter(ch))
       {
         ch = Character.toLowerCase(ch);
         stack.push(ch);
         queue.enqueue(ch);
       }
     }

     // determine if palindrome
     stillPalindrome = true;
     while (stillPalindrome && !stack.isEmpty())
     {
       fromStack = stack.top();
       stack.pop();
       fromQueue = queue.dequeue();
       if (fromStack != fromQueue)
         stillPalindrome = false;
     }

     // return result
     return stillPalindrome;
   }
}

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 4 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions