Database-Management-System
April 1, 2024Question 4530 – Higher-Education-System
April 2, 2024Data-Structures
| Question 21 |
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
| full: (REAR+1)mod n == FRONT empty: REAR == FRONT | |
| full: (REAR+1)mod n == FRONT empty: (FRONT+1) mod n == REAR | |
| full: REAR == FRONT empty: (REAR+1) mod n == FRONT | |
| full: (FRONT+1)mod n == REAR empty: REAR == FRONT |
Question 21 Explanation:
To circulate within the queue we have to write mod n for (Rear + 1).
We insert elements using Rear & delete through Front.
Correct Answer: A
Question 21 Explanation:
To circulate within the queue we have to write mod n for (Rear + 1).
We insert elements using Rear & delete through Front.