ACtE07 · Chapter 7Data Structures, DBMS & Operating Systems🏛️ Past Licensure QuestionID: be2ed062
In a circular queue of size N, with front = rear = O, when is the queue full?
In a circular queue of size N, with front = rear = O, when is the queue full?
Multiple Choice Options
- A
Front = rear
- B
Rear = N-1
- C✓ Correct Option
Rear = (Front + 1) MOD N
- D
Front = (Rear + 1) MOD N
Detailed Technical Solution & Explanation
According to standard engineering principles, for In a circular queue of size N, with front = rear = O, when is the queue full?, the correct choice is Rear = (Front + 1) MOD N.
Option Analysis:
•
Option A (Front = rear): Incorrect. Does not satisfy the technical condition or specifies an alternate/invalid property.
•
Option B (Rear = N-1): Incorrect. Does not satisfy the technical condition or specifies an alternate/invalid property.
•
Option C (Rear = (Front + 1) MOD N): Correct. Valid technical statement directly addressing the question requirement.
•
Option D (Front = (Rear + 1) MOD N): Incorrect. Does not satisfy the technical condition or specifies an alternate/invalid property.
Reference: Demo2 · Set 2NEC Licensure Syllabus