1. What is the main characteristic of a queue data structure? A. Last In, First Out (LIFO) B. First In, First Out (FIFO) C. Last In, Last Out (LILO) D. First In, Last Out (FILO) 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
2. Which of the following operations is used to add an element to the end of a queue? A. Enqueue B. Dequeue C. Peek D. Push 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
3. What is the time complexity of the dequeue 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
4. Which queue implementation is used for circular buffering? A. Circular queue B. Priority queue C. Double-ended queue D. Simple 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
5. What is the time complexity of accessing the front element in a queue implemented using an 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
6. How can you efficiently implement a queue using two stacks? A. By using one stack for enqueue and the other for dequeue B. By using one stack to store elements and the other to reverse them C. By alternating between two stacks D. By using two stacks for different operations 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
7. What is the main disadvantage of a queue implemented using a fixed-size array? A. Fixed size limits capacity B. Inefficient memory usage C. Slow operations D. Complexity in implementation 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
8. In which scenario is a priority queue particularly useful? A. When elements need to be processed in a specific order B. When elements need to be added or removed in any order C. When all elements have equal priority D. When you need a simple 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
9. What does the term "enqueue" refer to in a queue data structure? A. Removing an element from the front B. Adding an element to the back C. Retrieving the element at the front D. Clearing all elements from the queue 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
10. Which of the following operations is NOT supported by a standard queue? A. Enqueue B. Dequeue C. Peek D. Insert at specific position Answer & Solution Discuss in Board Save for Later Answer & Solution Answer: Option D No explanation is given for this question Let's Discuss on Board
