1. How might you use a stack and queue to determine whether or not a string was a palindrome?
2. What does the following code fragment do to the queue q?
ObjectStack s = new ObjectStack();
while (!q.isEmpty())
s.push(q.remove());
while (!s.isEmpty());
q.insert(s.pop());
3.Describe how you might implement a queue using two stacks. Hint: if you push elements onto a stack and then pop them all, they appear in reverse order. if you repeat this process, they're now back in order.
4. Perform a hand simulation of the Multilevel feedback queue simulation lab to ensure that you understand the algorithm. your output should agree with the partial output provided in the lab document.