5. What is the output of the following program segment? linkedQueueType queue; queue.addQueue (10); queue.addQueue (20); cout << queue.front () << endl; queue.deleteQueue () ; queue.addQueue (2 * gqueue.back () ); queue.addQueue (queue.front ()); queue.addQueue (5); queue.addQueue (queue.back () 2); 1. linkedQueueType tempQueue; tempQueue = queue; while (!tempQueue.isEmptyQueue ()) cout << tempQueue.frcnt () << " "; tempQueue. deleteQueue (); cout << endl; cout << queue.front () << " " << queue.back() '<< endl%;

Assume a linked list contains following integers: 7, 2, 9, 5, 8, 3, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode=head; Node<int> *aNode; int s; while(curNode!=NULL){ {       aNode=curNode;       curNode=curNode->getNext(); } s=aNode->getItem();   A. 15 B. 3 C. 7 D. 2

b. Write out the order of elements that are contained in a queue after the following operations are performed. myQueue.enqueue(new Integer(16)); myQueue.enqueue(new Integer(12)); Integer num1 = myQueue.dequeue(); myQueue.enqueue(new Integer(6)); myQueue.enqueue(new Integer(8)); myQueue.enqueue(new Integer(30)); myQueue.enqueue(new Integer(24)); myQueue.enqueue(new Integer(18)); myQueue.dequeue(); myQueue.dequeue(); myQueue.dequeue(); myQueue.enqueue(new Integer(38); Show how step by step process of arriving at your answer.

Assume a linked list contains following integers: 5, 2, 4, 6, 8, 3, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode=head; int a=0; while(curNode!=NULL){      a+=curNode->getItem();       curNode=curNode->getNext();       if(curNode!=NULL)            curNode=curNode->getNext(); } A.32 B.43 C.19 D.18