CUET Computer Science Mock Test Chapter 3 Queue Set A

1. Which of the following is true about linked list implementation of queue?

2. Which of the following is NOT a common operation in a queue data structure?

3. Which one of the following is an application of Queue Data Structure?

4. The minimum number of stacks needed to implement a queue is

5. Given a queue with a linked list implementation. the Rear pointer points to the rear node of the queue. and the front node of the queue points to the front node of the queue, Which of the following operations is impossible to do in O(1) time?

6. How many stacks are needed to implement a queue. Consider the situation where no other data structure like arrays, linked list is available to you.

7. Suppose a stack implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which one of the following statements is TRUE with respect to this modified stack?

8. Which of the following is/are advantages of circular Queue?

9. A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT (n refers to the number of items in the queue)?

10. A queue is implemented using a non-circular singly linked list. The queue has a head pointer and a tail pointer, as shown in the figure. Let n denote the number of nodes in the queue. Let 'enqueue' be implemented by inserting a new node at the head, and 'dequeue' be implemented by deletion of a node from the tail.

11. The deque which stores elements in strictly increasing order or in strictly decreasing order is called ------.

12. Which of the following is the type of priority Queue?

13. A priority queue can efficiently implemented using which of the following data structures? Assume that the number of insert and peek (operation to see the current highest priority item) and extraction (remove the highest priority item) operations are almost same.

14. Let Q denote a queue containing sixteen numbers and S be an empty stack. Head(Q) returns the element at the head of the queue Q without removing it from Q. Similarly Top(S) returns the element at the top of S without removing it from S. Consider the algorithm given below. "gtcs7" The maximum possible number of iterations of the while loop in the algorithm is______ [This Question was originally a Fill-in-the-Blanks question]

15. Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are

16. which data structure is used to implement deque?

17. Circular queue is also called -----.

18. Which of the following option is not correct?

19. Which data structure is commonly used to implement the event-driven simulation of complex systems, such as in computer network simulations or traffic simulations?