adplus-dvertising
frame-decoration

Question

Select the appropriate code which tests for a palindrome.
a)

public static void main(String[] args) 
{
 System.out.print("Enter any string:");
        Scanner in=new Scanner(System.in);
        String input = in.nextLine();
        Stack<Character> stk = new Stack<Character>();
 for (int i = 0; i < input.length(); i++) 
 {
            stk.push(input.charAt(i));
        }
 String reverse = "";
 while (!stk.isEmpty())
 {
            reverse = reverse + stk.pop();
        }
 if (input.equals(reverse))
        System.out.println("palindrome");
        else
        System.out.println("not a palindrome");
}

b)

public static void main(String[] args) 
{
 System.out.print("Enter any string:");
        Scanner in=new Scanner(System.in);
        String input = in.nextLine();
        Stack<Character> stk = new Stack<Character>();
 for (int i = 0; i < input.length(); i++) 
 {
            stk.push(input.charAt(i));
        }
 String reverse = "";
 while (!stk.isEmpty())
 {
            reverse = reverse + stk.peek();
        }
 if (input.equals(reverse))
        System.out.println("palindrome");
        else
            System.out.println("not a palindrome");
}

c)

public static void main(String[] args) 
{
 System.out.print("Enter any string:");
        Scanner in=new Scanner(System.in);
        String input = in.nextLine();
        Stack<Character> stk = new Stack<Character>();
 for (int i = 0; i < input.length(); i++) 
 {
            stk.push(input.charAt(i));
        }
 String reverse = "";
 while (!stk.isEmpty())
 {
            reverse = reverse + stk.pop();
   stk.pop();
        }
 if (input.equals(reverse))
        System.out.println("palindrome");
        else
            System.out.println("not a palindrome");
}

d) None of the mentioned

a.

a

b.

b

c.

c

d.

d

Answer: (a).a

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Select the appropriate code which tests for a palindrome.

Similar Questions

Discover Related MCQs

Q. Which data structure can be used to test a palindrome?

Q. Which among the following is not a palindrome?

Q. Which data structure can be used suitably to solve the Tower of Hanoi problem?

Q. What is the time complexity for converting decimal to binary numbers?

Q. Express -15 as a 6-bit signed binary number.

Q. To implement a stack using queue(with only enqueue and dequeue operations), how many queues will you need?

Q. After performing these set of operations, what does the final list look contain?

InsertFront(10);

InsertFront(20);

InsertRear(30);

DeleteFront();

InsertRear(40);

InsertRear(10);

DeleteRear();

InsertRear(15);

display();

Q. What is the time complexity of deleting from the rear end of the dequeue implemented with a singly linked list?

Q. What are the applications of dequeue?

Q. What is a dequeue?

Q. What is the time complexity to insert a node based on position in a priority queue?

Q. What are the advantages of priority queues?

Q. What is not a disadvantage of priority scheduling in operating systems?

Q. What is the time complexity to insert a node based on key in a priority queue?

Q. Which of the following is not an application of priority queue?

Q. With what data structure can a priority queue be implemented?

Q. The essential condition which is checked before deletion in a linked queue is?

Q. The essential condition which is checked before insertion in a linked queue is?

Q. In linked list implementation of a queue, the important condition for a queue to be empty is?

Q. In linked list implementation of a queue, from where is the item deleted?