Java Homework Help

Data Structures and Algorithms 6th Edition

Program consists of 2 ADT's. Double Stack and Leaky Stack ADT's.

Program requirements

Double Stack ADT

Design and implement an ADT for a two-color, double stack ADT that consists of two stacks one red and one blue and has as its operations color-coded versions of the regular Stack ADT operations.

For example, this ADT should support both a redPush and a bluePush operation.

Write the generic interface for this DoubleStack ADT.

Give an efficient generic static implementation of this ADT using a single array as the container whose capacity is set at some value N that is assumed to always be larger than the sizes of the red and blue stacks combined.

Provide a test of your DoubleStack that clearly shows that all of the methods work correctly.

Leaky Stack ADT

When a push is invoked on a LeakyStack at full capacity, rather than throwing an exception, accept the pushed element at the top while leaking the oldest element from the bottom of the stack to make room.

Write the generic interface for this LeakyStack ADT.

Give an efficient static implementation of the LeakyStack abstraction.

Provide a test of your LeakyStack that clearly shows that all of the methods work correctly.