Java Datastructure labs Question

Lab 1

Implement a menu based program with the following array-based list functions:
• ADD (at the end of array) 
• INSERT (element at a given location) 
• DELETE (element from a given location) 
• SHOW (all array elements) 
• COUNT (total number of elements) 

• CLEAR (initialize array) 

Lab 2

Implement a menu based program with the following array-based queue functions:
• ADD (an element to the end of queue) 
• DELETE (an element from the front of queue) 
• SHOW (all elements, starting at first, ending at last) 
• COUNT (total number of elements) 

• CLEAR (initialize queue) 

Lab 3

Implement a program that will use a stack structure to check for correct placement of parentheses in an algebraic expression. Allow the use of ( ) [ ] { } characters as grouping symbols. Make sure that an error is reported for an expression of a form (...]

Lab 4

Implement a program that will use a stack structure to calculate the value of arithmetic postfix expressions. Assume that only one digit numbers will be used.

Example:
Input 12+3* should generate 9