Implementing Stack and Queue by Using Array Two Separate pro

Implementing Stack and Queue by Using Array; (Two Separate programs)

Part A)

A stack is an abstract data type that allows only a limited number of operations on a collection of data. Elements are stored in order of insertion and the elements are removed in reverse order. Because the last element that is inserted is the first to be removed, it is often referred to as a Last-in First-out (LIFO) collection. For this assignment complete the following requirements;

1) create a new interface with the name MyStack interface specifies the operations that any implementation of a stack must have such as Push and Pop.

2) Write your concrete class to implement your MyStack interface. In this class add methods to set and get size of the stack. Class must also set the default size and maximum size of the stack. It must also control the flow of the stack by giving messaging such as \"Stack is empty\" or \"Stack is underflow\", \"Stack is overflow\" or \"Full\", when user is trying to push more item in the stack when it is already full.   

3) Write a test program to use your concrete class. To test your class set your stack maximum size to 10. Ask from the user to enter Student Name and then store in the stack. Your main program must offer the following options to the user;

1) Set Maximum size of the Stack (it must show the stack maximum limit)

2) Push (Add student name to the stack)

3) Pop (Take out student name from the stack)

4) PopUpAll (Display all student names in the stack, after this stack will be empty)

Note: You may add new methods if necessary to fulfill the above mentioned user requirments.

Part B)

A Queue is an abstract data type that allows only a limited number of operations on a collection of data. Elements are stored at the back end and elements are removed from the front end. it is often referred to as a First-In First-Out (FIFO) collection. For this assignment complete the following requirements;

1) create a new interface with the name MyQueue interface specifies the operations that any implementation of a Queue must have such as Insert and Delete.

2) Write your concrete class to implement your MyQueue interface. In this class add methods to set and get size of the Queue. Class must also set the default size and maximum size of the Queue. It must also control the flow of the Queue by giving messaging such as \"Queue is empty\" or \"Queue is underflow\", \"Queue is overflow\" or \"Full\", when user is trying to Add/insert more item in the Queue when it is already full.   

3) Write a test program to use your concrete class. To test your class set your Queue maximum size to 10. Ask from the user to enter Student Name and then store in the Queue. Your main program must offer the following options to the user;

1) Set Maximum size of the Queue (it must show the Queue maximum limit)

2) Add/Insert (Add student name to the Queue)

3) Delete (Take out student name from the Queue)

4) DeleteAll (Delete and Display all student names in the Queue, after this Queue will be empty)

Note: You may add new methods if necessary to fulfill the above mentioned user requirments.