11. What is the primary advantage of using a circular queue over a linear queue? A. Better utilization of memory B. Faster operations C. Simpler implementation D. No advantage Answer & Solution Discuss in Board Save for Later Answer & Solution Answer: Option A No explanation is given for this question Let's Discuss on Board
12. What will happen if you try to dequeue from an empty queue? A. An error is thrown B. The operation succeeds with a null value C. The queue automatically grows D. Nothing happens Answer & Solution Discuss in Board Save for Later Answer & Solution Answer: Option A No explanation is given for this question Let's Discuss on Board
13. In a queue, how do you determine if the queue is full when using a fixed-size array? A. By comparing the current size to the array size B. By checking if the front index is equal to the rear index C. By checking if the rear index is one less than the front index D. By checking if the queue is empty Answer & Solution Discuss in Board Save for Later Answer & Solution Answer: Option C No explanation is given for this question Let's Discuss on Board
14. What is the time complexity of the enqueue operation in a queue implemented using a linked list? A. O(1) B. O(n) C. O(log n) D. O(n log n) Answer & Solution Discuss in Board Save for Later Answer & Solution Answer: Option A No explanation is given for this question Let's Discuss on Board
15. How can you implement a deque (double-ended queue) using a linked list? A. By using a doubly linked list B. By using two single-ended queues C. By using a circular buffer D. By using a priority queue Answer & Solution Discuss in Board Save for Later Answer & Solution Answer: Option A No explanation is given for this question Let's Discuss on Board
16. What is the time complexity of the front operation in a queue implemented using a circular array? A. O(1) B. O(n) C. O(log n) D. O(n log n) Answer & Solution Discuss in Board Save for Later Answer & Solution Answer: Option A No explanation is given for this question Let's Discuss on Board
17. Which type of queue allows elements to be added or removed from both ends? A. Circular Queue B. Priority Queue C. Deque D. Simple Queue Answer & Solution Discuss in Board Save for Later Answer & Solution Answer: Option C No explanation is given for this question Let's Discuss on Board
18. What is the primary purpose of a queue in a multi-threaded environment? A. To manage task execution order B. To perform sorting operations C. To optimize search operations D. To handle recursive calls Answer & Solution Discuss in Board Save for Later Answer & Solution Answer: Option A No explanation is given for this question Let's Discuss on Board
19. How can you implement a queue using two stacks efficiently? A. By using one stack for enqueue and the other for dequeue B. By using one stack to reverse elements and the other to process them C. By using two stacks to manage elements and orders D. By using one stack to store elements and the other to manage order Answer & Solution Discuss in Board Save for Later Answer & Solution Answer: Option A No explanation is given for this question Let's Discuss on Board
20. Which of the following operations in a queue involves removing an element from the front? A. Enqueue B. Dequeue C. Peek D. Insert Answer & Solution Discuss in Board Save for Later Answer & Solution Answer: Option B No explanation is given for this question Let's Discuss on Board
