endl;="">. . 4. (TCO 3) The _____ is a data structure that satisfies the FIFO (first in, first out) principle.. . 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;. . 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?. . 7. (TCO 3) If the numbers 9, 17, 21, 34 are inserted, in that order, in a queue, which will be the first element to be removed?. . 8. (TCO 3) In the queue data structure, _____.. . 9. (TCO 3) An effective way to implement a priority queue is to use a _____.. . 10. (TCO 3) If the numbers 1, 54, 27, 6 are inserted, in that order, in a priority queue, which will be the first element to be removed?. . 11. (TCO 3) In the deque data structure, _____." /> < endl;="">. . 4. (TCO 3) The _____ is a data structure that satisfies the FIFO (first in, first out) principle.. . 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;. . 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?. . 7. (TCO 3) If the numbers 9, 17, 21, 34 are inserted, in that order, in a queue, which will be the first element to be removed?. . 8. (TCO 3) In the queue data structure, _____.. . 9. (TCO 3) An effective way to implement a priority queue is to use a _____.. . 10. (TCO 3) If the numbers 1, 54, 27, 6 are inserted, in that order, in a priority queue, which will be the first element to be removed?. . 11. (TCO 3) In the deque data structure, _____.">