Free Test Containers queue – C++ Lan...

Q1: What type of data structure is a queue?

A. First In First Out (FIFO) B. Last In First Out (LIFO) C. Random Access D. Priority Queue

Q2: Which STL container is typically used to implement a queue?

A. deque B. list C. vector D. set

Q3: Which function adds an element to the end of the queue?

A. push() B. pop() C. front() D. insert()

Q4: Which function removes the front element from the queue?

A. pop() B. push() C. back() D. remove()

Q5: How to access the front element of a queue without removing it?

A. front() B. top() C. back() D. peek()

Q6: How to access the last element of a queue?

A. back() B. front() C. top() D. peek()

Q7: What does the empty() function return?

A. True if the queue is empty B. Number of elements in queue C. Front element value D. Removes the front element

Q8: What is the time complexity of push and pop operations in queue?

A. O(1) B. O(n) C. O(log n) D. O(n^2)

Q9: Which header file must be included to use queue in STL?

A. <queue> B. <vector> C. <list> D. <deque>

Q10: Can you iterate over elements of a queue directly?

A. No, queue does not provide iterators B. Yes, using begin() and end() C. Yes, using iterator() D. Yes, using for loop

Q11: Is queue a container or a container adapter?

A. Container adapter B. Container C. Function D. Algorithm

Q12: Which underlying container is NOT allowed by default in STL queue?

A. set B. deque C. vector D. list

Q13: How do you check if a queue is empty?

A. Using empty() B. Using size() C. Using front() D. Using is_empty()

Q14: Which of the following is NOT a queue operation?

A. insert() B. push() C. pop() D. front()

Q15: Can queue be used to implement breadth-first search (BFS)?

A. Yes B. No C. Only with stack D. Only with vector

Q16: What will happen if pop() is called on an empty queue?

A. Undefined behavior B. Returns false C. Throws exception D. Returns null

Q17: Which container adapter does STL queue resemble?

A. Queue data structure B. Stack C. Priority queue D. Deque

Q18: What is the default underlying container for STL queue?

A. deque B. vector C. list D. set

Q19: Can you access elements other than the front or back in a queue?

A. No B. Yes, using iterators C. Yes, using at() D. Yes, using indexing

Q20: Which of these functions does NOT modify the queue?

A. front() B. push() C. pop() D. clear()

Quiz for Containers queue