Consider the following code snippet:

Queue<String> stringQueue = new LinkedList<>();

stringQueue.add("ab");

stringQueue.add("abc");

stringQueue.add("a");

while (stringQueue.size() > 0)

{

   System.out.print(stringQueue.remove() + ",");

}

What output will be produced when this code is executed?

Suppose we have two String objects and treat the characters in each string from beginning to end in the following way: With one string, we push each character on a stack. With the other string, we add each character to a queue. After processing both strings, we then pop one character from the stack and remove one character from the queue, and compare the pair of characters to each other. We do this until the stack and the queue are both empty. What does it mean if all the character pairs match? 

Suppose you push integer elements 1,2,3,4 onto a stack in that order. Then pop an element off the stack and add that element to a queue. You repeat that process three more times. In what order will you remove the elements from the queue? 

Assuming that names is a Queue of String objects, select a statement to complete the code segment below.  The code is designed to remove the last element from the queue, which is guaranteed to have at least one element.

Queue<String> aQueue = new LinkedList<>();

while (names.size() > 1)

{

   aQueue.add(names.remove());

}

names.remove();

while (aQueue.size() > 0)

{

   ____________________________

}

Assume that you have declared a queue named myQueue to hold String elements. Which of the following statements will correctly insert an element into myQueue? 

Assume that you have declared a queue named myQueue to hold String elements. Which of the following statements will correctly delete an element from myQueue? 

Print jobs submitted to a printer would probably be stored in which type of data structure?

Select an appropriate expression to complete the method below, which is designed to print the element at the bottom of a Stack collection.  The contents of the original stack are restored before the method terminates.  It is safe to assume that the original stack contains at least one element.

public static void printBottom(Stack<String> theStack)

{

   Stack<String> anotherStack = new Stack<>();

   while (!theStack.empty())

   {

      anotherStack.push(theStack.pop());

   } 

   ____________________________

   while (!anotherStack.empty())

   {     

      theStack.push(anotherStack.pop());

   }

}

Consider the following code snippet:

Stack<String> stringStack = new Stack<>();

stringStack.push("ab");

stringStack.push("abc");

stringStack.push("a");

while (!stringStack.empty())

{ 

 System.out.print(stringStack.pop() + ",");

}

What output will be produced when this code is executed?

Which operations from the list data structure could be used to implement the push and pop operations of a stack data structure?

I    addLast

II   addFirst

III  removeFirst