Time left:

[All Quizzes] → [Practical Data Structures] → [Stacks and Queues]


1. ► Only top element can be accessed in stack

A.
B.

2. ► Queue can be implemented using a list

A.
B.

3. ► An element of the priority queue can be accessed only in O(n) time

A.
B.

4. ► A queue has FIFO ordering

A.
B.

5. ► STL stack uses deque to implement stack

A.
B.

6. ► Stacks have LIFO ordering

A.
B.

7. ► Nested function calls form a stack

A.
B.

8. ► Accessing top element in stack is constant time operation

A.
B.

9. ► priority_queue forms the basis of many algorithms

A.
B.

10. ► priority_queue’s priority function cannot be changed

A.
B.


© 2016 VirtuQ™ Education All right reserved. | Terms of Use | Privacy Policy