For this assignment you will use the Assignment6.java and write your code where designated. There will be three methods.

Problem #1

Write a method called "seeingThree" that takes a stack of integers as a parameter and replaces every value in the stack with two occurrences of that value. For example, suppose the stack stores these values:

bottom [3, 7, 1, 14, 9] top

Then the stack should store these values after the method terminates:

bottom [3, 3, 3,7,7, 7, 1,1, 1, 14,14, 14,9, 9, 9] top

Notice that you must preserve the original order. In the original list the 9 was at the top and would have been popped first. In the new stack the two 9s would be the first values popped from the stack. You may use a single queue as auxiliary storage to solve this problem.

Problem #2

Write a method called "twoStacksAreEqual" that takes as parameters two stacks of integers and returns true if the two stacks are equal and that returns false otherwise. To be considered equal, the two stacks would have to store the same sequence of integer values in the same order. Your method is to examine the two stacks but must return them to their original state before terminating. You may use one stack as auxiliary storage.

Problem #3

Write a method called "isMirrored" that takes a queue of integers as a parameter and returns true if the numbers in the queue represent a palindrome (and false otherwise). A sequence of numbers is considered a palindrome if it is the same in reverse order. For example, suppose a queue called q stores these values:

front [3, 8, 17, 9, 17, 8, 3] back

Then the call of isMirrored(q); should return true because this sequence is the same in reverse order. If the queue had instead stored these values:

front [3, 8, 17, 9, 4, 17, 8, 3] back

The call on isMirrored would instead return false because this sequence is not the same in reverse order (the 9 and 4 in the middle don't match). The empty queue should be considered a palindrome. You may not make any assumptions about how many elements are in the queue and your method must restore the queue so that it stores the same sequence of values after the call as it did before. You may use one stack as auxiliary storage.

import java.util.Enumeration;

import java.util.LinkedList;

import java.util.Queue;

import java.util.Stack;

//Name,Class,Date..etc.. Header

public class Assignment6 {

public static void main(String[] args) {

//testSeeingThreeMethod();

//testTwoStacksAreEqualMethod();

//testIsMirrored();

}

public static void seeingThree(Stack s) {

/*********Write Code Here************/

}

public static boolean twoStacksAreEqual(Stack s1, Stack s2) {

/*********Write Code Here************/

}

public static boolean isMirrored(Queue q) {

/*********Write Code Here************/

}

private static void testIsMirrored() {

Queue myQueueP = new LinkedList();;

for (int i = 0; i

{

System.out.print(i);

myQueueP.add(i);

}

for (int i = 3; i >= 0 ; i--)

{

System.out.print(i);

myQueueP.add(i);

}

System.out.println();

System.out.println(isMirrored(myQueueP) + " isMirrord");

}

private static void testTwoStacksAreEqualMethod() {

Stack myStack1 = new Stack();

Stack myStack2 = new Stack();

Stack myStack3 = new Stack();

Stack myStack4 = new Stack();

for (int i = 0; i

{

myStack1.push(i);

myStack2.push(i);

myStack4.push(i);

}

for (int i = 0; i

{

myStack3.push(i);

}

System.out.println(twoStacksAreEqual(myStack1,myStack2) + " Same Stack ");

System.out.println(twoStacksAreEqual(myStack3, myStack4) + " Not Same Stack");

}

private static void testSeeingThreeMethod() {

Stack myStack = new Stack();

for (int i = 0; i

{

myStack.push(i);

}

System.out.println();

print(myStack);

seeingThree(myStack);

print(myStack);

}

private static void print(Stack s) {

Enumeration e = s.elements();

while ( e.hasMoreElements() )

System.out.print( e.nextElement() + " " );

System.out.println();

}

} //end of Assignment6