01What does FIFO stand for?
02Which operation removes an element from the queue?
03What is a 'Circular Queue'?
04Which structure is used for Breadth-First Search (BFS)?
05A 'Priority Queue' dequeues elements based on:
06What is a 'Deque'?
07What is the complexity of Enqueue in a standard queue?
08How do you implement a queue using two stacks?
09In a circular queue of size 5, if `front=2` and `rear=4`, where does the next item go?
10What is the complexity of finding an element in a queue?