Question

Please use Java.

Write a non-recursive method that uses a stack to check whether its string parameter is a palindrome. Write a program to test and demo your method.

1. Fibonacci Numbers

Write a method that uses a stack to determine the desired Fibonacci number. Write a program to test and demo your method.

2. Balancing Grouping Symbols

Write a method that takes a string parameter and determines whether the string contains matching grouping symbols. Grouping symbols are parenthesis ( ), curly braces { }, and brackets [].  For example, the string {a(b+ac)d} and  kab*cd contain matching grouping symbols. However, the strings ac)cd(e(k, xy{za(dx)k, and

{a(b+ac)d} do not contain matching grouping symbols. (Note: open and closed grouping symbols have to match both in number and in the order they occur in the string).

Write a method that uses a stack data structure to determine whether its string parameter has matching grouping symbols. Write a program to test and demo your method.

Answer 1

As per HomeworkLib guidelines I am answering the first full question. Please ask the remaining questions separately.

Program

package recursivepalindrome;

import java.util.Scanner;
import java.util.EmptyStackException;
import java.util.Stack;

public class RecursivePalindrome {

   
    public static void main(String[] args)
    {
    Scanner scan = new Scanner(System.in);

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

    System.out.print("Enter a string: ");

    String input = scan.nextLine();

   
    for (int i=0;i<input.length();i++)
    {
        stack.push(input.charAt(i));
       
    }
   
    String reverseInput = "";

        while (!stack.isEmpty()) {
            reverseInput += stack.pop();
        }
       
    if (input.equals(reverseInput))
            System.out.println("Palindrome.");
        else
            System.out.println("Not palindrome.");

}      
   
}

Output

Enter a string: malayalam
Palindrome.