Question

implementing the stack ADT with singly linked list

Theoretical Questions, pot - Adobe Acrobat Reader DC File Edit View Sign Window Help Home Tools Theoretical Questio. * Sign In B6Q 0 175 20 } Search Reduce S70 } } Do Export PDF Adobe Export PDF Convert PDF Files to word Ortel Online Select Postile Theoretical..cons.pdt X Microsoft Word docu Programming Part (preferably using Java): 4. (75 marks) Implement the stack ADT with singly linked list (without using classes from any Library). Use the data given in the file, ds20s- al.txt, (see the Lab section) to Input/Insert (PUSH) the data in cach subsequent line(s) until another POP command is encountered. If the command is POP, un-stack (pop) the top of the stack. For the command PRINT, output the contents of the stack from the 'top' to the 'bottom”. If the stack is empty, a POP or PRINT operation should produce an error message.(The assignment marker may change the data to see if your program works for any similar data set with different order) Document English (USt Change Convert Edit PDF Create PDF = Comment What is the top element of the stack once the above file is completely processed? Combine Files El Organize Pages Create, edit and sign PDF forms & agreements Start Free Trial Type here to search 946 7:12 PM 2001-10-03

Answer 1

Implelemtation Stack using LinkedList<Generics>:

public class StackusingLL<T> {

Node<T> head;
int size;

public StackusingLL() {
   head=null;
   size=0;
}

public int size() {
   return size;
  
}

public boolean isempty()
{
   if(size()==0) {
       return true;
   }

   return false;
}

  
public T top() throws Stackemptyexception{
   if(head==null) {
       Stackemptyexception e= new Stackemptyexception();
       throw e;
   }
   return head.data;
}

  
public void push(T ele) {
   Node<T>newnode= new Node<T>( ele);
   newnode.next=head;
   head=newnode;
   size++;
}

  
public T pop() throws Stackemptyexception{
   if(head==null) {
       Stackemptyexception e= new Stackemptyexception();
       throw e;
   }
   Node<T>temp=null;
   temp=head;
   head=head.next;
   size--;
   return temp.data;
}
  
  
  
}

------------class Node-----------

class Node<T>
{
   T data;
   Node next;
     
   Node(T data){
       {
           this.data=data;
           next=null;
       }
   }

  
   }

---------------------Stackemptyexception class--------------

public class Stackemptyexception extends Exception {

}

-------------------Implememtation---------------------

public class Stackuse {

   public static void main(String[] args) throws Stackfullexception {
      
       StackusingLL<Integer> b= new StackusingLL<Integer>();
      
      
       System.out.print("Push operations : ");
       for(int i=0;i<=5;i++) {
           System.out.print(i+" ");
       b.push(i);
}
      
       System.out.println();
      
       System.out.print("pop operations : ");
      
       while(!b.isempty()) {
          try{
                   System.out.print(b.pop()+" ");        }
           catch(Stackemptyexception e) {
                   System.out.println("Stackemptyexception");
               }
           }
      
      
      
   }
   }

SAMPLE OUTPUT:

Console X Call Hierarchy <terminated> Stackuse (1) [Java Application] C:\Program Files\Java\jdk-13.0.2\bin\javaw.exe Push operations : 0 1 2 3 4 5 pop operations : 5 4 3 2 1

// PLEASE THUMBS-UP AND RATE POSITIVELY

If you have any doubt regarding this question ask me in comments

THANK YOU:-)