1. : What is a simple queue?
(A) A queue with no specific characteristics
(B) A queue that allows elements to be added at both ends
(C) A queue that follows FIFO principle
(D) A queue that follows LIFO principle
2. : Which of the following operations is NOT supported by a simple queue?
(A) Enqueue
(B) Dequeue
(C) Peek
(D) Rearrange
3. : What is a circular queue?
(A) A queue that allows circular access to elements
(B) A queue where elements can be accessed randomly
(C) A queue that follows LIFO principle
(D) A queue that allows resizing dynamically
4. : What advantage does a circular queue offer over a simple queue?
(A) It allows elements to be rearranged
(B) It reduces memory usage
(C) It prevents overflow errors
(D) It supports priority-based operations
5. : In a circular queue, how is the front of the queue updated after a dequeue operation?
(A) It remains fixed
(B) It moves to the next element
(C) It moves to the previous element
(D) It depends on the element dequeued
6. : Which of the following operations is efficient in a circular queue compared to a simple queue?
(A) Enqueue
(B) Dequeue
(C) Peek
(D) Rearrange
7. : What is a priority queue?
(A) A queue where elements are arranged based on their position
(B) A queue that allows elements to be added at both ends
(C) A queue where elements are arranged based on their priority
(D) A queue that allows resizing dynamically
8. : In a priority queue, which element is dequeued first?
(A) The element with the highest priority
(B) The element with the lowest priority
(C) The first element added
(D) The last element added
9. : Which of the following data structures is commonly used to implement a priority queue?
(A) Stack
(B) Array
(C) Linked list
(D) Heap
10. : What is a deque (double-ended queue)?
(A) A queue with two front ends
(B) A queue with two rear ends
(C) A queue that allows elements to be added and removed from both ends
(D) A queue that allows elements to be accessed randomly
11. : Which of the following operations is NOT typically supported by a deque?
(A) Enqueue
(B) Dequeue
(C) Peek
(D) Rearrange
12. : In a deque, which operation allows adding an element to the front of the queue?
(A) Frontenqueue
(B) Dequeuefront
(C) Enqueuefront
(D) Pushfront
13. : Which type of queue is suitable for applications where elements are added based on their urgency or importance?
(A) Simple queue
(B) Circular queue
(C) Priority queue
(D) Deque
14. : What is the main drawback of a simple queue compared to other types of queues?
(A) Limited capacity
(B) Slower insertion operation
(C) Inability to handle priority-based operations
(D) Inefficient memory usage
15. : Which type of queue is most appropriate for implementing a round-robin scheduling algorithm?
(A) Simple queue
(B) Circular queue
(C) Priority queue
(D) Deque
16. : In which scenario would a deque be more advantageous than other types of queues?
(A) When elements need to be added and removed from both ends
(B) When elements are accessed in a random order
(C) When elements are added based on their priority
(D) When elements are added only at the rear
17. : Which type of queue is typically used in printer spooling systems to manage print jobs?
(A) Simple queue
(B) Circular queue
(C) Priority queue
(D) Deque
18. : What is the time complexity of the enqueue operation in a priority queue with a binary heap implementation?
(A) O(1)
(B) O(log n)
(C) O(n)
(D) O(n log n)
19. : In which type of queue does the size remain fixed after initialization?
(A) Simple queue
(B) Circular queue
(C) Priority queue
(D) Deque
20. : Which type of queue efficiently supports applications where elements are added and removed alternately from both ends?
(A) Simple queue
(B) Circular queue
(C) Priority queue
(D) Deque