--:--









Quiz for Containers deque

Course: C++ Language | Subject: Unit 11 | Topic: The Standard Template Library (STL)



Logo

Q1: What does deque stand for in STL?

Logo

Q2: Which operations are efficient on a deque?

Logo

Q3: Does STL deque support random access?

Logo

Q4: Which STL container provides faster insertion/deletion at front than vector?

Logo

Q5: What is the default underlying data structure of deque?

Logo

Q6: Which method adds an element to the front of a deque?

Logo

Q7: Which method adds an element to the back of a deque?

Logo

Q8: Which STL container is more memory efficient than list but slower for insertion/deletion in the middle?

Logo

Q9: Which method removes the last element from deque?

Logo

Q10: Which method removes the first element from deque?

Logo

Q11: Can deque grow dynamically in size?

Logo

Q12: Does deque support iterators?

Logo

Q13: Which of the following containers allows insertion and deletion at both ends?

Logo

Q14: Is deque implemented as a linked list?

Logo

Q15: Which STL container provides better performance for random access: vector or deque?

Logo

Q16: Can deque be used as a stack?

Logo

Q17: Which method returns the number of elements in a deque?

Logo

Q18: Which method removes all elements from a deque?

Are you ready to start test? Set your time limit