Checking for Palindrome, is there a better way?

Question

Hi all,
i m pasting the code which checks whether its a Palindrome or not. I am sure someone here could come up with some better way. I'll be obliged if they point out the changes.
//Class PalindromeBeta
public class PalindromeBeta{
     private static String s;
     public PalindromeBeta(){
     public static boolean isPalindrome(String as){
          s= as;
          int string_length = s.length();
          int stop_index = (int)(string_length/2);
          int start_index = 0;
          int end_index = string_length;
          int second_index = 1;
          if (string_length == 1)
          return false;
          else{
               do{
                    if(s.substring(start_index,second_index).equalsIgnoreCase(s.substring((end_index-1), end_index))){
                         start_index++;
                         end_index--;
                         second_index++;
                    else
                    return false;
               while(start_index != stop_index);
               return true;
//Class P7_16 with the main() method     
public class P7_16beta{
     public static void main(String[] args){
          ConsoleReader console = new ConsoleReader(System.in);
          PalindromeBeta pd = new PalindromeBeta();
          boolean done = false;
          do{
               System.out.println("Enter a String(Q to quit)");
               String input = console.readLine();
               if (input.equalsIgnoreCase("Q"))
               done = true;
               else if(pd.isPalindrome(input) == true)
               System.out.println("It is a Palindrome");
               else
               System.out.println("It is not a Palindrome");
          while (done == false);
//Class ConsoleReader , a hepling class for reading input
import java.io.*;
public class ConsoleReader
     private BufferedReader reader;
     public ConsoleReader(InputStream instream)
     reader = new BufferedReader(new InputStreamReader(instream));
public String readLine()
String inputLine ="";
try
          inputLine = reader.readLine();
catch(IOException e)
System.out.println(e);
System.exit(1);
return inputLine;
public int readInt()
     String inputString = readLine();
int n = Integer.parseInt(inputString);
return n;
public double readDouble()
     String inputString = readLine();
double x = Double.parseDouble(inputString);
return x;
                    

Answer 1

I'm posting my little code here: It compares every character in the string. It's not the faster way, but I think it's still very reliable.
import java.io.*;
class palindromo {
     public static void main (String [] args) throws Exception {
          String test = args[0];
          boolean result = true;
          if (test.length() <= 1)
               result = false;
          else {
               int end, begin;
               begin = 0;
               end = test.length() - 1;
               if ((test.length())%2 == 0) {
                    while (begin < end) {
                         if (test.charAt(begin) != test.charAt(end)) {
                              result = false;
                              break;
                         begin++;
                         end--;
               else {
                    int medio = (test.length() ) / 2 + 1;
                    while (begin < medio && end > medio) {
                         if (test.charAt(begin) != test.charAt(end)) {
                              result = false;
                              break;
                         begin++;
                         end--;
          System.out.println("The fact that the string is a palindrome is " + result);