1. Write a declaration of an ArrayBoundedStack named s that has a capacity of 100 and holds String objects. Do not use StackInterface in your declaration.

2. Recall that within the LinkedQueue the front and rear variables are of type LLNode holding references to the front and rear nodes of the underlying linked list, and the numElements variable is an int and holds the current size of the queue. Complete the implementation of the isFull method:

public boolean isFull()

// Returns true if this queue is full, otherwise returns false.

{

// complete the method body

}

3. Show the contents of the queue, from front to back, after the execution of the following segment of code, given that queue is an object that fits an abstract description of a queue (originally empty). Assume that you can store and retrieve variables of type int on queue. (Note: also discuss your work in terms of how you got your answer.)

queue.enqueue(15); queue.dequeue(); queue.enqueue(0); queue.enqueue(20);

queue.dequeue(); queue.enqueue(10);

queue.enqueue(queue.dequeue());

for (int i = 1; i <= 3; i++)

queue.enqueue (i + 3);

queue.dequeue();

4. Recall that within the LinkedCollection the numElements variable holds the number of elements currently in the collection, and the head variable of type LLNode holds a reference to the beginning of the underlying linked list. The LLNode class provides setters and getters for its info and link attributes. Complete the implementation of the add method:

public boolean add(T element)

// Adds element to this collection.

{

// complete the method body

}

5. Recall that within the LinkedCollection the head variable of type LLNode holds a reference to the beginning of the underlying linked list. The LLNode class provides setters and getters for its info and link attributes. Also, the helper method find accepts an argument target of type T and sets the boolean instance variable found to indicate whether target is in the collection, and if so, it also sets the instance variable location to reference the LLNode in the linked list that holds target. Complete the implementation of the get method:

public T get(T target)

// Returns an element e from this collection such that e.equals(target);

// if no such element exists, returns null.

{

// complete the method body

}

COURSE- DATA STRUCTURES JAVA

PLEASE HELP ASAP. THANKS IN ADVANCE.