< 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, _____.">

ECET 370 Week 3 Quiz

Published on January 2018 | Categories: School Work | Downloads: 73 | Comments: 0 | Views: 560
of 1
Download PDF   Embed   Report

1. (TCO 3) Which item in the stack is to be removed first? 2. (TCO 3) Which of the following is the stack operation implemented in the following function? The variable n represents the stack top. int operation() { return list[n-1]; 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;=""> 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, _____.

Comments

Content

1. (TCO 3) Which item in the stack is to be removed first? 2. (TCO 3) Which of the following is the stack operation implemented in the following function? The variable n represents the stack top. int operation() { return list[n-1]; 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;=""> 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, _____.

Sponsor Documents

Or use your account on DocShare.tips

Hide

Forgot your password?

Or register your new account on DocShare.tips

Hide

Lost your password? Please enter your email address. You will receive a link to create a new password.

Back to log-in

Close