2. (TCO 3) Which is the stack operation implemented in the following function? The variable n represents the stack top.

int operation()
{
return list[n-1];
} (Points : 3)
Peek
Push
Pop
The constructor of the class Stack

3. (TCO 3) Consider the following program.

Stack s;
s.push(1);
s.push(2);
s.push(3);
s.push(4);
s.pop();
s.pop();
s.pop();
cout << s.peek() << endl; Which is the value displayed by the cout statement? (Points : 3) 1 2 3 4 4. (TCO 3) If the numbers 9, 17, 21, and 34 are inserted in that order in a queue, which will be the first element to be removed? (Points : 3) 9 17 21 34 5. (TCO 3) Which is the queue operation implemented in the following function? The variable count represents the number of elements in the queue. operation() { front = 0; back = size-1; count = 0; } (Points : 3) Enqueue Dequeue Queue initialization Search 6. (TCO 3) Consider the following program. Queue q; q.insert(1); q.insert(2); q.insert(3); q.insert(4); cout << q.getFront() << endl; Which is the value displayed by the cout statement? (Points : 3) 1 2 3 4 7. (TCO 3) In the queue data structure, _____. (Points : 3) insertions occur at the back and deletions occur at the front insertions occur at the front and deletions occur at the back insertions and deletions occur at the top insertions and deletions occur at any end of the queue 8. (TCO 3) An effective way to implement a priority queue is to use a _____. (Points : 3) stack heap file list