Develop, test, and submit four Java classes:

1. an array-based stack ADT that implements the provided StackInterface.java

2. an array-based queue ADT that implements the provided QueueInterface.java

3. an ArrayList-based stack ADT that implements the provided StackInterface.java

4. an ArrayList-based queue ADT that implements the provided QueueInterface.java

Project absolutes - failure to meet any of the following requirements will disqualify your submission from being considered:

1. You may not make any changes to StackInterface.java or QueueInterface.java

2. The classes must be generic

3. Your array-based implementations cannot change the size of the underlying array after its instantiated

4. Your implementations cannot throw any exceptions

5. Your implementations cannot include a main method

6. Your implementations cannot include input or output instructions

7. You cannot have an enlarge() method

Each ADT must include a toString( ) method:

1. The stack's toString( ) return value must list the items in the stack in order from top to bottom and include linefeeds to produce a vertical display

2. The queue's toString( ) return value must list the items in the queue in order from front to rear, with no linefeeds between queue elements

StackInterface:

QueueInterface:
  

 

(4 points) Define f(x, y, z) = ex+yz (a) (1 point) Compute the gradient for f at the point (1, 1, -1). (b) (1 point) Determine the maximal rate of ascent for f at (1,1,-1). In which direction does this occur? (c) (1 point) Compute the tangent plane for f at (1, 1, 1). (d) (1 point) Estimate the value f(0.9, 1.1, -0.8) using part (c).