Question

Software Data Structure & Algorithms

1- Write a java method that reversing an array using a stack. Use ArrayStack().

2- Write a java method that implement matching delimiters. Use LinkedStack.

Answer 1

The java code for java method that reverses an array using a stack which is implemented by the array is as follows.

import java.util.Arrays;

public class Arrstack {
   public static void main(String args[]){
       // Taking a array with already assigned values
       int[] myArray = {1,2,3,4,5};
       Arrstack arrstack = new Arrstack();
       // Calling the reverse array fucntion
       arrstack.reverse_array(myArray);
   }
    void reverse_array(int arr[]){


        System.out.println("The array elements before reversing::"+ Arrays.toString(arr));
        //Defining the stack using array implementation
        Stack stack = new Stack();

        for(int i = 0 ;i<arr.length;i++){
            // pushing each element of array into stack
            stack.push(arr[i]);
        }

        int reverse_arr[] = new int[arr.length];
        for (int i = 0 ;i<arr.length;i++){
            reverse_arr[i]=stack.pop();
        }
        System.out.println("The array elements after reversing by using arraystack::"+ Arrays.toString(reverse_arr));
    }
}
class Stack
{
    static final int MAX = 1000;
    int top;
    int arr[] = new int[MAX]; // Maximum size of Stack

    boolean isEmpty()
    {
        return (top < 0);
    }
    Stack()
    {
        top = -1;
    }

    boolean push(int x)
    {
        if (top >= (MAX-1))
        {
            System.out.println("Stack Overflow");
            return false;
        }
        else
        {
            arr[++top] = x;
            System.out.println(x + " pushed into stack");
            return true;
        }
    }

    int pop()
    {
        if (top < 0)
        {
            System.out.println("Stack Underflow");
            return 0;
        }
        else
        {
            int x = arr[top--];
            return x;
        }
    }
}

The output of the program is:

Kindly can you ask the second question of matching delimiters separately? As the coding for that has to be done separately but not in the same program.

I hope you got the answer to the first question and understand it.

Thank you:):)