Question 5617 – UGC NET CS 2013 June-paper-2
April 1, 2024Question 4530 – Higher-Education-System
April 2, 2024Question 8839 – Data-Structures
Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operations 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
Correct Answer: A
Question 22 Explanation:
![](https://solutionsadda.in/wp-content/uploads/2020/01/uy.jpg)
To circulate within the queue we have to write mod n for (Rear + 1).
We insert elements using Rear & delete through Front.
full: (REAR+1)mod n == FRONT
empty: REAR == FRONT
empty: REAR == FRONT
full: (REAR+1)mod n == FRONT
empty: (FRONT+1) mod n == REAR
empty: (FRONT+1) mod n == REAR
full: REAR == FRONT
empty: (REAR+1) mod n == FRONT
empty: (REAR+1) mod n == FRONT
full: (FRONT+1)mod n == REAR
empty: REAR == FRONT
empty: REAR == FRONT
Subscribe
Login
0 Comments