Chapter 17

What does the following function do? void mystery(queueType& q) { stackType s; while (!q.isEmptyQueue()) { s.push(q.front()); q.deleteQueue(); } 1 7 Exercises | 1217 C7958_C17 while (!s.isEmptyStack()) { q.addQueue(2 * s.top()); s.pop(); } }

Suppose that queue is a queueType object and the size of the array implementing queue is \(100 .\) Also, suppose that the value of queueFront is 50 and the value of queueRear is 99 a. What are the values of queueFront and queueRear after adding an element to queue? b. What are the values of queueFront and queueRear after removing an element from queue?

Suppose that queue is a queueType object and the size of the array implementing queue is \(100 .\) Also, suppose that the value of queueFront is 99 and the value of queueRear is 25 a. What are the values of queueFront and queueRear after adding an element to queue? b. What are the values of queueFront and queueRear after removing an element from queue?

Suppose that queue is a queueType object and the size of the array implementing queue is \(100 .\) Also, suppose that the value of queueFront is 25 and the value of queueRear is 75 a. What are the values of queueFront and queueRear after adding an element to queue? b. What are the values of queueFront and queueRear after removing an element from queue?

Write a function template, reverseQueue, that takes as a parameter a queue object and uses a stack object to reverse the elements of the queue.

Add the operation queuecount to the class queueType (the array implementation of queues), which returns the number of elements in the queue. Write the definition of the function template to implement this operation.