Answer:
Yes it is possible for the following cases:-
- When the queue is full.
- When the queue is empty.
Explanation:
When the queue is full the the front and the rear references in the circular array implementation are equal because after inserting an element in the queue we increase the rear pointer.So when inserting the last element the rear pointer will be increased and it will become equal to front pointer.
When the queue is empty the front and rear pointer are equal.We remove an element from queue by deleting the element at front pointer decreasing the front pointer when there is only one element and we are deleting that element front and rear pointer will become equal after deleting that element.
<span>If a user name can have seven letters (with no distinction between upper and lower case), and if a letter can be repeated, then the maximum number of names is 26x26x26x26x26x26x26, or 8,031,810,176. That is, slightly more than eight billion names are possible.</span>
